./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/openbsd_cstrstr-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 383b4a741115f7461f3219e8b6813a438e778f299f3d0f3c72277e19fd6c8f24 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 01:40:16,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 01:40:16,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 01:40:16,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 01:40:16,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 01:40:16,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 01:40:16,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 01:40:16,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 01:40:16,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 01:40:16,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 01:40:16,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 01:40:16,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 01:40:16,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 01:40:16,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 01:40:16,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 01:40:16,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 01:40:16,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 01:40:16,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 01:40:16,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 01:40:16,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 01:40:16,504 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 01:40:16,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 01:40:16,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 01:40:16,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 01:40:16,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 01:40:16,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 01:40:16,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 01:40:16,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 01:40:16,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 01:40:16,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 01:40:16,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 01:40:16,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 01:40:16,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 01:40:16,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 01:40:16,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 01:40:16,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 01:40:16,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 01:40:16,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 01:40:16,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 01:40:16,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 01:40:16,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 01:40:16,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 01:40:16,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-22 01:40:16,554 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 01:40:16,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 01:40:16,555 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 01:40:16,555 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 01:40:16,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 01:40:16,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 01:40:16,557 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 01:40:16,557 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 01:40:16,557 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 01:40:16,558 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 01:40:16,558 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 01:40:16,558 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 01:40:16,559 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 01:40:16,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 01:40:16,559 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 01:40:16,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 01:40:16,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 01:40:16,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 01:40:16,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 01:40:16,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 01:40:16,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 01:40:16,560 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 01:40:16,561 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 01:40:16,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 01:40:16,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 01:40:16,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 01:40:16,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 01:40:16,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 01:40:16,564 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 01:40:16,564 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 383b4a741115f7461f3219e8b6813a438e778f299f3d0f3c72277e19fd6c8f24 [2022-07-22 01:40:16,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 01:40:16,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 01:40:16,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 01:40:16,878 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 01:40:16,879 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 01:40:16,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca-1.i [2022-07-22 01:40:16,947 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a09b7dd5/0f91e6ce1b834418a74c1b2a36d0889d/FLAG6d72c626d [2022-07-22 01:40:17,412 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 01:40:17,412 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrstr-alloca-1.i [2022-07-22 01:40:17,427 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a09b7dd5/0f91e6ce1b834418a74c1b2a36d0889d/FLAG6d72c626d [2022-07-22 01:40:17,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a09b7dd5/0f91e6ce1b834418a74c1b2a36d0889d [2022-07-22 01:40:17,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 01:40:17,447 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 01:40:17,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 01:40:17,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 01:40:17,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 01:40:17,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:40:17" (1/1) ... [2022-07-22 01:40:17,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9fc0b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:17, skipping insertion in model container [2022-07-22 01:40:17,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:40:17" (1/1) ... [2022-07-22 01:40:17,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 01:40:17,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 01:40:17,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:40:17,833 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 01:40:17,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:40:17,901 INFO L208 MainTranslator]: Completed translation [2022-07-22 01:40:17,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:17 WrapperNode [2022-07-22 01:40:17,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 01:40:17,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 01:40:17,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 01:40:17,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 01:40:17,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:17" (1/1) ... [2022-07-22 01:40:17,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:17" (1/1) ... [2022-07-22 01:40:17,963 INFO L137 Inliner]: procedures = 113, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2022-07-22 01:40:17,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 01:40:17,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 01:40:17,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 01:40:17,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 01:40:17,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:17" (1/1) ... [2022-07-22 01:40:17,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:17" (1/1) ... [2022-07-22 01:40:17,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:17" (1/1) ... [2022-07-22 01:40:17,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:17" (1/1) ... [2022-07-22 01:40:17,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:17" (1/1) ... [2022-07-22 01:40:17,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:17" (1/1) ... [2022-07-22 01:40:17,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:17" (1/1) ... [2022-07-22 01:40:17,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 01:40:17,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 01:40:17,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 01:40:17,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 01:40:17,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:17" (1/1) ... [2022-07-22 01:40:18,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:18,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:18,024 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 01:40:18,053 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 01:40:18,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 01:40:18,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 01:40:18,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 01:40:18,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 01:40:18,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 01:40:18,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 01:40:18,150 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 01:40:18,151 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 01:40:18,392 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 01:40:18,397 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 01:40:18,397 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 01:40:18,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:40:18 BoogieIcfgContainer [2022-07-22 01:40:18,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 01:40:18,400 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 01:40:18,400 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 01:40:18,403 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 01:40:18,408 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:40:18,408 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 01:40:17" (1/3) ... [2022-07-22 01:40:18,409 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b3d8151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:40:18, skipping insertion in model container [2022-07-22 01:40:18,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:40:18,410 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:40:17" (2/3) ... [2022-07-22 01:40:18,411 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b3d8151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:40:18, skipping insertion in model container [2022-07-22 01:40:18,411 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:40:18,411 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:40:18" (3/3) ... [2022-07-22 01:40:18,412 INFO L354 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca-1.i [2022-07-22 01:40:18,473 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 01:40:18,473 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 01:40:18,473 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 01:40:18,473 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 01:40:18,474 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 01:40:18,474 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 01:40:18,474 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 01:40:18,474 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 01:40:18,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:18,494 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-22 01:40:18,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:40:18,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:40:18,500 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 01:40:18,500 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:40:18,501 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 01:40:18,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:18,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-22 01:40:18,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:40:18,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:40:18,507 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 01:40:18,507 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:40:18,514 INFO L752 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~ret24#1.base, main_#t~ret24#1.offset, 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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 21#L588true assume !(main_~length1~0#1 < 1); 9#L588-2true assume !(main_~length2~0#1 < 1); 16#L591-1true call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 19#L573true assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 30#L551-4true [2022-07-22 01:40:18,514 INFO L754 eck$LassoCheckResult]: Loop: 30#L551-4true call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 22#L551-1true assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 23#L551-3true cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 30#L551-4true [2022-07-22 01:40:18,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:18,524 INFO L85 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2022-07-22 01:40:18,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:18,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798332376] [2022-07-22 01:40:18,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:18,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:18,708 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:18,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:18,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:18,776 INFO L85 PathProgramCache]: Analyzing trace with hash 51799, now seen corresponding path program 1 times [2022-07-22 01:40:18,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:18,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827815849] [2022-07-22 01:40:18,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:18,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:18,784 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:18,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:18,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:18,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1298288364, now seen corresponding path program 1 times [2022-07-22 01:40:18,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:18,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004834698] [2022-07-22 01:40:18,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:18,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:18,841 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:18,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:19,831 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:40:19,832 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:40:19,832 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:40:19,832 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:40:19,832 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:40:19,832 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:19,833 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:40:19,833 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:40:19,833 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-1.i_Iteration1_Lasso [2022-07-22 01:40:19,833 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:40:19,833 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:40:19,852 INFO 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 01:40:19,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 01:40:19,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 01:40:19,862 INFO 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 01:40:19,864 INFO 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 01:40:19,866 INFO 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 01:40:20,353 INFO 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 01:40:20,361 INFO 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 01:40:20,364 INFO 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 01:40:20,366 INFO 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 01:40:20,369 INFO 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 01:40:20,371 INFO 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 01:40:20,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 01:40:20,376 INFO 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 01:40:20,379 INFO 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 01:40:20,382 INFO 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 01:40:20,384 INFO 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 01:40:20,386 INFO 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 01:40:20,388 INFO 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 01:40:20,390 INFO 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 01:40:20,396 INFO 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 01:40:20,398 INFO 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 01:40:20,400 INFO 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 01:40:20,401 INFO 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 01:40:20,403 INFO 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 01:40:20,405 INFO 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 01:40:20,407 INFO 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 01:40:20,409 INFO 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 01:40:20,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 01:40:20,830 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:40:20,836 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:40:20,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:20,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:20,840 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 01:40:20,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:20,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:20,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:20,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:20,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:20,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:20,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:20,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:20,863 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 01:40:20,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:20,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:20,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:20,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:20,887 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 01:40:20,892 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 01:40:20,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:20,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:20,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:20,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:20,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:20,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:20,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:20,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:20,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:20,923 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 01:40:20,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:20,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:20,925 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 01:40:20,926 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 01:40:20,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:20,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:20,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:20,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:20,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:20,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:20,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:20,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:20,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:20,955 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 01:40:20,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:20,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:20,956 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 01:40:20,957 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 01:40:20,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:20,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:20,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:20,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:20,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:20,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:20,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:20,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:20,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:20,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:20,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:20,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:20,984 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 01:40:20,988 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 01:40:20,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:20,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:20,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:20,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:20,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:20,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:20,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:20,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:20,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:21,013 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 01:40:21,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:21,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:21,017 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 01:40:21,019 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 01:40:21,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:21,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:21,026 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 01:40:21,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:21,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:21,038 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 01:40:21,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:21,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:21,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-22 01:40:21,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:21,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:21,061 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 01:40:21,062 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 01:40:21,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:21,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:21,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:21,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:21,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:21,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:21,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:21,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:21,126 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 01:40:21,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:21,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:21,128 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 01:40:21,128 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 01:40:21,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:21,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:21,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:21,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:21,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:21,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:21,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:21,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:21,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-22 01:40:21,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:21,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:21,169 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 01:40:21,170 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 01:40:21,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:21,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:21,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:21,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:21,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:21,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:21,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:21,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:21,233 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 01:40:21,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:21,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:21,235 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 01:40:21,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:21,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:21,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:21,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:21,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:21,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:21,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:21,264 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 01:40:21,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:21,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:21,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:21,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:21,296 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 01:40:21,296 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 01:40:21,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:21,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:21,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:21,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:21,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:21,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:21,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:21,341 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:40:21,401 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-22 01:40:21,401 INFO L444 ModelExtractionUtils]: 9 out of 34 variables were initially zero. Simplification set additionally 22 variables to zero. [2022-07-22 01:40:21,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:21,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:21,431 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 01:40:21,486 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:40:21,493 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 01:40:21,512 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:40:21,513 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:40:21,513 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc23#1.base)_1, ULTIMATE.start_cstrlen_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23#1.base)_1 - 1*ULTIMATE.start_cstrlen_~s~0#1.offset Supporting invariants [] [2022-07-22 01:40:21,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-22 01:40:21,584 INFO L293 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2022-07-22 01:40:21,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:21,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-22 01:40:21,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:21,693 WARN L261 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:40:21,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:21,759 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 01:40:21,790 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 01:40:21,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:21,792 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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 01:40:21,893 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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 80 states and 111 transitions. Complement of second has 7 states. [2022-07-22 01:40:21,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 01:40:21,899 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 01:40:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-07-22 01:40:21,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 3 letters. [2022-07-22 01:40:21,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:21,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 9 letters. Loop has 3 letters. [2022-07-22 01:40:21,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:21,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 77 transitions. Stem has 6 letters. Loop has 6 letters. [2022-07-22 01:40:21,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:21,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 111 transitions. [2022-07-22 01:40:21,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-07-22 01:40:21,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 27 states and 36 transitions. [2022-07-22 01:40:21,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-07-22 01:40:21,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-22 01:40:21,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2022-07-22 01:40:21,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:40:21,911 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-07-22 01:40:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2022-07-22 01:40:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-22 01:40:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-07-22 01:40:21,932 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-07-22 01:40:21,932 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-07-22 01:40:21,932 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 01:40:21,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2022-07-22 01:40:21,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-07-22 01:40:21,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:40:21,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:40:21,934 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:40:21,934 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:40:21,934 INFO L752 eck$LassoCheckResult]: Stem: 243#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 231#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~ret24#1.base, main_#t~ret24#1.offset, 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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 232#L588 assume !(main_~length1~0#1 < 1); 234#L588-2 assume !(main_~length2~0#1 < 1); 235#L591-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 241#L573 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 244#L551-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 246#L551-1 assume !(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 242#L551-5 assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := (if cstrlen_~s~0#1.offset - cstrlen_~str#1.offset < 0 && 0 != (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) % 1 then 1 + (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) / 1 else (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) / 1); 237#L553 cstrstr_#t~ret15#1 := cstrlen_#res#1;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1; 238#L575-4 [2022-07-22 01:40:21,934 INFO L754 eck$LassoCheckResult]: Loop: 238#L575-4 goto; 239#L576-2 cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post17#1.base, 1 + cstrstr_#t~post17#1.offset;call cstrstr_#t~mem18#1 := read~int(cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem18#1; 240#L577 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset;havoc cstrstr_#t~mem18#1; 245#L576 assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 223#L575-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem6#1, cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset, cstrncmp_#t~mem7#1, cstrncmp_#t~mem9#1, cstrncmp_#t~pre8#1.base, cstrncmp_#t~pre8#1.offset, cstrncmp_#t~mem10#1, cstrncmp_#t~post11#1.base, cstrncmp_#t~post11#1.offset, cstrncmp_#t~mem12#1, cstrncmp_#t~pre4#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; 224#L558 assume 0 == cstrncmp_~n#1 % 18446744073709551616;cstrncmp_#res#1 := 0; 226#L566 cstrstr_#t~ret16#1 := cstrncmp_#res#1;assume { :end_inline_cstrncmp } true; 236#L575-2 assume !!(0 != cstrstr_#t~ret16#1);havoc cstrstr_#t~ret16#1; 238#L575-4 [2022-07-22 01:40:21,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:21,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 1 times [2022-07-22 01:40:21,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:21,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494826654] [2022-07-22 01:40:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:21,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:21,961 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:21,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:21,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:21,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1752516368, now seen corresponding path program 1 times [2022-07-22 01:40:21,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:21,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153147731] [2022-07-22 01:40:21,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:21,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:22,022 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 01:40:22,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:40:22,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153147731] [2022-07-22 01:40:22,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153147731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:40:22,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:40:22,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:40:22,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039891705] [2022-07-22 01:40:22,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:40:22,025 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:40:22,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:40:22,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 01:40:22,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 01:40:22,029 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 11 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 01:40:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:40:22,050 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-07-22 01:40:22,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 01:40:22,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2022-07-22 01:40:22,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-22 01:40:22,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 32 transitions. [2022-07-22 01:40:22,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-07-22 01:40:22,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-07-22 01:40:22,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2022-07-22 01:40:22,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:40:22,054 INFO L369 hiAutomatonCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-22 01:40:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2022-07-22 01:40:22,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-22 01:40:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-07-22 01:40:22,056 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-22 01:40:22,056 INFO L374 stractBuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-22 01:40:22,056 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 01:40:22,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2022-07-22 01:40:22,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-22 01:40:22,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:40:22,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:40:22,057 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:40:22,057 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:40:22,058 INFO L752 eck$LassoCheckResult]: Stem: 292#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 293#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~ret24#1.base, main_#t~ret24#1.offset, 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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 303#L588 assume !(main_~length1~0#1 < 1); 304#L588-2 assume !(main_~length2~0#1 < 1); 310#L591-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 297#L573 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 298#L551-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 305#L551-1 assume !(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 288#L551-5 assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := (if cstrlen_~s~0#1.offset - cstrlen_~str#1.offset < 0 && 0 != (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) % 1 then 1 + (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) / 1 else (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) / 1); 289#L553 cstrstr_#t~ret15#1 := cstrlen_#res#1;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1; 312#L575-4 [2022-07-22 01:40:22,058 INFO L754 eck$LassoCheckResult]: Loop: 312#L575-4 goto; 302#L576-2 cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post17#1.base, 1 + cstrstr_#t~post17#1.offset;call cstrstr_#t~mem18#1 := read~int(cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem18#1; 313#L577 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset;havoc cstrstr_#t~mem18#1; 301#L576 assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 290#L575-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem6#1, cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset, cstrncmp_#t~mem7#1, cstrncmp_#t~mem9#1, cstrncmp_#t~pre8#1.base, cstrncmp_#t~pre8#1.offset, cstrncmp_#t~mem10#1, cstrncmp_#t~post11#1.base, cstrncmp_#t~post11#1.offset, cstrncmp_#t~mem12#1, cstrncmp_#t~pre4#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; 291#L558 assume !(0 == cstrncmp_~n#1 % 18446744073709551616); 309#L560-4 call cstrncmp_#t~mem6#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post5#1.base, 1 + cstrncmp_#t~post5#1.offset;call cstrncmp_#t~mem7#1 := read~int(cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset, 1); 294#L561 assume cstrncmp_#t~mem6#1 != cstrncmp_#t~mem7#1;havoc cstrncmp_#t~mem6#1;havoc cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset;havoc cstrncmp_#t~mem7#1;call cstrncmp_#t~mem9#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~pre8#1.base, cstrncmp_#t~pre8#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;call cstrncmp_#t~mem10#1 := read~int(cstrncmp_#t~pre8#1.base, cstrncmp_#t~pre8#1.offset, 1);cstrncmp_#res#1 := cstrncmp_#t~mem9#1 % 256 - cstrncmp_#t~mem10#1 % 256;havoc cstrncmp_#t~mem9#1;havoc cstrncmp_#t~pre8#1.base, cstrncmp_#t~pre8#1.offset;havoc cstrncmp_#t~mem10#1; 295#L566 cstrstr_#t~ret16#1 := cstrncmp_#res#1;assume { :end_inline_cstrncmp } true; 311#L575-2 assume !!(0 != cstrstr_#t~ret16#1);havoc cstrstr_#t~ret16#1; 312#L575-4 [2022-07-22 01:40:22,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:22,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1592231857, now seen corresponding path program 2 times [2022-07-22 01:40:22,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:22,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245587683] [2022-07-22 01:40:22,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:22,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:22,080 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:22,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:22,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:22,099 INFO L85 PathProgramCache]: Analyzing trace with hash 542190293, now seen corresponding path program 1 times [2022-07-22 01:40:22,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:22,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716586281] [2022-07-22 01:40:22,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:22,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:22,112 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:22,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:22,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:22,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1106695813, now seen corresponding path program 1 times [2022-07-22 01:40:22,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:22,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790306734] [2022-07-22 01:40:22,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:22,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:22,346 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 01:40:22,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:40:22,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790306734] [2022-07-22 01:40:22,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790306734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:40:22,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:40:22,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 01:40:22,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109119809] [2022-07-22 01:40:22,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:40:22,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:40:22,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 01:40:22,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 01:40:22,737 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:22,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:40:22,817 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-07-22 01:40:22,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 01:40:22,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2022-07-22 01:40:22,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2022-07-22 01:40:22,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 41 transitions. [2022-07-22 01:40:22,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-22 01:40:22,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-22 01:40:22,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2022-07-22 01:40:22,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:40:22,820 INFO L369 hiAutomatonCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-07-22 01:40:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2022-07-22 01:40:22,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-07-22 01:40:22,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 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 01:40:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-22 01:40:22,822 INFO L392 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-22 01:40:22,822 INFO L374 stractBuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-22 01:40:22,822 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 01:40:22,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2022-07-22 01:40:22,823 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2022-07-22 01:40:22,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:40:22,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:40:22,823 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:40:22,824 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:40:22,824 INFO L752 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 373#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~ret24#1.base, main_#t~ret24#1.offset, 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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 383#L588 assume !(main_~length1~0#1 < 1); 384#L588-2 assume !(main_~length2~0#1 < 1); 390#L591-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 377#L573 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 378#L551-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 385#L551-1 assume !(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 368#L551-5 assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := (if cstrlen_~s~0#1.offset - cstrlen_~str#1.offset < 0 && 0 != (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) % 1 then 1 + (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) / 1 else (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) / 1); 369#L553 cstrstr_#t~ret15#1 := cstrlen_#res#1;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1; 392#L575-4 goto; 382#L576-2 [2022-07-22 01:40:22,824 INFO L754 eck$LassoCheckResult]: Loop: 382#L576-2 cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post17#1.base, 1 + cstrstr_#t~post17#1.offset;call cstrstr_#t~mem18#1 := read~int(cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem18#1; 393#L577 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset;havoc cstrstr_#t~mem18#1; 381#L576 assume !!(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 382#L576-2 [2022-07-22 01:40:22,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2114547350, now seen corresponding path program 1 times [2022-07-22 01:40:22,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:22,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828959777] [2022-07-22 01:40:22,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:22,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:22,838 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:22,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:22,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:22,888 INFO L85 PathProgramCache]: Analyzing trace with hash 71663, now seen corresponding path program 1 times [2022-07-22 01:40:22,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:22,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104043841] [2022-07-22 01:40:22,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:22,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:22,893 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:22,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:22,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:22,901 INFO L85 PathProgramCache]: Analyzing trace with hash 194815290, now seen corresponding path program 1 times [2022-07-22 01:40:22,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:22,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240784605] [2022-07-22 01:40:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:22,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:22,931 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:22,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:23,801 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:40:23,801 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:40:23,802 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:40:23,802 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:40:23,802 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:40:23,802 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:23,802 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:40:23,802 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:40:23,802 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-1.i_Iteration4_Lasso [2022-07-22 01:40:23,802 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:40:23,802 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:40:23,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 01:40:23,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 01:40:23,810 INFO 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 01:40:23,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 01:40:23,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 01:40:23,815 INFO 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 01:40:23,821 INFO 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 01:40:23,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 01:40:23,825 INFO 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 01:40:23,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 01:40:24,355 INFO 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 01:40:24,357 INFO 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 01:40:24,360 INFO 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 01:40:24,362 INFO 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 01:40:24,364 INFO 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 01:40:24,365 INFO 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 01:40:24,367 INFO 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 01:40:24,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 01:40:24,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 01:40:24,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 01:40:24,377 INFO 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 01:40:24,379 INFO 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 01:40:24,382 INFO 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 01:40:24,384 INFO 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 01:40:24,386 INFO 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 01:40:24,389 INFO 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 01:40:24,899 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:40:24,899 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:40:24,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:24,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:24,904 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 01:40:24,906 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 01:40:24,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:24,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:24,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:24,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:24,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:24,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:24,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:24,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:24,929 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:24,956 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 01:40:24,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:24,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:24,958 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 01:40:24,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:24,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:24,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:24,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:24,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:24,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:24,974 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 01:40:24,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:24,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:24,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:25,008 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 01:40:25,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:25,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:25,010 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 01:40:25,010 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 01:40:25,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:25,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:25,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:25,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:25,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:25,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:25,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:25,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:25,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:25,039 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 01:40:25,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:25,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:25,041 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 01:40:25,041 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 01:40:25,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:25,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:25,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:25,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:25,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:25,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:25,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:25,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:25,095 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 01:40:25,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:25,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:25,097 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 01:40:25,097 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 01:40:25,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:25,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:25,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:25,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:25,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:25,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:25,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:25,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:25,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:25,124 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 01:40:25,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:25,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:25,126 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 01:40:25,127 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 01:40:25,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:25,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:25,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:25,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:25,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:25,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:25,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:25,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:25,138 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:25,155 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 01:40:25,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:25,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:25,158 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 01:40:25,159 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 01:40:25,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:25,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:25,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:25,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:25,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:25,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:25,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:25,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:25,233 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 01:40:25,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:25,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:25,235 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 01:40:25,236 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 01:40:25,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:25,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:25,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:25,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:25,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:25,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:25,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:25,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:25,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:25,261 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 01:40:25,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:25,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:25,262 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 01:40:25,263 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 01:40:25,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:25,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:25,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:25,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:25,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:25,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:25,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:25,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:25,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:25,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:25,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:25,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:25,290 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 01:40:25,291 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 01:40:25,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:25,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:25,299 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 01:40:25,299 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-07-22 01:40:25,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:25,328 INFO L401 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2022-07-22 01:40:25,328 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2022-07-22 01:40:25,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:25,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:25,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:25,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:25,404 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 01:40:25,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:25,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:25,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:25,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:25,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:25,416 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 01:40:25,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:25,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:25,439 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:40:25,470 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-22 01:40:25,470 INFO L444 ModelExtractionUtils]: 15 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-07-22 01:40:25,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:25,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:25,472 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 01:40:25,480 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:40:25,488 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 01:40:25,504 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:40:25,504 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:40:25,504 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrstr_~s#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc22#1.base)_2) = -1*ULTIMATE.start_cstrstr_~s#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc22#1.base)_2 Supporting invariants [] [2022-07-22 01:40:25,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:25,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:25,599 INFO L293 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 01:40:25,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:25,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:40:25,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:25,684 WARN L261 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 01:40:25,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:25,715 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 01:40:25,716 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 01:40:25,716 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:25,745 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 50 states and 58 transitions. Complement of second has 5 states. [2022-07-22 01:40:25,746 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 01:40:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-07-22 01:40:25,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 3 letters. [2022-07-22 01:40:25,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:25,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 14 letters. Loop has 3 letters. [2022-07-22 01:40:25,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:25,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2022-07-22 01:40:25,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:25,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2022-07-22 01:40:25,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:40:25,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 42 transitions. [2022-07-22 01:40:25,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-22 01:40:25,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-22 01:40:25,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2022-07-22 01:40:25,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:40:25,749 INFO L369 hiAutomatonCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-07-22 01:40:25,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2022-07-22 01:40:25,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-22 01:40:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-07-22 01:40:25,752 INFO L392 hiAutomatonCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-07-22 01:40:25,752 INFO L374 stractBuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-07-22 01:40:25,752 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 01:40:25,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2022-07-22 01:40:25,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:40:25,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:40:25,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:40:25,753 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:40:25,753 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 01:40:25,753 INFO L752 eck$LassoCheckResult]: Stem: 611#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 612#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~ret24#1.base, main_#t~ret24#1.offset, 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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 622#L588 assume !(main_~length1~0#1 < 1); 623#L588-2 assume !(main_~length2~0#1 < 1); 630#L591-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 617#L573 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 618#L551-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 625#L551-1 assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 626#L551-3 cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 627#L551-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 624#L551-1 assume !(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 600#L551-5 assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := (if cstrlen_~s~0#1.offset - cstrlen_~str#1.offset < 0 && 0 != (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) % 1 then 1 + (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) / 1 else (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) / 1); 601#L553 cstrstr_#t~ret15#1 := cstrlen_#res#1;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1; 632#L575-4 goto; 633#L576-2 cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post17#1.base, 1 + cstrstr_#t~post17#1.offset;call cstrstr_#t~mem18#1 := read~int(cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem18#1; 634#L577 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset;havoc cstrstr_#t~mem18#1; 619#L576 assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 602#L575-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem6#1, cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset, cstrncmp_#t~mem7#1, cstrncmp_#t~mem9#1, cstrncmp_#t~pre8#1.base, cstrncmp_#t~pre8#1.offset, cstrncmp_#t~mem10#1, cstrncmp_#t~post11#1.base, cstrncmp_#t~post11#1.offset, cstrncmp_#t~mem12#1, cstrncmp_#t~pre4#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; 603#L558 assume !(0 == cstrncmp_~n#1 % 18446744073709551616); 628#L560-4 [2022-07-22 01:40:25,753 INFO L754 eck$LassoCheckResult]: Loop: 628#L560-4 call cstrncmp_#t~mem6#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post5#1.base, 1 + cstrncmp_#t~post5#1.offset;call cstrncmp_#t~mem7#1 := read~int(cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset, 1); 606#L561 assume !(cstrncmp_#t~mem6#1 != cstrncmp_#t~mem7#1);havoc cstrncmp_#t~mem6#1;havoc cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset;havoc cstrncmp_#t~mem7#1;cstrncmp_#t~post11#1.base, cstrncmp_#t~post11#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post11#1.base, 1 + cstrncmp_#t~post11#1.offset;call cstrncmp_#t~mem12#1 := read~int(cstrncmp_#t~post11#1.base, cstrncmp_#t~post11#1.offset, 1); 607#L563 assume !(0 == cstrncmp_#t~mem12#1);havoc cstrncmp_#t~post11#1.base, cstrncmp_#t~post11#1.offset;havoc cstrncmp_#t~mem12#1; 613#L560-1 cstrncmp_#t~pre4#1 := cstrncmp_~n#1 - 1;cstrncmp_~n#1 := cstrncmp_~n#1 - 1; 614#L560-2 assume !!(0 != cstrncmp_#t~pre4#1 % 18446744073709551616);havoc cstrncmp_#t~pre4#1; 628#L560-4 [2022-07-22 01:40:25,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash -912258627, now seen corresponding path program 1 times [2022-07-22 01:40:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:25,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118255151] [2022-07-22 01:40:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:25,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:25,773 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:25,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:25,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:25,790 INFO L85 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 1 times [2022-07-22 01:40:25,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:25,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087319421] [2022-07-22 01:40:25,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:25,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:25,796 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:25,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:25,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:25,802 INFO L85 PathProgramCache]: Analyzing trace with hash -599457521, now seen corresponding path program 1 times [2022-07-22 01:40:25,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:25,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296726443] [2022-07-22 01:40:25,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:25,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:40:25,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:40:25,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296726443] [2022-07-22 01:40:25,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296726443] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:40:25,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20662519] [2022-07-22 01:40:25,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:25,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:40:25,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:25,912 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:40:25,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-22 01:40:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:25,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-22 01:40:25,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:40:26,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:40:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:40:26,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20662519] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:40:26,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:40:26,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-07-22 01:40:26,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563457013] [2022-07-22 01:40:26,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:40:26,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:40:26,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 01:40:26,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-07-22 01:40:26,413 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 9 Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:40:26,555 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-07-22 01:40:26,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 01:40:26,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 83 transitions. [2022-07-22 01:40:26,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:40:26,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 41 states and 47 transitions. [2022-07-22 01:40:26,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-22 01:40:26,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-22 01:40:26,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2022-07-22 01:40:26,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:40:26,558 INFO L369 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-07-22 01:40:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2022-07-22 01:40:26,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-07-22 01:40:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:40:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-07-22 01:40:26,560 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-22 01:40:26,560 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-22 01:40:26,560 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 01:40:26,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2022-07-22 01:40:26,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:40:26,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:40:26,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:40:26,561 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:40:26,561 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 01:40:26,561 INFO L752 eck$LassoCheckResult]: Stem: 882#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 883#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~ret24#1.base, main_#t~ret24#1.offset, 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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 898#L588 assume !(main_~length1~0#1 < 1); 899#L588-2 assume !(main_~length2~0#1 < 1); 907#L591-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 889#L573 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 890#L551-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 913#L551-1 assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 903#L551-3 cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 904#L551-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 901#L551-1 assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 902#L551-3 cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 914#L551-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 900#L551-1 assume !(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 876#L551-5 assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := (if cstrlen_~s~0#1.offset - cstrlen_~str#1.offset < 0 && 0 != (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) % 1 then 1 + (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) / 1 else (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) / 1); 877#L553 cstrstr_#t~ret15#1 := cstrlen_#res#1;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1; 909#L575-4 goto; 910#L576-2 cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post17#1.base, 1 + cstrstr_#t~post17#1.offset;call cstrstr_#t~mem18#1 := read~int(cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem18#1; 911#L577 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset;havoc cstrstr_#t~mem18#1; 895#L576 assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 878#L575-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem6#1, cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset, cstrncmp_#t~mem7#1, cstrncmp_#t~mem9#1, cstrncmp_#t~pre8#1.base, cstrncmp_#t~pre8#1.offset, cstrncmp_#t~mem10#1, cstrncmp_#t~post11#1.base, cstrncmp_#t~post11#1.offset, cstrncmp_#t~mem12#1, cstrncmp_#t~pre4#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; 879#L558 assume !(0 == cstrncmp_~n#1 % 18446744073709551616); 905#L560-4 [2022-07-22 01:40:26,561 INFO L754 eck$LassoCheckResult]: Loop: 905#L560-4 call cstrncmp_#t~mem6#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post5#1.base, 1 + cstrncmp_#t~post5#1.offset;call cstrncmp_#t~mem7#1 := read~int(cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset, 1); 884#L561 assume !(cstrncmp_#t~mem6#1 != cstrncmp_#t~mem7#1);havoc cstrncmp_#t~mem6#1;havoc cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset;havoc cstrncmp_#t~mem7#1;cstrncmp_#t~post11#1.base, cstrncmp_#t~post11#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post11#1.base, 1 + cstrncmp_#t~post11#1.offset;call cstrncmp_#t~mem12#1 := read~int(cstrncmp_#t~post11#1.base, cstrncmp_#t~post11#1.offset, 1); 885#L563 assume !(0 == cstrncmp_#t~mem12#1);havoc cstrncmp_#t~post11#1.base, cstrncmp_#t~post11#1.offset;havoc cstrncmp_#t~mem12#1; 891#L560-1 cstrncmp_#t~pre4#1 := cstrncmp_~n#1 - 1;cstrncmp_~n#1 := cstrncmp_~n#1 - 1; 892#L560-2 assume !!(0 != cstrncmp_#t~pre4#1 % 18446744073709551616);havoc cstrncmp_#t~pre4#1; 905#L560-4 [2022-07-22 01:40:26,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:26,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1478230621, now seen corresponding path program 2 times [2022-07-22 01:40:26,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:26,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703653167] [2022-07-22 01:40:26,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:26,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:26,578 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:26,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:26,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:26,594 INFO L85 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 2 times [2022-07-22 01:40:26,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:26,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187937128] [2022-07-22 01:40:26,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:26,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:26,600 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:26,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:26,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:26,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1703636079, now seen corresponding path program 2 times [2022-07-22 01:40:26,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:26,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492002904] [2022-07-22 01:40:26,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:26,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:26,627 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:26,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:28,511 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:40:28,511 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:40:28,511 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:40:28,511 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:40:28,511 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:40:28,511 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:28,511 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:40:28,511 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:40:28,511 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-1.i_Iteration6_Lasso [2022-07-22 01:40:28,511 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:40:28,511 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:40:28,515 INFO 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 01:40:28,517 INFO 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 01:40:28,518 INFO 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 01:40:28,520 INFO 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 01:40:28,522 INFO 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 01:40:28,523 INFO 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 01:40:29,948 INFO 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 01:40:29,959 INFO 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 01:40:29,961 INFO 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 01:40:29,965 INFO 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 01:40:29,967 INFO 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 01:40:29,969 INFO 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 01:40:29,970 INFO 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 01:40:29,971 INFO 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 01:40:29,973 INFO 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 01:40:29,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:40:29,977 INFO 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 01:40:29,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:40:29,980 INFO 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 01:40:29,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:40:29,983 INFO 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 01:40:29,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:40:29,986 INFO 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 01:40:29,988 INFO 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 01:40:29,989 INFO 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 01:40:29,992 INFO 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 01:40:29,994 INFO 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 01:40:29,995 INFO 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 01:40:29,996 INFO 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 01:40:29,998 INFO 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 01:40:29,999 INFO 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 01:40:30,002 INFO 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 01:40:30,005 INFO 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 01:40:30,007 INFO 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 01:40:30,008 INFO 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 01:40:30,009 INFO 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 01:40:30,011 INFO 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 01:40:30,012 INFO 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 01:40:30,013 INFO 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 01:40:30,015 INFO 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 01:40:30,016 INFO 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 01:40:31,015 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:40:31,015 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:40:31,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:31,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:31,024 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 01:40:31,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:31,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:31,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:31,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:31,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:31,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:31,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:31,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:31,042 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 01:40:31,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:31,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:31,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:31,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:31,077 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 01:40:31,079 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 01:40:31,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:31,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:31,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:31,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:31,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:31,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:31,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:31,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:31,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:31,108 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 01:40:31,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:31,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:31,109 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 01:40:31,111 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 01:40:31,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:31,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:31,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:31,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:31,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:31,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:31,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:31,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:31,122 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:31,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 01:40:31,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:31,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:31,139 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 01:40:31,140 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 01:40:31,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:31,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:31,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:31,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:31,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:31,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:31,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:31,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:31,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:31,164 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 01:40:31,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:31,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:31,166 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 01:40:31,166 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 01:40:31,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:31,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:31,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:31,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:31,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:31,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:31,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:31,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:31,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:31,195 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 01:40:31,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:31,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:31,196 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 01:40:31,197 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 01:40:31,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:31,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:31,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:31,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:31,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:31,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:31,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:31,273 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:40:31,336 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2022-07-22 01:40:31,336 INFO L444 ModelExtractionUtils]: 50 out of 82 variables were initially zero. Simplification set additionally 29 variables to zero. [2022-07-22 01:40:31,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:31,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:31,338 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 01:40:31,338 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 01:40:31,340 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:40:31,346 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:40:31,346 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:40:31,347 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s2#1.offset, v_rep(select #length ULTIMATE.start_cstrncmp_~s2#1.base)_1) = -1*ULTIMATE.start_cstrncmp_~s2#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrncmp_~s2#1.base)_1 Supporting invariants [] [2022-07-22 01:40:31,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:31,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:31,617 INFO L293 tatePredicateManager]: 62 out of 62 supporting invariants were superfluous and have been removed [2022-07-22 01:40:31,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:31,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:40:31,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:31,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 01:40:31,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:31,723 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 01:40:31,726 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 01:40:31,726 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 01:40:31,741 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 67 states and 76 transitions. Complement of second has 5 states. [2022-07-22 01:40:31,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 01:40:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 01:40:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-07-22 01:40:31,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 22 letters. Loop has 5 letters. [2022-07-22 01:40:31,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:31,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 27 letters. Loop has 5 letters. [2022-07-22 01:40:31,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:31,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 22 letters. Loop has 10 letters. [2022-07-22 01:40:31,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:31,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 76 transitions. [2022-07-22 01:40:31,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:40:31,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 50 states and 58 transitions. [2022-07-22 01:40:31,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-22 01:40:31,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-22 01:40:31,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2022-07-22 01:40:31,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:40:31,757 INFO L369 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-07-22 01:40:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2022-07-22 01:40:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-07-22 01:40:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 41 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 01:40:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-07-22 01:40:31,760 INFO L392 hiAutomatonCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-07-22 01:40:31,760 INFO L374 stractBuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-07-22 01:40:31,760 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 01:40:31,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 49 transitions. [2022-07-22 01:40:31,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-22 01:40:31,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:40:31,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:40:31,762 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:40:31,762 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 01:40:31,762 INFO L752 eck$LassoCheckResult]: Stem: 1343#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1344#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet20#1, main_#t~nondet21#1, main_#t~malloc22#1.base, main_#t~malloc22#1.offset, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~ret24#1.base, main_#t~ret24#1.offset, 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~nondet20#1;havoc main_#t~nondet20#1;main_~length2~0#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1; 1354#L588 assume !(main_~length1~0#1 < 1); 1355#L588-2 assume !(main_~length2~0#1 < 1); 1362#L591-1 call main_#t~malloc22#1.base, main_#t~malloc22#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc22#1.base, main_#t~malloc22#1.offset;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;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_cstrstr } true;cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset, cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrstr_#res#1.base, cstrstr_#res#1.offset;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, cstrstr_#t~mem14#1, cstrstr_#t~ret15#1, cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, cstrstr_#t~mem18#1, cstrstr_#t~ret16#1, cstrstr_#t~post19#1.base, cstrstr_#t~post19#1.offset, cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~c~0#1, cstrstr_~sc~0#1, cstrstr_~len~0#1;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#in~s#1.base, cstrstr_#in~s#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#in~find#1.base, cstrstr_#in~find#1.offset;havoc cstrstr_~c~0#1;havoc cstrstr_~sc~0#1;havoc cstrstr_~len~0#1;cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;cstrstr_~find#1.base, cstrstr_~find#1.offset := cstrstr_#t~post13#1.base, 1 + cstrstr_#t~post13#1.offset;call cstrstr_#t~mem14#1 := read~int(cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset, 1);cstrstr_~c~0#1 := cstrstr_#t~mem14#1; 1349#L573 assume 0 != cstrstr_~c~0#1;havoc cstrstr_#t~post13#1.base, cstrstr_#t~post13#1.offset;havoc cstrstr_#t~mem14#1;assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := cstrstr_~find#1.base, cstrstr_~find#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset, cstrlen_#t~mem3#1, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 1350#L551-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 1357#L551-1 assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 1358#L551-3 cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 1359#L551-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 1370#L551-1 assume !!(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 1373#L551-3 cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre2#1.base, cstrlen_#t~pre2#1.offset; 1372#L551-4 call cstrlen_#t~mem3#1 := read~int(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 1356#L551-1 assume !(0 != cstrlen_#t~mem3#1);havoc cstrlen_#t~mem3#1; 1332#L551-5 assume cstrlen_~s~0#1.base == cstrlen_~str#1.base;cstrlen_#res#1 := (if cstrlen_~s~0#1.offset - cstrlen_~str#1.offset < 0 && 0 != (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) % 1 then 1 + (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) / 1 else (cstrlen_~s~0#1.offset - cstrlen_~str#1.offset) / 1); 1333#L553 cstrstr_#t~ret15#1 := cstrlen_#res#1;assume { :end_inline_cstrlen } true;cstrstr_~len~0#1 := cstrstr_#t~ret15#1;havoc cstrstr_#t~ret15#1; 1364#L575-4 goto; 1365#L576-2 cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post17#1.base, 1 + cstrstr_#t~post17#1.offset;call cstrstr_#t~mem18#1 := read~int(cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem18#1; 1366#L577 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset;havoc cstrstr_#t~mem18#1; 1369#L576 assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 1336#L575-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem6#1, cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset, cstrncmp_#t~mem7#1, cstrncmp_#t~mem9#1, cstrncmp_#t~pre8#1.base, cstrncmp_#t~pre8#1.offset, cstrncmp_#t~mem10#1, cstrncmp_#t~post11#1.base, cstrncmp_#t~post11#1.offset, cstrncmp_#t~mem12#1, cstrncmp_#t~pre4#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; 1337#L558 assume !(0 == cstrncmp_~n#1 % 18446744073709551616); 1361#L560-4 call cstrncmp_#t~mem6#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post5#1.base, 1 + cstrncmp_#t~post5#1.offset;call cstrncmp_#t~mem7#1 := read~int(cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset, 1); 1340#L561 assume cstrncmp_#t~mem6#1 != cstrncmp_#t~mem7#1;havoc cstrncmp_#t~mem6#1;havoc cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset;havoc cstrncmp_#t~mem7#1;call cstrncmp_#t~mem9#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~pre8#1.base, cstrncmp_#t~pre8#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset - 1;call cstrncmp_#t~mem10#1 := read~int(cstrncmp_#t~pre8#1.base, cstrncmp_#t~pre8#1.offset, 1);cstrncmp_#res#1 := cstrncmp_#t~mem9#1 % 256 - cstrncmp_#t~mem10#1 % 256;havoc cstrncmp_#t~mem9#1;havoc cstrncmp_#t~pre8#1.base, cstrncmp_#t~pre8#1.offset;havoc cstrncmp_#t~mem10#1; 1341#L566 cstrstr_#t~ret16#1 := cstrncmp_#res#1;assume { :end_inline_cstrncmp } true; 1363#L575-2 assume !!(0 != cstrstr_#t~ret16#1);havoc cstrstr_#t~ret16#1; 1368#L575-4 goto; 1353#L576-2 cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset := cstrstr_~s#1.base, cstrstr_~s#1.offset;cstrstr_~s#1.base, cstrstr_~s#1.offset := cstrstr_#t~post17#1.base, 1 + cstrstr_#t~post17#1.offset;call cstrstr_#t~mem18#1 := read~int(cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset, 1);cstrstr_~sc~0#1 := cstrstr_#t~mem18#1; 1371#L577 assume !(0 == cstrstr_~sc~0#1);havoc cstrstr_#t~post17#1.base, cstrstr_#t~post17#1.offset;havoc cstrstr_#t~mem18#1; 1351#L576 assume !(cstrstr_~sc~0#1 != cstrstr_~c~0#1); 1334#L575-1 assume { :begin_inline_cstrncmp } true;cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset, cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset, cstrncmp_#in~n#1 := cstrstr_~s#1.base, cstrstr_~s#1.offset, cstrstr_~find#1.base, cstrstr_~find#1.offset, cstrstr_~len~0#1;havoc cstrncmp_#res#1;havoc cstrncmp_#t~mem6#1, cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset, cstrncmp_#t~mem7#1, cstrncmp_#t~mem9#1, cstrncmp_#t~pre8#1.base, cstrncmp_#t~pre8#1.offset, cstrncmp_#t~mem10#1, cstrncmp_#t~post11#1.base, cstrncmp_#t~post11#1.offset, cstrncmp_#t~mem12#1, cstrncmp_#t~pre4#1, cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset, cstrncmp_~n#1;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#in~s1#1.base, cstrncmp_#in~s1#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#in~s2#1.base, cstrncmp_#in~s2#1.offset;cstrncmp_~n#1 := cstrncmp_#in~n#1; 1335#L558 assume !(0 == cstrncmp_~n#1 % 18446744073709551616); 1360#L560-4 [2022-07-22 01:40:31,762 INFO L754 eck$LassoCheckResult]: Loop: 1360#L560-4 call cstrncmp_#t~mem6#1 := read~int(cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset, 1);cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset := cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset;cstrncmp_~s2#1.base, cstrncmp_~s2#1.offset := cstrncmp_#t~post5#1.base, 1 + cstrncmp_#t~post5#1.offset;call cstrncmp_#t~mem7#1 := read~int(cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset, 1); 1338#L561 assume !(cstrncmp_#t~mem6#1 != cstrncmp_#t~mem7#1);havoc cstrncmp_#t~mem6#1;havoc cstrncmp_#t~post5#1.base, cstrncmp_#t~post5#1.offset;havoc cstrncmp_#t~mem7#1;cstrncmp_#t~post11#1.base, cstrncmp_#t~post11#1.offset := cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset;cstrncmp_~s1#1.base, cstrncmp_~s1#1.offset := cstrncmp_#t~post11#1.base, 1 + cstrncmp_#t~post11#1.offset;call cstrncmp_#t~mem12#1 := read~int(cstrncmp_#t~post11#1.base, cstrncmp_#t~post11#1.offset, 1); 1339#L563 assume !(0 == cstrncmp_#t~mem12#1);havoc cstrncmp_#t~post11#1.base, cstrncmp_#t~post11#1.offset;havoc cstrncmp_#t~mem12#1; 1345#L560-1 cstrncmp_#t~pre4#1 := cstrncmp_~n#1 - 1;cstrncmp_~n#1 := cstrncmp_~n#1 - 1; 1346#L560-2 assume !!(0 != cstrncmp_#t~pre4#1 % 18446744073709551616);havoc cstrncmp_#t~pre4#1; 1360#L560-4 [2022-07-22 01:40:31,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:31,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2051218895, now seen corresponding path program 1 times [2022-07-22 01:40:31,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:31,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708878991] [2022-07-22 01:40:31,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:31,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:31,801 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:31,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:31,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:31,830 INFO L85 PathProgramCache]: Analyzing trace with hash 91772235, now seen corresponding path program 3 times [2022-07-22 01:40:31,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:31,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462849183] [2022-07-22 01:40:31,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:31,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:31,857 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:31,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:31,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:31,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1369353957, now seen corresponding path program 1 times [2022-07-22 01:40:31,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:40:31,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204782302] [2022-07-22 01:40:31,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:40:31,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:40:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:31,922 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:40:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:40:31,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:40:34,340 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:40:34,340 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:40:34,340 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:40:34,340 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:40:34,340 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:40:34,340 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:34,340 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:40:34,340 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:40:34,340 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-1.i_Iteration7_Lasso [2022-07-22 01:40:34,340 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:40:34,340 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:40:34,345 INFO 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 01:40:34,346 INFO 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 01:40:34,348 INFO 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 01:40:34,350 INFO 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 01:40:34,351 INFO 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 01:40:34,353 INFO 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 01:40:34,354 INFO 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 01:40:34,356 INFO 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 01:40:34,358 INFO 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 01:40:34,360 INFO 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 01:40:34,362 INFO 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 01:40:34,363 INFO 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 01:40:34,365 INFO 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 01:40:34,367 INFO 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 01:40:34,368 INFO 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 01:40:34,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 01:40:34,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 01:40:34,374 INFO 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 01:40:35,670 INFO 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 01:40:35,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 01:40:35,674 INFO 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 01:40:35,676 INFO 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 01:40:35,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 01:40:35,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 01:40:35,680 INFO 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 01:40:35,682 INFO 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 01:40:35,683 INFO 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 01:40:35,685 INFO 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 01:40:35,686 INFO 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 01:40:35,687 INFO 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 01:40:35,689 INFO 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 01:40:35,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:40:35,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:40:35,701 INFO 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 01:40:35,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:40:35,704 INFO 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 01:40:35,705 INFO 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 01:40:35,707 INFO 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 01:40:35,708 INFO 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 01:40:36,906 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:40:36,907 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:40:36,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,909 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 01:40:36,909 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 01:40:36,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:36,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:36,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:36,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:36,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:36,935 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 01:40:36,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,937 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 01:40:36,938 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 01:40:36,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:36,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:36,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:36,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:36,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:36,962 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 01:40:36,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,964 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 01:40:36,965 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 01:40:36,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:36,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:36,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:36,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:36,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:36,989 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 01:40:36,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:36,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:36,990 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 01:40:36,991 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 01:40:36,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:36,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:36,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:36,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:36,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:36,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:36,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:36,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:37,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,018 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 01:40:37,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,019 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 01:40:37,020 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 01:40:37,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:37,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:37,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:37,029 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,044 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 01:40:37,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,046 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 01:40:37,047 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 01:40:37,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:37,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:37,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:37,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:37,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,073 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 01:40:37,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,079 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 01:40:37,081 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 01:40:37,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:37,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:37,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:37,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,105 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 01:40:37,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,107 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 01:40:37,107 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 01:40:37,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:37,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:37,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-22 01:40:37,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,134 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 01:40:37,135 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 01:40:37,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:37,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:37,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:37,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-22 01:40:37,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,161 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:37,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 01:40:37,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:37,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:37,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:37,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:37,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-22 01:40:37,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,249 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:37,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:37,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 01:40:37,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:37,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:37,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:37,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-22 01:40:37,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,280 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 01:40:37,281 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 01:40:37,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:37,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:37,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:37,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,320 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 01:40:37,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,322 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 01:40:37,323 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 01:40:37,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:37,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:37,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:37,332 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-22 01:40:37,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,349 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 01:40:37,349 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 01:40:37,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:37,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:37,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:37,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,375 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 01:40:37,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,377 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 01:40:37,379 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 01:40:37,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:37,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:37,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:37,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,402 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 01:40:37,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,404 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 01:40:37,411 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 01:40:37,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:37,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:37,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:37,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-22 01:40:37,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,437 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 01:40:37,438 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 01:40:37,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:40:37,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:40:37,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:40:37,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-22 01:40:37,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,469 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 01:40:37,469 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 01:40:37,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:37,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:37,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-22 01:40:37,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,496 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 01:40:37,498 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 01:40:37,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:37,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:37,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,569 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 01:40:37,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,570 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 01:40:37,572 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 01:40:37,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,579 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-22 01:40:37,579 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 01:40:37,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,601 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2022-07-22 01:40:37,601 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-22 01:40:37,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,663 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 01:40:37,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,665 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 01:40:37,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:37,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:37,679 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 01:40:37,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,714 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 01:40:37,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,715 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:37,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:37,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:37,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-22 01:40:37,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:37,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,767 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:37,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-22 01:40:37,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:37,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:37,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:37,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,819 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:37,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:37,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:37,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-22 01:40:37,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:37,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,882 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:37,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:37,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:37,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:37,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-22 01:40:37,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:37,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,937 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:37,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-22 01:40:37,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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 01:40:37,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:37,947 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 01:40:37,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:37,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:37,949 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 01:40:37,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:37,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:40:37,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:37,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:37,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:37,988 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:37,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:40:38,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:40:38,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:40:38,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:40:38,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:40:38,015 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:40:38,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:40:38,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-22 01:40:38,052 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:40:38,071 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-22 01:40:38,072 INFO L444 ModelExtractionUtils]: 65 out of 73 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-07-22 01:40:38,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:40:38,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:40:38,073 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:40:38,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-22 01:40:38,075 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:40:38,081 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:40:38,081 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:40:38,081 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s2#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23#1.base)_4) = -1*ULTIMATE.start_cstrncmp_~s2#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23#1.base)_4 Supporting invariants [] [2022-07-22 01:40:38,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-22 01:40:38,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-07-22 01:40:38,313 INFO L293 tatePredicateManager]: 62 out of 63 supporting invariants were superfluous and have been removed [2022-07-22 01:40:38,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:38,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 01:40:38,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:38,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 01:40:38,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:38,490 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 01:40:38,490 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 01:40:38,491 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 01:40:38,529 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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) Result 54 states and 62 transitions. Complement of second has 7 states. [2022-07-22 01:40:38,531 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 01:40:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 01:40:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-07-22 01:40:38,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 32 letters. Loop has 5 letters. [2022-07-22 01:40:38,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:38,532 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 01:40:38,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:38,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 01:40:38,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:38,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 01:40:38,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:38,697 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 01:40:38,698 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 01:40:38,698 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 01:40:38,749 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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) Result 71 states and 82 transitions. Complement of second has 9 states. [2022-07-22 01:40:38,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 01:40:38,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 01:40:38,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-07-22 01:40:38,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 32 letters. Loop has 5 letters. [2022-07-22 01:40:38,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:38,751 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 01:40:38,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:40:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:38,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 01:40:38,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:40:38,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 01:40:38,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:40:38,950 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 01:40:38,950 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 01:40:38,950 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 01:40:39,005 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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) Result 53 states and 60 transitions. Complement of second has 6 states. [2022-07-22 01:40:39,005 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 01:40:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 01:40:39,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-07-22 01:40:39,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 32 letters. Loop has 5 letters. [2022-07-22 01:40:39,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:39,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 37 letters. Loop has 5 letters. [2022-07-22 01:40:39,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:39,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 32 letters. Loop has 10 letters. [2022-07-22 01:40:39,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:40:39,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 60 transitions. [2022-07-22 01:40:39,008 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 01:40:39,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 0 states and 0 transitions. [2022-07-22 01:40:39,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 01:40:39,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 01:40:39,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 01:40:39,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:40:39,009 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:40:39,009 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:40:39,009 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:40:39,009 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 01:40:39,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-22 01:40:39,009 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 01:40:39,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-22 01:40:39,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 01:40:39 BoogieIcfgContainer [2022-07-22 01:40:39,015 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 01:40:39,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 01:40:39,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 01:40:39,015 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 01:40:39,016 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:40:18" (3/4) ... [2022-07-22 01:40:39,018 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 01:40:39,018 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 01:40:39,019 INFO L158 Benchmark]: Toolchain (without parser) took 21571.96ms. Allocated memory was 60.8MB in the beginning and 146.8MB in the end (delta: 86.0MB). Free memory was 39.9MB in the beginning and 40.4MB in the end (delta: -499.3kB). Peak memory consumption was 84.8MB. Max. memory is 16.1GB. [2022-07-22 01:40:39,019 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 60.8MB. Free memory was 42.7MB in the beginning and 42.7MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:40:39,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.34ms. Allocated memory is still 60.8MB. Free memory was 39.8MB in the beginning and 38.1MB in the end (delta: 1.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 01:40:39,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.30ms. Allocated memory is still 60.8MB. Free memory was 37.9MB in the beginning and 35.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 01:40:39,020 INFO L158 Benchmark]: Boogie Preprocessor took 27.26ms. Allocated memory is still 60.8MB. Free memory was 35.8MB in the beginning and 34.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 01:40:39,020 INFO L158 Benchmark]: RCFGBuilder took 405.51ms. Allocated memory was 60.8MB in the beginning and 83.9MB in the end (delta: 23.1MB). Free memory was 34.1MB in the beginning and 60.5MB in the end (delta: -26.4MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2022-07-22 01:40:39,020 INFO L158 Benchmark]: BuchiAutomizer took 20614.34ms. Allocated memory was 83.9MB in the beginning and 146.8MB in the end (delta: 62.9MB). Free memory was 60.2MB in the beginning and 40.4MB in the end (delta: 19.7MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. [2022-07-22 01:40:39,021 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 146.8MB. Free memory is still 40.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:40:39,022 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 60.8MB. Free memory was 42.7MB in the beginning and 42.7MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.34ms. Allocated memory is still 60.8MB. Free memory was 39.8MB in the beginning and 38.1MB in the end (delta: 1.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.30ms. Allocated memory is still 60.8MB. Free memory was 37.9MB in the beginning and 35.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.26ms. Allocated memory is still 60.8MB. Free memory was 35.8MB in the beginning and 34.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 405.51ms. Allocated memory was 60.8MB in the beginning and 83.9MB in the end (delta: 23.1MB). Free memory was 34.1MB in the beginning and 60.5MB in the end (delta: -26.4MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 20614.34ms. Allocated memory was 83.9MB in the beginning and 146.8MB in the end (delta: 62.9MB). Free memory was 60.2MB in the beginning and 40.4MB in the end (delta: 19.7MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 146.8MB. Free memory is still 40.4MB. 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 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * s2 and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s2 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.5s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 18.8s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 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 [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 386 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385 mSDsluCounter, 721 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 471 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 184 IncrementalHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 250 mSDtfsCounter, 184 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital283 mio100 ax106 hnf100 lsp91 ukn88 mio100 lsp38 div113 bol100 ite100 ukn100 eq197 hnf89 smp92 dnf142 smp86 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 85ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 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 01:40:39,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-07-22 01:40:39,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE