./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-dietlibc/strrchr.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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-dietlibc/strrchr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 b850f5453e922b3972aa9b5b79a1b07337c08d581cc5e6a2a56803408dc479cf --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:23:36,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:23:36,883 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:23:36,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:23:36,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:23:36,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:23:36,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:23:36,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:23:36,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:23:36,917 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:23:36,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:23:36,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:23:36,918 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:23:36,919 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:23:36,919 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:23:36,920 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:23:36,920 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:23:36,920 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:23:36,921 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:23:36,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:23:36,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:23:36,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:23:36,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:23:36,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:23:36,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:23:36,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:23:36,923 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:23:36,924 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:23:36,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:23:36,924 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:23:36,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:23:36,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:23:36,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:23:36,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:23:36,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:23:36,927 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:23:36,927 INFO L153 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 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 -> b850f5453e922b3972aa9b5b79a1b07337c08d581cc5e6a2a56803408dc479cf [2024-11-09 15:23:37,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:23:37,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:23:37,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:23:37,194 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:23:37,195 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:23:37,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strrchr.i [2024-11-09 15:23:38,609 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:23:38,889 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:23:38,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strrchr.i [2024-11-09 15:23:38,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f157e8494/d79371c548a54179803f83b540b24842/FLAG42f23d5de [2024-11-09 15:23:39,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f157e8494/d79371c548a54179803f83b540b24842 [2024-11-09 15:23:39,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:23:39,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:23:39,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:23:39,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:23:39,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:23:39,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:23:39" (1/1) ... [2024-11-09 15:23:39,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e3d5965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:39, skipping insertion in model container [2024-11-09 15:23:39,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:23:39" (1/1) ... [2024-11-09 15:23:39,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:23:39,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:23:39,549 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:23:39,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:23:39,616 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:23:39,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:39 WrapperNode [2024-11-09 15:23:39,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:23:39,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:23:39,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:23:39,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:23:39,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:39" (1/1) ... [2024-11-09 15:23:39,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:39" (1/1) ... [2024-11-09 15:23:39,662 INFO L138 Inliner]: procedures = 114, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 102 [2024-11-09 15:23:39,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:23:39,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:23:39,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:23:39,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:23:39,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:39" (1/1) ... [2024-11-09 15:23:39,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:39" (1/1) ... [2024-11-09 15:23:39,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:39" (1/1) ... [2024-11-09 15:23:39,694 INFO L175 MemorySlicer]: Split 10 memory accesses to 1 slices as follows [10]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-09 15:23:39,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:39" (1/1) ... [2024-11-09 15:23:39,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:39" (1/1) ... [2024-11-09 15:23:39,700 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:39" (1/1) ... [2024-11-09 15:23:39,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:39" (1/1) ... [2024-11-09 15:23:39,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:39" (1/1) ... [2024-11-09 15:23:39,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:39" (1/1) ... [2024-11-09 15:23:39,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:23:39,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:23:39,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:23:39,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:23:39,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:39" (1/1) ... [2024-11-09 15:23:39,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:39,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:39,746 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) [2024-11-09 15:23:39,750 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 [2024-11-09 15:23:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:23:39,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:23:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 15:23:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:23:39,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:23:39,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:23:39,901 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:23:39,905 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:23:40,084 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-09 15:23:40,084 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:23:40,098 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:23:40,098 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 15:23:40,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:23:40 BoogieIcfgContainer [2024-11-09 15:23:40,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:23:40,100 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:23:40,100 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:23:40,103 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:23:40,104 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:23:40,104 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:23:39" (1/3) ... [2024-11-09 15:23:40,105 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a0cb49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:23:40, skipping insertion in model container [2024-11-09 15:23:40,106 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:23:40,106 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:23:39" (2/3) ... [2024-11-09 15:23:40,107 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a0cb49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:23:40, skipping insertion in model container [2024-11-09 15:23:40,107 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:23:40,107 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:23:40" (3/3) ... [2024-11-09 15:23:40,108 INFO L332 chiAutomizerObserver]: Analyzing ICFG strrchr.i [2024-11-09 15:23:40,166 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:23:40,166 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:23:40,166 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:23:40,166 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:23:40,166 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:23:40,166 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:23:40,167 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:23:40,167 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:23:40,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:23:40,185 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2024-11-09 15:23:40,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:23:40,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:23:40,189 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:23:40,189 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:23:40,189 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:23:40,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:23:40,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2024-11-09 15:23:40,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:23:40,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:23:40,191 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:23:40,191 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:23:40,197 INFO L745 eck$LassoCheckResult]: Stem: 19#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 10#L521true assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0; 11#L523-3true [2024-11-09 15:23:40,198 INFO L747 eck$LassoCheckResult]: Loop: 11#L523-3true assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 17#L523-2true main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 11#L523-3true [2024-11-09 15:23:40,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:40,202 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-11-09 15:23:40,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:40,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745164336] [2024-11-09 15:23:40,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:40,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:40,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:23:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:40,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:23:40,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:40,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2024-11-09 15:23:40,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:40,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404703621] [2024-11-09 15:23:40,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:40,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:40,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:23:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:40,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:23:40,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:40,396 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2024-11-09 15:23:40,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:40,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821624837] [2024-11-09 15:23:40,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:40,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:40,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:23:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:40,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:23:40,750 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:23:40,751 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:23:40,751 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:23:40,751 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:23:40,751 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:23:40,751 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:40,751 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:23:40,751 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:23:40,751 INFO L132 ssoRankerPreferences]: Filename of dumped script: strrchr.i_Iteration1_Lasso [2024-11-09 15:23:40,751 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:23:40,752 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:23:40,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:40,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:41,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:41,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:41,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:41,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:41,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:41,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:41,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:41,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:41,267 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:23:41,271 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:23:41,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:41,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:41,276 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) [2024-11-09 15:23:41,277 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 [2024-11-09 15:23:41,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:23:41,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:41,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:23:41,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:41,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:23:41,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:41,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:23:41,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:23:41,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:23:41,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-09 15:23:41,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:41,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:41,316 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) [2024-11-09 15:23:41,317 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 [2024-11-09 15:23:41,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 [2024-11-09 15:23:41,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:41,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:41,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:23:41,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:41,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:23:41,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:23:41,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:23:41,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-09 15:23:41,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:41,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:41,359 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) [2024-11-09 15:23:41,360 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 [2024-11-09 15:23:41,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:23:41,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:41,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:23:41,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:41,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:23:41,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:41,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:23:41,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:23:41,376 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:23:41,387 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 [2024-11-09 15:23:41,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:41,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:41,389 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) [2024-11-09 15:23:41,390 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 [2024-11-09 15:23:41,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:23:41,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:41,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:41,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:23:41,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:41,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:23:41,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:23:41,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:23:41,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-09 15:23:41,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:41,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:41,431 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) [2024-11-09 15:23:41,433 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 [2024-11-09 15:23:41,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:23:41,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:41,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:41,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:23:41,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:41,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:23:41,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:23:41,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:23:41,475 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 [2024-11-09 15:23:41,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:41,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:41,479 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) [2024-11-09 15:23:41,480 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 [2024-11-09 15:23:41,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:23:41,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:41,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:41,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:23:41,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:41,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:23:41,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:23:41,511 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:23:41,534 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-09 15:23:41,534 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-09 15:23:41,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:41,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:41,559 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) [2024-11-09 15:23:41,561 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 [2024-11-09 15:23:41,562 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:23:41,579 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:23:41,580 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:23:41,580 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~in_len~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~in_len~0#1 Supporting invariants [] [2024-11-09 15:23:41,594 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 [2024-11-09 15:23:41,607 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-11-09 15:23:41,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:23:41,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:23:41,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:23:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:23:41,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:23:41,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:23:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:23:41,723 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:23:41,725 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:23:41,770 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 46 states and 67 transitions. Complement of second has 6 states. [2024-11-09 15:23:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:23:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:23:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2024-11-09 15:23:41,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 3 letters. Loop has 2 letters. [2024-11-09 15:23:41,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:23:41,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-09 15:23:41,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:23:41,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-09 15:23:41,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:23:41,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 67 transitions. [2024-11-09 15:23:41,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-09 15:23:41,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 20 states and 26 transitions. [2024-11-09 15:23:41,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-09 15:23:41,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-09 15:23:41,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2024-11-09 15:23:41,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:23:41,790 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-09 15:23:41,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2024-11-09 15:23:41,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-09 15:23:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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) [2024-11-09 15:23:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-11-09 15:23:41,813 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-09 15:23:41,813 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-11-09 15:23:41,814 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:23:41,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2024-11-09 15:23:41,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-09 15:23:41,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:23:41,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:23:41,815 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:23:41,815 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:23:41,815 INFO L745 eck$LassoCheckResult]: Stem: 138#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 127#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 128#L521 assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0; 130#L523-3 assume !(main_~i~0#1 < main_~in_len~0#1 - 1); 120#L523-4 havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 121#L511-1 [2024-11-09 15:23:41,816 INFO L747 eck$LassoCheckResult]: Loop: 121#L511-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 139#L512 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 124#L512-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 122#L512-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 123#L513 assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 136#L513-2 call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 134#L513-3 assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 135#L514 assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 137#L514-2 call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 133#L514-3 assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 129#L515 assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 125#L515-2 call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 126#L515-3 assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset; 121#L511-1 [2024-11-09 15:23:41,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:41,817 INFO L85 PathProgramCache]: Analyzing trace with hash 28695884, now seen corresponding path program 1 times [2024-11-09 15:23:41,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:41,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234584134] [2024-11-09 15:23:41,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:41,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:41,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:23:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:41,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:23:41,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:41,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1890546192, now seen corresponding path program 1 times [2024-11-09 15:23:41,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:41,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415947579] [2024-11-09 15:23:41,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:41,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:41,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:23:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:41,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:23:41,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:41,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1076020901, now seen corresponding path program 1 times [2024-11-09 15:23:41,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:41,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38624172] [2024-11-09 15:23:41,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:41,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:23:42,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-09 15:23:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:23:42,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:23:42,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38624172] [2024-11-09 15:23:42,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38624172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:23:42,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:23:42,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 15:23:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398543832] [2024-11-09 15:23:42,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:23:42,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:23:42,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 15:23:42,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 15:23:42,833 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:23:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:23:42,939 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2024-11-09 15:23:42,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2024-11-09 15:23:42,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-09 15:23:42,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 26 transitions. [2024-11-09 15:23:42,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-09 15:23:42,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-09 15:23:42,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2024-11-09 15:23:42,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:23:42,941 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-09 15:23:42,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2024-11-09 15:23:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-09 15:23:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:23:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-09 15:23:42,947 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-09 15:23:42,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 15:23:42,948 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-09 15:23:42,949 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:23:42,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2024-11-09 15:23:42,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-09 15:23:42,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:23:42,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:23:42,950 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:23:42,950 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:23:42,952 INFO L745 eck$LassoCheckResult]: Stem: 196#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 186#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 187#L521 assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0; 189#L523-3 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 190#L523-2 main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 191#L523-3 assume !(main_~i~0#1 < main_~in_len~0#1 - 1); 178#L523-4 havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 179#L511-1 [2024-11-09 15:23:42,952 INFO L747 eck$LassoCheckResult]: Loop: 179#L511-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 197#L512 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 182#L512-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 180#L512-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 181#L513 assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 194#L513-2 call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 192#L513-3 assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 193#L514 assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 195#L514-2 call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 188#L514-3 assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 185#L515 assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 183#L515-2 call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 184#L515-3 assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset; 179#L511-1 [2024-11-09 15:23:42,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:42,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1806996910, now seen corresponding path program 1 times [2024-11-09 15:23:42,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:42,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637841264] [2024-11-09 15:23:42,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:42,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:42,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:23:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:42,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:23:42,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:42,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1890546192, now seen corresponding path program 2 times [2024-11-09 15:23:42,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:42,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854356338] [2024-11-09 15:23:42,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:42,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:42,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:23:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:42,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:23:43,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:43,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1656110467, now seen corresponding path program 1 times [2024-11-09 15:23:43,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:43,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416032467] [2024-11-09 15:23:43,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:43,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:23:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:23:43,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:23:43,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416032467] [2024-11-09 15:23:43,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416032467] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:23:43,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247617355] [2024-11-09 15:23:43,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:43,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:23:43,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:43,345 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:23:43,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 15:23:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:23:43,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 15:23:43,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:23:43,506 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 9 [2024-11-09 15:23:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:23:43,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:23:44,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 15:23:44,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 128 [2024-11-09 15:23:44,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-11-09 15:23:44,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 15:23:44,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 113 [2024-11-09 15:23:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:23:44,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247617355] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:23:44,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:23:44,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 13] total 29 [2024-11-09 15:23:44,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532078122] [2024-11-09 15:23:44,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:23:44,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:23:44,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 15:23:44,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2024-11-09 15:23:44,546 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 7 Second operand has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:23:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:23:45,152 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-09 15:23:45,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2024-11-09 15:23:45,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-09 15:23:45,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 23 states and 28 transitions. [2024-11-09 15:23:45,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-09 15:23:45,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-09 15:23:45,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2024-11-09 15:23:45,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:23:45,154 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-09 15:23:45,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2024-11-09 15:23:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-09 15:23:45,160 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) [2024-11-09 15:23:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-11-09 15:23:45,160 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-09 15:23:45,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 15:23:45,161 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-09 15:23:45,161 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:23:45,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2024-11-09 15:23:45,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-09 15:23:45,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:23:45,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:23:45,162 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-09 15:23:45,162 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:23:45,163 INFO L745 eck$LassoCheckResult]: Stem: 419#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 408#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 409#L521 assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0; 410#L523-3 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 411#L523-2 main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 412#L523-3 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 413#L523-2 main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 421#L523-3 assume !(main_~i~0#1 < main_~in_len~0#1 - 1); 400#L523-4 havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 401#L511-1 [2024-11-09 15:23:45,163 INFO L747 eck$LassoCheckResult]: Loop: 401#L511-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 420#L512 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 404#L512-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 402#L512-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 403#L513 assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 417#L513-2 call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 415#L513-3 assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 416#L514 assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 418#L514-2 call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 414#L514-3 assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 407#L515 assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 405#L515-2 call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 406#L515-3 assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset; 401#L511-1 [2024-11-09 15:23:45,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:45,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1357299088, now seen corresponding path program 2 times [2024-11-09 15:23:45,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:45,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697633011] [2024-11-09 15:23:45,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:45,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:45,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:23:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:45,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:23:45,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1890546192, now seen corresponding path program 3 times [2024-11-09 15:23:45,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:45,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803066301] [2024-11-09 15:23:45,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:45,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:45,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:23:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:45,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:23:45,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:45,194 INFO L85 PathProgramCache]: Analyzing trace with hash 776434913, now seen corresponding path program 2 times [2024-11-09 15:23:45,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:45,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421613095] [2024-11-09 15:23:45,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:45,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:23:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:23:45,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:23:45,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421613095] [2024-11-09 15:23:45,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421613095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:23:45,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102839748] [2024-11-09 15:23:45,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:23:45,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:23:45,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:45,553 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:23:45,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 15:23:45,636 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:23:45,636 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:23:45,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 15:23:45,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:23:45,741 INFO L378 Elim1Store]: Elim1 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 14 treesize of output 10 [2024-11-09 15:23:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:23:46,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:23:46,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 15:23:46,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 122 [2024-11-09 15:23:46,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-11-09 15:23:46,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 15:23:46,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 94 [2024-11-09 15:23:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:23:47,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102839748] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:23:47,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:23:47,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 15] total 33 [2024-11-09 15:23:47,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258917344] [2024-11-09 15:23:47,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:23:47,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:23:47,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 15:23:47,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=943, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 15:23:47,323 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand has 33 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:23:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:23:48,504 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-09 15:23:48,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2024-11-09 15:23:48,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-09 15:23:48,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 25 states and 30 transitions. [2024-11-09 15:23:48,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-09 15:23:48,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-09 15:23:48,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2024-11-09 15:23:48,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:23:48,507 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-09 15:23:48,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2024-11-09 15:23:48,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-09 15:23:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:23:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-11-09 15:23:48,511 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-11-09 15:23:48,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 15:23:48,513 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-11-09 15:23:48,514 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:23:48,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2024-11-09 15:23:48,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-09 15:23:48,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:23:48,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:23:48,515 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2024-11-09 15:23:48,515 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:23:48,515 INFO L745 eck$LassoCheckResult]: Stem: 679#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 666#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 667#L521 assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0; 669#L523-3 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 670#L523-2 main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 678#L523-3 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 682#L523-2 main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 671#L523-3 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 672#L523-2 main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 681#L523-3 assume !(main_~i~0#1 < main_~in_len~0#1 - 1); 659#L523-4 havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 660#L511-1 [2024-11-09 15:23:48,515 INFO L747 eck$LassoCheckResult]: Loop: 660#L511-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 680#L512 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 663#L512-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 661#L512-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 662#L513 assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 676#L513-2 call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 674#L513-3 assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 675#L514 assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 677#L514-2 call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 673#L514-3 assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 668#L515 assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 664#L515-2 call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 665#L515-3 assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset; 660#L511-1 [2024-11-09 15:23:48,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:48,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1305578254, now seen corresponding path program 3 times [2024-11-09 15:23:48,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:48,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342643667] [2024-11-09 15:23:48,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:48,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:48,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:23:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:48,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:23:48,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:48,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1890546192, now seen corresponding path program 4 times [2024-11-09 15:23:48,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:48,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177916018] [2024-11-09 15:23:48,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:48,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:48,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:23:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:48,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:23:48,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:48,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1516784831, now seen corresponding path program 3 times [2024-11-09 15:23:48,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:48,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372746292] [2024-11-09 15:23:48,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:48,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:23:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:23:49,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:23:49,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372746292] [2024-11-09 15:23:49,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372746292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:23:49,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360494293] [2024-11-09 15:23:49,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:23:49,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:23:49,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:49,066 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:23:49,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 15:23:49,152 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 15:23:49,152 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:23:49,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 15:23:49,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:23:49,264 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 9 [2024-11-09 15:23:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:23:49,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:23:49,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2024-11-09 15:23:49,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 15:23:49,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 53 [2024-11-09 15:23:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:23:49,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360494293] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:23:49,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:23:49,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2024-11-09 15:23:49,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316046598] [2024-11-09 15:23:49,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:23:50,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:23:50,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 15:23:50,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 15:23:50,042 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 7 Second operand has 38 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:23:50,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:23:50,411 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-11-09 15:23:50,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2024-11-09 15:23:50,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-09 15:23:50,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 52 transitions. [2024-11-09 15:23:50,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-11-09 15:23:50,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-11-09 15:23:50,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 52 transitions. [2024-11-09 15:23:50,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:23:50,413 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 52 transitions. [2024-11-09 15:23:50,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 52 transitions. [2024-11-09 15:23:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2024-11-09 15:23:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.236842105263158) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:23:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-11-09 15:23:50,416 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-09 15:23:50,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 15:23:50,417 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-09 15:23:50,417 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:23:50,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2024-11-09 15:23:50,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-09 15:23:50,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:23:50,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:23:50,418 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:23:50,418 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:23:50,419 INFO L745 eck$LassoCheckResult]: Stem: 940#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 926#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 927#L521 assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0; 929#L523-3 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 930#L523-2 main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 931#L523-3 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 932#L523-2 main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 954#L523-3 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 953#L523-2 main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 952#L523-3 assume !(main_~i~0#1 < main_~in_len~0#1 - 1); 917#L523-4 havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 918#L511-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 942#L512 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 921#L512-2 [2024-11-09 15:23:50,419 INFO L747 eck$LassoCheckResult]: Loop: 921#L512-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 919#L512-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 920#L513 assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 935#L513-2 call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 933#L513-3 assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 934#L514 assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 943#L514-2 call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 944#L514-3 assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 945#L515 assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 922#L515-2 call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 923#L515-3 assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset; 924#L511-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 941#L512 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 921#L512-2 [2024-11-09 15:23:50,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:50,420 INFO L85 PathProgramCache]: Analyzing trace with hash -530250857, now seen corresponding path program 1 times [2024-11-09 15:23:50,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:50,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920624751] [2024-11-09 15:23:50,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:50,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:50,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:23:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:50,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:23:50,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2009616586, now seen corresponding path program 5 times [2024-11-09 15:23:50,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:50,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575923637] [2024-11-09 15:23:50,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:50,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:50,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:23:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:50,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:23:50,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:50,461 INFO L85 PathProgramCache]: Analyzing trace with hash 625192800, now seen corresponding path program 1 times [2024-11-09 15:23:50,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:50,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710314588] [2024-11-09 15:23:50,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:50,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:23:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:23:50,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:23:50,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710314588] [2024-11-09 15:23:50,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710314588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:23:50,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990567857] [2024-11-09 15:23:50,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:50,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:23:50,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:50,928 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:23:50,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 15:23:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:23:51,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 15:23:51,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:23:51,115 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 9 [2024-11-09 15:23:51,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 15:23:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:23:51,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:23:51,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-09 15:23:51,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-09 15:23:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:23:51,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990567857] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:23:51,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:23:51,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2024-11-09 15:23:51,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015231343] [2024-11-09 15:23:51,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:23:51,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:23:51,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 15:23:51,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2024-11-09 15:23:51,604 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 11 Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:23:52,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:23:52,170 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2024-11-09 15:23:52,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 61 transitions. [2024-11-09 15:23:52,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-09 15:23:52,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 27 states and 32 transitions. [2024-11-09 15:23:52,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-09 15:23:52,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-09 15:23:52,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2024-11-09 15:23:52,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:23:52,171 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-09 15:23:52,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2024-11-09 15:23:52,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-09 15:23:52,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 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) [2024-11-09 15:23:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-09 15:23:52,173 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-09 15:23:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 15:23:52,177 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-09 15:23:52,177 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:23:52,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2024-11-09 15:23:52,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-09 15:23:52,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:23:52,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:23:52,179 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2024-11-09 15:23:52,179 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:23:52,179 INFO L745 eck$LassoCheckResult]: Stem: 1232#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1219#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 1220#L521 assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0; 1222#L523-3 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 1223#L523-2 main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 1224#L523-3 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 1225#L523-2 main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 1231#L523-3 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 1237#L523-2 main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 1236#L523-3 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1; 1235#L523-2 main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 1234#L523-3 assume !(main_~i~0#1 < main_~in_len~0#1 - 1); 1212#L523-4 havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 1213#L511-1 [2024-11-09 15:23:52,179 INFO L747 eck$LassoCheckResult]: Loop: 1213#L511-1 call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1233#L512 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 1216#L512-2 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1214#L512-3 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1215#L513 assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 1229#L513-2 call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1227#L513-3 assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1228#L514 assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 1230#L514-2 call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1226#L514-3 assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1221#L515 assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 1217#L515-2 call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1218#L515-3 assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset; 1213#L511-1 [2024-11-09 15:23:52,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:52,179 INFO L85 PathProgramCache]: Analyzing trace with hash -530195500, now seen corresponding path program 4 times [2024-11-09 15:23:52,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:52,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804422951] [2024-11-09 15:23:52,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:52,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:52,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:23:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:52,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:23:52,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:52,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1890546192, now seen corresponding path program 6 times [2024-11-09 15:23:52,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:52,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872191583] [2024-11-09 15:23:52,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:52,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:52,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:23:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:52,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:23:52,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:52,221 INFO L85 PathProgramCache]: Analyzing trace with hash 28484893, now seen corresponding path program 4 times [2024-11-09 15:23:52,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:23:52,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142918361] [2024-11-09 15:23:52,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:23:52,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:23:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:52,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:23:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:23:52,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:23:53,155 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:23:53,155 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:23:53,155 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:23:53,156 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:23:53,156 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:23:53,156 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:53,156 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:23:53,156 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:23:53,156 INFO L132 ssoRankerPreferences]: Filename of dumped script: strrchr.i_Iteration7_Lasso [2024-11-09 15:23:53,156 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:23:53,156 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:23:53,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:23:53,816 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:23:53,816 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:23:53,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:53,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:53,817 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) [2024-11-09 15:23:53,819 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 [2024-11-09 15:23:53,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:23:53,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:53,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:23:53,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:53,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:23:53,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:53,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:23:53,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:23:53,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:23:53,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-09 15:23:53,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:53,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:53,844 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) [2024-11-09 15:23:53,845 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 [2024-11-09 15:23:53,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:23:53,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:53,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:23:53,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:53,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:23:53,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:53,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:23:53,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:23:53,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:23:53,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-09 15:23:53,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:53,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:53,869 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) [2024-11-09 15:23:53,870 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 [2024-11-09 15:23:53,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 [2024-11-09 15:23:53,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:53,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:23:53,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:53,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:23:53,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:53,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:23:53,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:23:53,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:23:53,893 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 [2024-11-09 15:23:53,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:53,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:53,894 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) [2024-11-09 15:23:53,895 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 [2024-11-09 15:23:53,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:23:53,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:53,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:23:53,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:53,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:23:53,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:53,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:23:53,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:23:53,908 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:23:53,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-09 15:23:53,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:53,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:53,920 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) [2024-11-09 15:23:53,921 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 [2024-11-09 15:23:53,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:23:53,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:53,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:53,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:23:53,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:53,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:23:53,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:23:53,936 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:23:53,947 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 [2024-11-09 15:23:53,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:53,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:53,949 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) [2024-11-09 15:23:53,950 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 [2024-11-09 15:23:53,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:23:53,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:53,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:23:53,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:53,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:23:53,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:53,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:23:53,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:23:53,965 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:23:53,978 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 [2024-11-09 15:23:53,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:53,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:53,979 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) [2024-11-09 15:23:53,980 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 [2024-11-09 15:23:53,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:23:53,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:53,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:53,992 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-09 15:23:53,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:54,008 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-09 15:23:54,008 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-09 15:23:54,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:23:54,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-09 15:23:54,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:54,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:54,047 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) [2024-11-09 15:23:54,048 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 [2024-11-09 15:23:54,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:23:54,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:54,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:23:54,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:54,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:23:54,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:54,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:23:54,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:23:54,061 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:23:54,071 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 [2024-11-09 15:23:54,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:54,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:54,072 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) [2024-11-09 15:23:54,073 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 [2024-11-09 15:23:54,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:23:54,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:54,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:23:54,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:54,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:23:54,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:54,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:23:54,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:23:54,086 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:23:54,096 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 [2024-11-09 15:23:54,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:54,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:54,097 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) [2024-11-09 15:23:54,098 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 [2024-11-09 15:23:54,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:23:54,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:54,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:54,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:23:54,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:54,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:23:54,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:23:54,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:23:54,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-09 15:23:54,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:54,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:54,138 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) [2024-11-09 15:23:54,140 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 [2024-11-09 15:23:54,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:23:54,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:54,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:54,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:23:54,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:54,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:23:54,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:23:54,159 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:23:54,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-09 15:23:54,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:54,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:54,176 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) [2024-11-09 15:23:54,178 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 [2024-11-09 15:23:54,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:23:54,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:23:54,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:23:54,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:23:54,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:23:54,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:23:54,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:23:54,200 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:23:54,208 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-09 15:23:54,208 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-09 15:23:54,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:23:54,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:23:54,209 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) [2024-11-09 15:23:54,210 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 [2024-11-09 15:23:54,211 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:23:54,221 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:23:54,222 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:23:54,222 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc15#1.base)_2, ULTIMATE.start_strrchr_~t#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc15#1.base)_2 - 1*ULTIMATE.start_strrchr_~t#1.offset Supporting invariants [] [2024-11-09 15:23:54,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-09 15:23:54,255 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2024-11-09 15:23:54,257 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~t!offset [2024-11-09 15:23:54,258 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:23:54,258 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:23:54,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:23:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:23:54,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:23:54,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:23:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:23:54,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 15:23:54,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:23:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:23:54,473 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-11-09 15:23:54,473 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7 Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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) [2024-11-09 15:23:54,549 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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 39 states and 51 transitions. Complement of second has 7 states. [2024-11-09 15:23:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:23:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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) [2024-11-09 15:23:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2024-11-09 15:23:54,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 13 letters. Loop has 13 letters. [2024-11-09 15:23:54,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:23:54,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 26 letters. Loop has 13 letters. [2024-11-09 15:23:54,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:23:54,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 13 letters. Loop has 26 letters. [2024-11-09 15:23:54,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:23:54,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 51 transitions. [2024-11-09 15:23:54,553 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:23:54,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2024-11-09 15:23:54,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 15:23:54,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 15:23:54,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 15:23:54,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:23:54,553 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:23:54,553 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:23:54,553 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:23:54,554 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:23:54,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 15:23:54,554 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:23:54,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 15:23:54,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:23:54 BoogieIcfgContainer [2024-11-09 15:23:54,563 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:23:54,564 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:23:54,564 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:23:54,565 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:23:54,565 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:23:40" (3/4) ... [2024-11-09 15:23:54,567 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 15:23:54,571 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:23:54,571 INFO L158 Benchmark]: Toolchain (without parser) took 15379.27ms. Allocated memory was 155.2MB in the beginning and 295.7MB in the end (delta: 140.5MB). Free memory was 86.4MB in the beginning and 180.9MB in the end (delta: -94.5MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2024-11-09 15:23:54,572 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 155.2MB. Free memory was 113.7MB in the beginning and 113.6MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:23:54,572 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.56ms. Allocated memory is still 155.2MB. Free memory was 86.2MB in the beginning and 118.2MB in the end (delta: -31.9MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-11-09 15:23:54,572 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.07ms. Allocated memory is still 155.2MB. Free memory was 118.2MB in the beginning and 116.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:23:54,572 INFO L158 Benchmark]: Boogie Preprocessor took 45.09ms. Allocated memory is still 155.2MB. Free memory was 116.0MB in the beginning and 114.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:23:54,572 INFO L158 Benchmark]: RCFGBuilder took 389.75ms. Allocated memory is still 155.2MB. Free memory was 114.0MB in the beginning and 99.8MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 15:23:54,573 INFO L158 Benchmark]: BuchiAutomizer took 14463.18ms. Allocated memory was 155.2MB in the beginning and 295.7MB in the end (delta: 140.5MB). Free memory was 99.3MB in the beginning and 181.9MB in the end (delta: -82.6MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2024-11-09 15:23:54,574 INFO L158 Benchmark]: Witness Printer took 6.71ms. Allocated memory is still 295.7MB. Free memory was 181.9MB in the beginning and 180.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:23:54,575 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46ms. Allocated memory is still 155.2MB. Free memory was 113.7MB in the beginning and 113.6MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.56ms. Allocated memory is still 155.2MB. Free memory was 86.2MB in the beginning and 118.2MB in the end (delta: -31.9MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.07ms. Allocated memory is still 155.2MB. Free memory was 118.2MB in the beginning and 116.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.09ms. Allocated memory is still 155.2MB. Free memory was 116.0MB in the beginning and 114.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 389.75ms. Allocated memory is still 155.2MB. Free memory was 114.0MB in the beginning and 99.8MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 14463.18ms. Allocated memory was 155.2MB in the beginning and 295.7MB in the end (delta: 140.5MB). Free memory was 99.3MB in the beginning and 181.9MB in the end (delta: -82.6MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. * Witness Printer took 6.71ms. Allocated memory is still 295.7MB. Free memory was 181.9MB in the beginning and 180.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~t!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long) -1 * i) + in_len) and consists of 4 locations. One deterministic module has affine ranking function null and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 38 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.4s and 8 iterations. TraceHistogramMax:4. Analysis of lassos took 10.9s. Construction of modules took 1.4s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 5 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, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 144 mSDsluCounter, 485 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 421 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1879 IncrementalHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 64 mSDtfsCounter, 1879 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital134 mio100 ax100 hnf100 lsp104 ukn71 mio100 lsp45 div138 bol100 ite100 ukn100 eq173 hnf91 smp85 dnf109 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 50ms VariablesStem: 4 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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! [2024-11-09 15:23:54,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-09 15:23:54,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 15:23:54,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 15:23:55,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 15:23:55,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 15:23:55,599 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