./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/cstrcspn.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/cstrcspn.c -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 475c55af8223c9a32959cab18313111543780f4e37aae19089bc5e981127ec42 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 14:48:52,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 14:48:52,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 14:48:52,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 14:48:52,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 14:48:52,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 14:48:52,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 14:48:52,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 14:48:52,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 14:48:52,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 14:48:52,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 14:48:52,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 14:48:52,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 14:48:52,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 14:48:52,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 14:48:52,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 14:48:52,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 14:48:52,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 14:48:52,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 14:48:52,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 14:48:52,487 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 14:48:52,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 14:48:52,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 14:48:52,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 14:48:52,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 14:48:52,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 14:48:52,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 14:48:52,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 14:48:52,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 14:48:52,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 14:48:52,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 14:48:52,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 14:48:52,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 14:48:52,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 14:48:52,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 14:48:52,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 14:48:52,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 14:48:52,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 14:48:52,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 14:48:52,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 14:48:52,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 14:48:52,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 14:48:52,503 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 14:48:52,526 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 14:48:52,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 14:48:52,527 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 14:48:52,527 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 14:48:52,528 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 14:48:52,528 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 14:48:52,528 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 14:48:52,529 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 14:48:52,529 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 14:48:52,529 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 14:48:52,529 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 14:48:52,529 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 14:48:52,529 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 14:48:52,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 14:48:52,530 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 14:48:52,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 14:48:52,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 14:48:52,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 14:48:52,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 14:48:52,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 14:48:52,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 14:48:52,531 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 14:48:52,531 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 14:48:52,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 14:48:52,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 14:48:52,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 14:48:52,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 14:48:52,533 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 14:48:52,533 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 14:48:52,534 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 -> 475c55af8223c9a32959cab18313111543780f4e37aae19089bc5e981127ec42 [2022-07-14 14:48:52,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 14:48:52,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 14:48:52,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 14:48:52,819 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 14:48:52,820 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 14:48:52,821 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/cstrcspn.c [2022-07-14 14:48:52,893 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e829ec7ac/379e19c3926b471ba7352d87af0904cf/FLAGeb7859c57 [2022-07-14 14:48:53,272 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 14:48:53,273 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/cstrcspn.c [2022-07-14 14:48:53,279 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e829ec7ac/379e19c3926b471ba7352d87af0904cf/FLAGeb7859c57 [2022-07-14 14:48:53,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e829ec7ac/379e19c3926b471ba7352d87af0904cf [2022-07-14 14:48:53,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 14:48:53,301 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 14:48:53,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 14:48:53,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 14:48:53,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 14:48:53,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:48:53" (1/1) ... [2022-07-14 14:48:53,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a0b6fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:48:53, skipping insertion in model container [2022-07-14 14:48:53,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:48:53" (1/1) ... [2022-07-14 14:48:53,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 14:48:53,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 14:48:53,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:48:53,485 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 14:48:53,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:48:53,508 INFO L208 MainTranslator]: Completed translation [2022-07-14 14:48:53,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:48:53 WrapperNode [2022-07-14 14:48:53,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 14:48:53,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 14:48:53,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 14:48:53,510 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 14:48:53,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:48:53" (1/1) ... [2022-07-14 14:48:53,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:48:53" (1/1) ... [2022-07-14 14:48:53,541 INFO L137 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 81 [2022-07-14 14:48:53,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 14:48:53,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 14:48:53,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 14:48:53,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 14:48:53,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:48:53" (1/1) ... [2022-07-14 14:48:53,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:48:53" (1/1) ... [2022-07-14 14:48:53,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:48:53" (1/1) ... [2022-07-14 14:48:53,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:48:53" (1/1) ... [2022-07-14 14:48:53,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:48:53" (1/1) ... [2022-07-14 14:48:53,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:48:53" (1/1) ... [2022-07-14 14:48:53,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:48:53" (1/1) ... [2022-07-14 14:48:53,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 14:48:53,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 14:48:53,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 14:48:53,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 14:48:53,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:48:53" (1/1) ... [2022-07-14 14:48:53,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:53,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:53,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:53,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-14 14:48:53,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 14:48:53,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 14:48:53,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 14:48:53,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 14:48:53,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 14:48:53,713 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 14:48:53,714 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 14:48:53,852 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 14:48:53,857 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 14:48:53,857 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 14:48:53,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:48:53 BoogieIcfgContainer [2022-07-14 14:48:53,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 14:48:53,859 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 14:48:53,859 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 14:48:53,862 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 14:48:53,864 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:48:53,865 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 02:48:53" (1/3) ... [2022-07-14 14:48:53,866 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@98fa605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:48:53, skipping insertion in model container [2022-07-14 14:48:53,867 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:48:53,868 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:48:53" (2/3) ... [2022-07-14 14:48:53,868 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@98fa605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:48:53, skipping insertion in model container [2022-07-14 14:48:53,868 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:48:53,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:48:53" (3/3) ... [2022-07-14 14:48:53,870 INFO L354 chiAutomizerObserver]: Analyzing ICFG cstrcspn.c [2022-07-14 14:48:53,917 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 14:48:53,918 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 14:48:53,918 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 14:48:53,918 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 14:48:53,918 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 14:48:53,918 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 14:48:53,918 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 14:48:53,919 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 14:48:53,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:48:53,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 14:48:53,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:48:53,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:48:53,941 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:48:53,942 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:48:53,942 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 14:48:53,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:48:53,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 14:48:53,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:48:53,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:48:53,945 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:48:53,945 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:48:53,951 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 8#L14true assume !(build_nondet_String_~length~0#1 < 1); 18#L14-2true call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 16#L19true main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 10#L14-3true assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; 14#L14-5true call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 6#L19-1true main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 19#L30-4true [2022-07-14 14:48:53,951 INFO L754 eck$LassoCheckResult]: Loop: 19#L30-4true call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 11#L30-1true assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 13#L33-5true assume !true; 12#L33-6true call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 21#L35true assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 20#L30-3true cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 19#L30-4true [2022-07-14 14:48:53,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:48:53,956 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2022-07-14 14:48:53,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:48:53,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912199734] [2022-07-14 14:48:53,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:48:53,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:48:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:54,096 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:48:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:54,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:48:54,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:48:54,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2022-07-14 14:48:54,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:48:54,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185454887] [2022-07-14 14:48:54,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:48:54,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:48:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:48:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:48:54,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:48:54,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185454887] [2022-07-14 14:48:54,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185454887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:48:54,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:48:54,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:48:54,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642348414] [2022-07-14 14:48:54,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:48:54,186 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:48:54,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:48:54,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 14:48:54,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 14:48:54,217 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:48:54,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:48:54,222 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-07-14 14:48:54,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 14:48:54,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2022-07-14 14:48:54,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 14:48:54,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2022-07-14 14:48:54,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-14 14:48:54,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-14 14:48:54,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2022-07-14 14:48:54,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:48:54,233 INFO L369 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-07-14 14:48:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2022-07-14 14:48:54,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-14 14:48:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:48:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-07-14 14:48:54,262 INFO L392 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-07-14 14:48:54,262 INFO L374 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-07-14 14:48:54,263 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 14:48:54,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2022-07-14 14:48:54,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 14:48:54,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:48:54,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:48:54,264 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:48:54,265 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:48:54,265 INFO L752 eck$LassoCheckResult]: Stem: 50#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 51#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 56#L14 assume !(build_nondet_String_~length~0#1 < 1); 57#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 64#L19 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 58#L14-3 assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; 59#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 54#L19-1 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 55#L30-4 [2022-07-14 14:48:54,265 INFO L754 eck$LassoCheckResult]: Loop: 55#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 60#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 61#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 52#L33-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 53#L33-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 62#L33-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 63#L35 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 65#L30-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 55#L30-4 [2022-07-14 14:48:54,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:48:54,266 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2022-07-14 14:48:54,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:48:54,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261365397] [2022-07-14 14:48:54,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:48:54,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:48:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:54,289 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:48:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:54,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:48:54,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:48:54,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2022-07-14 14:48:54,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:48:54,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216583071] [2022-07-14 14:48:54,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:48:54,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:48:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:54,326 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:48:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:54,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:48:54,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:48:54,339 INFO L85 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2022-07-14 14:48:54,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:48:54,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290902470] [2022-07-14 14:48:54,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:48:54,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:48:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:48:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:48:54,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:48:54,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290902470] [2022-07-14 14:48:54,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290902470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:48:54,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:48:54,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 14:48:54,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801112977] [2022-07-14 14:48:54,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:48:54,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:48:54,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 14:48:54,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 14:48:54,867 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:48:54,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:48:54,988 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-07-14 14:48:54,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 14:48:54,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2022-07-14 14:48:54,990 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-14 14:48:54,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2022-07-14 14:48:54,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-07-14 14:48:54,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-07-14 14:48:54,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2022-07-14 14:48:54,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:48:54,992 INFO L369 hiAutomatonCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-07-14 14:48:54,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2022-07-14 14:48:54,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-07-14 14:48:54,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:48:54,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-14 14:48:54,994 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-14 14:48:54,994 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-14 14:48:54,995 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 14:48:54,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2022-07-14 14:48:54,995 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2022-07-14 14:48:54,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:48:54,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:48:54,996 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:48:54,996 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:48:54,996 INFO L752 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 124#L14 assume !(build_nondet_String_~length~0#1 < 1); 125#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 135#L19 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 126#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 127#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 142#L19-1 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 141#L30-4 [2022-07-14 14:48:54,996 INFO L754 eck$LassoCheckResult]: Loop: 141#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 140#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 133#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 134#L33-1 assume !cstrcspn_#t~short7#1; 136#L33-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 137#L33-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 144#L35 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 143#L30-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 141#L30-4 [2022-07-14 14:48:54,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:48:54,997 INFO L85 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2022-07-14 14:48:54,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:48:54,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606825373] [2022-07-14 14:48:54,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:48:54,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:48:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:55,011 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:48:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:55,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:48:55,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:48:55,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1951138125, now seen corresponding path program 1 times [2022-07-14 14:48:55,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:48:55,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509585182] [2022-07-14 14:48:55,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:48:55,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:48:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:55,030 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:48:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:55,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:48:55,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:48:55,065 INFO L85 PathProgramCache]: Analyzing trace with hash -252975234, now seen corresponding path program 1 times [2022-07-14 14:48:55,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:48:55,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271820723] [2022-07-14 14:48:55,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:48:55,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:48:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:55,093 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:48:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:55,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:48:55,731 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:48:55,731 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:48:55,732 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:48:55,732 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:48:55,732 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:48:55,732 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:55,732 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:48:55,732 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:48:55,732 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn.c_Iteration3_Lasso [2022-07-14 14:48:55,733 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:48:55,733 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:48:55,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:55,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:55,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:55,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:55,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:55,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:55,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:55,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:55,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:55,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:55,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:55,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:55,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:55,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:56,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:56,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:56,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:56,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:56,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:56,671 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:48:56,675 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:48:56,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:56,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:56,677 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:56,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-14 14:48:56,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:56,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:56,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:48:56,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:56,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:56,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:56,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:48:56,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:48:56,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:56,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-14 14:48:56,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:56,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:56,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:56,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-14 14:48:56,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:56,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:56,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:56,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:56,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:56,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:48:56,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:48:56,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:56,772 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-14 14:48:56,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:56,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:56,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:56,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-14 14:48:56,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:56,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:56,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:48:56,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:56,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:56,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:56,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:48:56,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:48:56,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:56,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-14 14:48:56,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:56,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:56,805 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:56,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-14 14:48:56,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:56,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:56,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:48:56,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:56,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:56,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:56,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:48:56,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:48:56,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:56,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 14:48:56,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:56,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:56,833 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:56,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-14 14:48:56,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:56,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:56,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:48:56,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:56,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:56,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:56,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:48:56,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:48:56,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:56,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-14 14:48:56,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:56,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:56,868 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:56,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-14 14:48:56,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:56,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:56,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:48:56,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:56,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:56,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:56,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:48:56,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:48:56,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:56,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-14 14:48:56,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:56,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:56,895 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-14 14:48:56,896 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-14 14:48:56,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:56,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:56,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:48:56,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:56,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:56,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:56,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:48:56,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:48:56,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:56,920 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-14 14:48:56,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:56,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:56,922 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-14 14:48:56,922 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-14 14:48:56,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:56,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:56,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:48:56,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:56,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:56,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:56,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:48:56,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:48:56,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:56,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-14 14:48:56,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:56,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:56,957 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:56,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-14 14:48:56,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:56,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:56,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:56,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:56,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:56,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:48:56,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:48:56,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:57,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-14 14:48:57,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:57,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:57,016 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:57,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:57,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:57,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:48:57,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:57,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:57,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:57,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:48:57,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:48:57,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-14 14:48:57,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:57,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-07-14 14:48:57,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:57,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:57,065 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:57,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-14 14:48:57,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:57,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:57,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:48:57,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:57,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:57,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:57,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:48:57,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:48:57,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:57,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-14 14:48:57,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:57,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:57,095 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:57,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-14 14:48:57,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:57,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:57,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:48:57,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:57,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:57,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:57,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:48:57,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:48:57,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:57,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-14 14:48:57,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:57,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:57,127 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:57,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-14 14:48:57,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:57,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:57,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:48:57,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:57,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:57,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:57,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:48:57,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:48:57,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:57,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-14 14:48:57,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:57,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:57,157 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:57,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-14 14:48:57,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:57,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:57,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:57,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:57,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:57,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:48:57,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:48:57,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:57,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-14 14:48:57,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:57,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:57,188 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:57,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-14 14:48:57,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:57,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:57,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:57,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:57,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:57,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:48:57,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:48:57,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:57,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-14 14:48:57,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:57,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:57,254 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:57,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-14 14:48:57,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:57,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:57,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:57,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:57,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:57,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:48:57,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:48:57,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:57,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-14 14:48:57,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:57,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:57,309 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:57,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:57,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-14 14:48:57,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:57,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:48:57,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:57,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:57,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:57,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:48:57,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:48:57,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:57,343 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-14 14:48:57,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:57,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:57,344 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:57,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-14 14:48:57,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:57,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:57,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:48:57,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:57,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:57,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:57,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:48:57,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:48:57,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:57,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-14 14:48:57,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:57,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:57,375 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:57,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-14 14:48:57,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:57,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:57,391 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-14 14:48:57,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:57,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:57,412 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-14 14:48:57,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:48:57,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:57,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-14 14:48:57,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:57,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:57,457 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:57,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-14 14:48:57,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:57,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:57,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:48:57,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:57,491 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 14:48:57,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:57,492 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 14:48:57,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:48:57,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:48:57,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-14 14:48:57,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:57,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:57,529 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:57,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-14 14:48:57,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:48:57,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:48:57,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:48:57,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:48:57,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:48:57,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:48:57,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:48:57,580 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:48:57,617 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-14 14:48:57,617 INFO L444 ModelExtractionUtils]: 5 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-07-14 14:48:57,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:57,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:48:57,636 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:48:57,692 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:48:57,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-14 14:48:57,716 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 14:48:57,717 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:48:57,717 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~ret10#1.base)_1, ULTIMATE.start_cstrcspn_~sc1~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~ret10#1.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0#1.offset Supporting invariants [] [2022-07-14 14:48:57,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-14 14:48:57,758 INFO L293 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2022-07-14 14:48:57,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:48:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:48:57,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 14:48:57,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:48:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:48:57,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 14:48:57,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:48:57,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:48:57,906 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 14:48:57,907 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:48:57,961 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 52 transitions. Complement of second has 4 states. [2022-07-14 14:48:57,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-14 14:48:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:48:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-07-14 14:48:57,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2022-07-14 14:48:57,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:48:57,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2022-07-14 14:48:57,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:48:57,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2022-07-14 14:48:57,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:48:57,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2022-07-14 14:48:57,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:48:57,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. [2022-07-14 14:48:57,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-07-14 14:48:57,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-14 14:48:57,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2022-07-14 14:48:57,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:48:57,969 INFO L369 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-07-14 14:48:57,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2022-07-14 14:48:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-14 14:48:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:48:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-07-14 14:48:57,971 INFO L392 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-07-14 14:48:57,971 INFO L374 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-07-14 14:48:57,972 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 14:48:57,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2022-07-14 14:48:57,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:48:57,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:48:57,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:48:57,973 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:48:57,973 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:48:57,973 INFO L752 eck$LassoCheckResult]: Stem: 286#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 287#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 295#L14 assume !(build_nondet_String_~length~0#1 < 1); 296#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 305#L19 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 297#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 298#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 293#L19-1 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 294#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 299#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 300#L33-5 [2022-07-14 14:48:57,973 INFO L754 eck$LassoCheckResult]: Loop: 300#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 288#L33-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 289#L33-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 300#L33-5 [2022-07-14 14:48:57,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:48:57,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2022-07-14 14:48:57,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:48:57,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833473679] [2022-07-14 14:48:57,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:48:57,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:48:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:57,992 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:48:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:58,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:48:58,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:48:58,006 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2022-07-14 14:48:58,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:48:58,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491566774] [2022-07-14 14:48:58,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:48:58,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:48:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:58,012 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:48:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:58,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:48:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:48:58,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2022-07-14 14:48:58,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:48:58,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463680356] [2022-07-14 14:48:58,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:48:58,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:48:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:58,043 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:48:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:48:58,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:48:58,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-14 14:48:58,750 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:48:58,750 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:48:58,750 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:48:58,750 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:48:58,750 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:48:58,750 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:48:58,750 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:48:58,750 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:48:58,750 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn.c_Iteration4_Lasso [2022-07-14 14:48:58,750 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:48:58,750 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:48:58,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:58,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:58,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:58,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:58,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:58,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:58,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:58,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:58,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:58,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:59,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:59,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:59,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:59,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:59,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:59,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:59,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:59,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:48:59,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:00,012 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:49:00,012 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:49:00,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:00,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:00,016 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:00,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:00,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:00,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:00,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:00,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:00,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:00,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:00,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-14 14:49:00,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:00,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-14 14:49:00,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:00,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:00,054 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:00,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-14 14:49:00,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:00,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:00,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:00,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:00,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:00,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:00,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:00,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:00,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:00,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-14 14:49:00,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:00,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:00,084 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:00,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-14 14:49:00,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:00,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:00,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:00,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:00,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:00,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:00,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:00,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:00,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:00,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-14 14:49:00,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:00,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:00,110 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:00,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-14 14:49:00,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:00,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:00,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:00,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:00,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:00,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:00,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:00,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:00,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:00,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-14 14:49:00,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:00,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:00,135 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:00,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-14 14:49:00,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-14 14:49:00,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:00,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:00,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:00,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:00,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:00,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:00,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:00,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:00,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:00,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:00,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:00,190 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:00,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-14 14:49:00,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:00,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:00,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:00,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:00,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:00,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:00,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:00,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:00,214 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:00,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:00,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:00,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:00,241 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:00,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-14 14:49:00,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:00,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:00,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:00,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:00,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:00,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:00,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:00,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:00,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:00,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-14 14:49:00,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:00,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:00,267 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:00,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:00,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-14 14:49:00,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:00,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:00,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:00,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:00,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:00,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:00,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:00,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:00,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-14 14:49:00,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:00,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:00,300 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:00,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-14 14:49:00,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:00,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:00,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:00,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:00,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:00,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:00,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:00,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:00,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-14 14:49:00,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:00,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:00,350 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:00,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-14 14:49:00,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:00,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:00,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:00,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:00,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:00,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:00,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:00,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:00,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:00,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:00,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:00,413 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:00,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-14 14:49:00,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:00,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:00,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:00,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:00,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:00,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:00,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:00,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:00,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:00,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:00,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:00,443 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:00,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-14 14:49:00,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:00,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:00,452 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-14 14:49:00,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:00,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:00,466 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-14 14:49:00,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:00,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:00,508 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-14 14:49:00,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:00,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:00,510 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:00,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-14 14:49:00,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:00,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:00,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:00,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:00,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:00,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:00,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:00,542 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:49:00,574 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-14 14:49:00,574 INFO L444 ModelExtractionUtils]: 9 out of 40 variables were initially zero. Simplification set additionally 28 variables to zero. [2022-07-14 14:49:00,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:00,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:00,578 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:00,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-14 14:49:00,580 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:49:00,586 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 14:49:00,586 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:49:00,586 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0#1.offset, v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_2) = -1*ULTIMATE.start_cstrcspn_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_2 Supporting invariants [] [2022-07-14 14:49:00,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:00,647 INFO L293 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2022-07-14 14:49:00,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:00,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 14:49:00,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:00,731 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-14 14:49:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:00,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 14:49:00,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:49:00,786 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-14 14:49:00,786 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:49:00,839 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 49 states and 59 transitions. Complement of second has 7 states. [2022-07-14 14:49:00,840 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-14 14:49:00,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:49:00,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-07-14 14:49:00,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2022-07-14 14:49:00,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:00,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2022-07-14 14:49:00,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:00,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2022-07-14 14:49:00,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:00,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2022-07-14 14:49:00,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:49:00,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 42 transitions. [2022-07-14 14:49:00,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-14 14:49:00,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-14 14:49:00,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2022-07-14 14:49:00,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:49:00,844 INFO L369 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-07-14 14:49:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2022-07-14 14:49:00,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2022-07-14 14:49:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:49:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-07-14 14:49:00,847 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-07-14 14:49:00,847 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-07-14 14:49:00,847 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 14:49:00,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2022-07-14 14:49:00,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:49:00,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:49:00,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:49:00,848 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:49:00,848 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:49:00,849 INFO L752 eck$LassoCheckResult]: Stem: 465#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 466#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 473#L14 assume !(build_nondet_String_~length~0#1 < 1); 474#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 486#L19 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 475#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 476#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 471#L19-1 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 472#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 479#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 480#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 469#L33-1 assume !cstrcspn_#t~short7#1; 470#L33-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 481#L33-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 482#L35 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 487#L30-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 488#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 477#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 478#L33-5 [2022-07-14 14:49:00,849 INFO L754 eck$LassoCheckResult]: Loop: 478#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 467#L33-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 468#L33-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 478#L33-5 [2022-07-14 14:49:00,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:00,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 2 times [2022-07-14 14:49:00,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:00,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528383957] [2022-07-14 14:49:00,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:00,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:00,863 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:00,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:00,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:00,877 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2022-07-14 14:49:00,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:00,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786327931] [2022-07-14 14:49:00,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:00,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:00,881 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:00,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:00,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:00,886 INFO L85 PathProgramCache]: Analyzing trace with hash -238092697, now seen corresponding path program 1 times [2022-07-14 14:49:00,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:00,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568898002] [2022-07-14 14:49:00,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:00,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:49:00,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:49:00,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568898002] [2022-07-14 14:49:00,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568898002] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:49:00,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966235928] [2022-07-14 14:49:00,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:00,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:49:00,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:00,956 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:49:00,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-07-14 14:49:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:01,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-14 14:49:01,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:01,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 14:49:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:49:01,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:49:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:49:01,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966235928] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:49:01,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:49:01,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 16 [2022-07-14 14:49:01,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801970115] [2022-07-14 14:49:01,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:49:01,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:49:01,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 14:49:01,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-07-14 14:49:01,298 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 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-14 14:49:01,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:49:01,493 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-07-14 14:49:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 14:49:01,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 67 transitions. [2022-07-14 14:49:01,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:49:01,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 45 states and 54 transitions. [2022-07-14 14:49:01,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-14 14:49:01,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-14 14:49:01,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2022-07-14 14:49:01,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:49:01,496 INFO L369 hiAutomatonCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-07-14 14:49:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2022-07-14 14:49:01,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-07-14 14:49:01,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:49:01,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-07-14 14:49:01,498 INFO L392 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-07-14 14:49:01,498 INFO L374 stractBuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-07-14 14:49:01,498 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 14:49:01,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2022-07-14 14:49:01,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:49:01,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:49:01,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:49:01,500 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:49:01,500 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:49:01,501 INFO L752 eck$LassoCheckResult]: Stem: 704#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 705#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 712#L14 assume !(build_nondet_String_~length~0#1 < 1); 713#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 725#L19 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 714#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 715#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 710#L19-1 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 711#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 726#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 731#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 708#L33-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 709#L33-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 720#L33-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 721#L35 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 728#L30-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 727#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 716#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 717#L33-5 [2022-07-14 14:49:01,501 INFO L754 eck$LassoCheckResult]: Loop: 717#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 706#L33-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 707#L33-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 717#L33-5 [2022-07-14 14:49:01,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:01,501 INFO L85 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 1 times [2022-07-14 14:49:01,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:01,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34056686] [2022-07-14 14:49:01,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:01,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:01,516 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:01,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:01,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:01,540 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2022-07-14 14:49:01,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:01,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554128010] [2022-07-14 14:49:01,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:01,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:01,544 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:01,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:01,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:01,548 INFO L85 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2022-07-14 14:49:01,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:01,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531517942] [2022-07-14 14:49:01,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:01,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:01,565 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:01,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:02,567 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:49:02,567 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:49:02,567 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:49:02,567 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:49:02,567 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:49:02,567 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:02,567 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:49:02,567 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:49:02,567 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn.c_Iteration6_Lasso [2022-07-14 14:49:02,567 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:49:02,568 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:49:02,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:02,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:02,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:02,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:02,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:02,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:02,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:02,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:02,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:02,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:02,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:03,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:03,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:03,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:03,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:03,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:03,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:03,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:03,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:04,304 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:49:04,304 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:49:04,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:04,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:04,312 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:04,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-14 14:49:04,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:04,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:04,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:04,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:04,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:04,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:04,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:04,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:04,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:04,339 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-14 14:49:04,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:04,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:04,341 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:04,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-14 14:49:04,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:04,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:04,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:04,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:04,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:04,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:04,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:04,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:04,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:04,365 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-14 14:49:04,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:04,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:04,366 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:04,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-14 14:49:04,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:04,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:04,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:04,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:04,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:04,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:04,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:04,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:04,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:04,403 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-14 14:49:04,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:04,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:04,404 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:04,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-14 14:49:04,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:04,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:04,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:04,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:04,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:04,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:04,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:04,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:04,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:04,428 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-14 14:49:04,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:04,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:04,430 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:04,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-14 14:49:04,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:04,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:04,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:04,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:04,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:04,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:04,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:04,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:04,438 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:04,453 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-14 14:49:04,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:04,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:04,455 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:04,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-14 14:49:04,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:04,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:04,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:04,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:04,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:04,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:04,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:04,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:04,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:04,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:04,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:04,515 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:04,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-14 14:49:04,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:04,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:04,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:04,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:04,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:04,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:04,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:04,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:04,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:04,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:04,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:04,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:04,541 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:04,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-14 14:49:04,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:04,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:04,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:04,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:04,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:04,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:04,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:04,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:04,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:04,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-14 14:49:04,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:04,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:04,567 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:04,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-14 14:49:04,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:04,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:04,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:04,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:04,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:04,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:04,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:04,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:04,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:04,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:04,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:04,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:04,613 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:04,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-14 14:49:04,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:04,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:04,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:04,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:04,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:04,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:04,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:04,624 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:04,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-07-14 14:49:04,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:04,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:04,641 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:04,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-14 14:49:04,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:04,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:04,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:04,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:04,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:04,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:04,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:04,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:04,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-14 14:49:04,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:04,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:04,668 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:04,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-14 14:49:04,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:04,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:04,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:04,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:04,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:04,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:04,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:04,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:04,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-14 14:49:04,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:04,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:04,700 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:04,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-14 14:49:04,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:04,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:04,708 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2022-07-14 14:49:04,708 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2022-07-14 14:49:04,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:04,805 INFO L401 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2022-07-14 14:49:04,805 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2022-07-14 14:49:05,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:05,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:05,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:05,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:05,030 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:05,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:05,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:05,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:05,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:05,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:05,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:05,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:05,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-14 14:49:05,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:05,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:05,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:05,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:05,078 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:05,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:05,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:05,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:05,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:05,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:05,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:05,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:05,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-14 14:49:05,119 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:49:05,168 INFO L443 ModelExtractionUtils]: Simplification made 27 calls to the SMT solver. [2022-07-14 14:49:05,168 INFO L444 ModelExtractionUtils]: 11 out of 49 variables were initially zero. Simplification set additionally 35 variables to zero. [2022-07-14 14:49:05,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:05,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:05,170 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:49:05,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-14 14:49:05,172 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:49:05,203 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 14:49:05,204 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:49:05,204 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0#1.offset, v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_3) = -1*ULTIMATE.start_cstrcspn_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_3 Supporting invariants [] [2022-07-14 14:49:05,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:05,279 INFO L293 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2022-07-14 14:49:05,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:05,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 14:49:05,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:05,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 14:49:05,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:49:05,423 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-14 14:49:05,423 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:49:05,472 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 49 states and 60 transitions. Complement of second has 7 states. [2022-07-14 14:49:05,473 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-14 14:49:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:49:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-07-14 14:49:05,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2022-07-14 14:49:05,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:05,474 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:49:05,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:05,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 14:49:05,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:05,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 14:49:05,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:49:05,604 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-14 14:49:05,604 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:49:05,674 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 49 states and 60 transitions. Complement of second has 7 states. [2022-07-14 14:49:05,675 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-14 14:49:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:49:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-07-14 14:49:05,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2022-07-14 14:49:05,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:05,676 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:49:05,684 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-14 14:49:05,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:05,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 14:49:05,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:05,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 14:49:05,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:49:05,800 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-14 14:49:05,800 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:49:05,854 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 62 transitions. Complement of second has 6 states. [2022-07-14 14:49:05,855 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-14 14:49:05,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:49:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-07-14 14:49:05,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 18 letters. Loop has 3 letters. [2022-07-14 14:49:05,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:05,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 21 letters. Loop has 3 letters. [2022-07-14 14:49:05,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:05,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 18 letters. Loop has 6 letters. [2022-07-14 14:49:05,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:05,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2022-07-14 14:49:05,861 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 14:49:05,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2022-07-14 14:49:05,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 14:49:05,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 14:49:05,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 14:49:05,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:49:05,862 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 14:49:05,862 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 14:49:05,862 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 14:49:05,862 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 14:49:05,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 14:49:05,863 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 14:49:05,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 14:49:05,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 02:49:05 BoogieIcfgContainer [2022-07-14 14:49:05,869 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 14:49:05,869 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 14:49:05,869 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 14:49:05,870 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 14:49:05,870 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:48:53" (3/4) ... [2022-07-14 14:49:05,873 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 14:49:05,873 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 14:49:05,873 INFO L158 Benchmark]: Toolchain (without parser) took 12571.98ms. Allocated memory was 94.4MB in the beginning and 138.4MB in the end (delta: 44.0MB). Free memory was 60.4MB in the beginning and 88.8MB in the end (delta: -28.4MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2022-07-14 14:49:05,874 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 94.4MB. Free memory was 64.4MB in the beginning and 64.3MB in the end (delta: 25.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:49:05,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.70ms. Allocated memory is still 94.4MB. Free memory was 60.2MB in the beginning and 71.1MB in the end (delta: -10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 14:49:05,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.57ms. Allocated memory is still 94.4MB. Free memory was 71.1MB in the beginning and 69.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 14:49:05,875 INFO L158 Benchmark]: Boogie Preprocessor took 23.01ms. Allocated memory is still 94.4MB. Free memory was 69.3MB in the beginning and 68.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 14:49:05,875 INFO L158 Benchmark]: RCFGBuilder took 292.56ms. Allocated memory is still 94.4MB. Free memory was 68.0MB in the beginning and 56.4MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 14:49:05,875 INFO L158 Benchmark]: BuchiAutomizer took 12009.95ms. Allocated memory was 94.4MB in the beginning and 138.4MB in the end (delta: 44.0MB). Free memory was 56.4MB in the beginning and 88.8MB in the end (delta: -32.5MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-07-14 14:49:05,875 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 138.4MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:49:05,877 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.12ms. Allocated memory is still 94.4MB. Free memory was 64.4MB in the beginning and 64.3MB in the end (delta: 25.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.70ms. Allocated memory is still 94.4MB. Free memory was 60.2MB in the beginning and 71.1MB in the end (delta: -10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.57ms. Allocated memory is still 94.4MB. Free memory was 71.1MB in the beginning and 69.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.01ms. Allocated memory is still 94.4MB. Free memory was 69.3MB in the beginning and 68.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 292.56ms. Allocated memory is still 94.4MB. Free memory was 68.0MB in the beginning and 56.4MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 12009.95ms. Allocated memory was 94.4MB in the beginning and 138.4MB in the end (delta: 44.0MB). Free memory was 56.4MB in the beginning and 88.8MB in the end (delta: -32.5MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 138.4MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[build_nondet_String()] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[nondetString] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[nondetString] 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 11.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 10.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 26 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 [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 327 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 197 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 298 IncrementalHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 130 mSDtfsCounter, 298 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital261 mio100 ax100 hnf100 lsp100 ukn75 mio100 lsp33 div124 bol100 ite100 ukn100 eq178 hnf91 smp89 dnf722 smp55 tf100 neg95 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 302ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-14 14:49:05,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-07-14 14:49:06,112 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