./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 32bit --witnessprinter.graph.data.programhash dd76b7822e4f01d656aa547f942373edd42b5cbb2c90dd9f0d7299ee64d98734 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:25:19,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:25:20,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:25:20,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:25:20,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:25:20,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:25:20,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:25:20,062 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:25:20,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:25:20,076 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:25:20,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:25:20,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:25:20,077 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:25:20,077 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:25:20,078 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:25:20,078 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:25:20,078 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:25:20,079 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:25:20,082 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:25:20,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:25:20,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:25:20,085 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:25:20,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:25:20,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:25:20,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:25:20,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:25:20,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:25:20,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:25:20,087 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:25:20,087 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:25:20,087 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:25:20,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:25:20,088 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:25:20,088 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:25:20,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:25:20,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:25:20,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:25:20,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:25:20,090 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:25:20,090 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-clean/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-clean/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd76b7822e4f01d656aa547f942373edd42b5cbb2c90dd9f0d7299ee64d98734 [2024-10-12 00:25:20,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:25:20,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:25:20,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:25:20,372 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:25:20,372 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:25:20,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i [2024-10-12 00:25:21,836 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:25:22,105 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:25:22,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrlen-alloca-1.i [2024-10-12 00:25:22,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2c1fa7815/e876340029f347bd92fb0f55ae7c2403/FLAGb8d4aefea [2024-10-12 00:25:22,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2c1fa7815/e876340029f347bd92fb0f55ae7c2403 [2024-10-12 00:25:22,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:25:22,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:25:22,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:25:22,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:25:22,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:25:22,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:25:22" (1/1) ... [2024-10-12 00:25:22,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a84f8b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:22, skipping insertion in model container [2024-10-12 00:25:22,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:25:22" (1/1) ... [2024-10-12 00:25:22,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:25:22,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:25:22,560 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:25:22,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:25:22,627 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:25:22,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:22 WrapperNode [2024-10-12 00:25:22,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:25:22,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:25:22,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:25:22,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:25:22,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:22" (1/1) ... [2024-10-12 00:25:22,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:22" (1/1) ... [2024-10-12 00:25:22,671 INFO L138 Inliner]: procedures = 117, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2024-10-12 00:25:22,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:25:22,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:25:22,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:25:22,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:25:22,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:22" (1/1) ... [2024-10-12 00:25:22,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:22" (1/1) ... [2024-10-12 00:25:22,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:22" (1/1) ... [2024-10-12 00:25:22,702 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 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-10-12 00:25:22,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:22" (1/1) ... [2024-10-12 00:25:22,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:22" (1/1) ... [2024-10-12 00:25:22,710 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:22" (1/1) ... [2024-10-12 00:25:22,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:22" (1/1) ... [2024-10-12 00:25:22,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:22" (1/1) ... [2024-10-12 00:25:22,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:22" (1/1) ... [2024-10-12 00:25:22,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:25:22,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:25:22,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:25:22,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:25:22,724 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:22" (1/1) ... [2024-10-12 00:25:22,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:22,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:22,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:25:22,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:25:22,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:25:22,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:25:22,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:25:22,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:25:22,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:25:22,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:25:22,929 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:25:22,932 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:25:23,029 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-12 00:25:23,029 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:25:23,039 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:25:23,039 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 00:25:23,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:25:23 BoogieIcfgContainer [2024-10-12 00:25:23,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:25:23,041 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:25:23,041 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:25:23,044 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:25:23,044 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:25:23,045 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:25:22" (1/3) ... [2024-10-12 00:25:23,045 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4abcd0b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:25:23, skipping insertion in model container [2024-10-12 00:25:23,045 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:25:23,046 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:22" (2/3) ... [2024-10-12 00:25:23,046 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4abcd0b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:25:23, skipping insertion in model container [2024-10-12 00:25:23,046 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:25:23,046 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:25:23" (3/3) ... [2024-10-12 00:25:23,047 INFO L332 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlen-alloca-1.i [2024-10-12 00:25:23,099 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:25:23,099 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:25:23,100 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:25:23,100 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:25:23,100 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:25:23,100 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:25:23,100 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:25:23,100 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:25:23,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:23,121 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-10-12 00:25:23,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:25:23,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:25:23,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:25:23,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:25:23,128 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:25:23,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:23,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-10-12 00:25:23,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:25:23,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:25:23,130 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:25:23,130 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:25:23,136 INFO L745 eck$LassoCheckResult]: Stem: 12#$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~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet6#1, main_#t~post7#1, main_~i~0#1, main_#t~ret8#1, main_~length1~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc main_#t~nondet4#1;main_~length1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9#L524true assume !(main_~length1~0#1 < 1); 14#L524-2true call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~i~0#1 := 0; 5#L528-3true [2024-10-12 00:25:23,137 INFO L747 eck$LassoCheckResult]: Loop: 5#L528-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet6#1;call write~int#0(main_#t~nondet6#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; 7#L528-2true main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 5#L528-3true [2024-10-12 00:25:23,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:23,141 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-10-12 00:25:23,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:23,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400089279] [2024-10-12 00:25:23,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:23,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:23,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:23,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:23,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:23,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2024-10-12 00:25:23,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:23,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689378713] [2024-10-12 00:25:23,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:23,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:23,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:23,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:23,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:23,310 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2024-10-12 00:25:23,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:23,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835385355] [2024-10-12 00:25:23,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:23,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:23,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:23,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:23,642 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:25:23,642 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:25:23,643 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:25:23,643 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:25:23,643 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:25:23,643 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:23,643 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:25:23,644 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:25:23,644 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlen-alloca-1.i_Iteration1_Lasso [2024-10-12 00:25:23,644 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:25:23,644 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:25:23,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:23,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:23,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:23,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:23,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:23,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:23,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:23,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:23,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:23,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:24,175 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:25:24,179 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:25:24,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:24,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:24,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:25:24,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:25:24,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-12 00:25:24,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:24,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:25:24,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:24,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:24,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:24,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:25:24,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:25:24,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:24,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:25:24,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:24,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:24,227 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:25:24,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:25:24,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-12 00:25:24,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:24,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:24,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:24,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:24,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:24,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:24,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:24,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:24,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:24,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:24,275 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:25:24,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:25:24,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-10-12 00:25:24,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:24,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:25:24,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:24,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:24,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:24,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:25:24,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:25:24,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:24,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:25:24,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:24,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:24,316 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:25:24,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:25:24,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-12 00:25:24,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:24,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:24,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:24,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:24,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:24,338 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:24,343 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:24,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:25:24,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:24,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:24,361 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:25:24,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:25:24,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-12 00:25:24,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:24,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:24,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:24,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:24,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:24,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:24,407 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:25:24,440 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-12 00:25:24,444 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-12 00:25:24,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:24,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:24,453 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:25:24,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:25:24,455 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:25:24,473 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:25:24,474 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:25:24,474 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~length1~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~length1~0#1 Supporting invariants [] [2024-10-12 00:25:24,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:25:24,500 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-10-12 00:25:24,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:24,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:25:24,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:24,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:25:24,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:25:24,619 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-10-12 00:25:24,621 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:24,656 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 34 transitions. Complement of second has 6 states. [2024-10-12 00:25:24,658 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-10-12 00:25:24,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2024-10-12 00:25:24,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-12 00:25:24,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:24,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2024-10-12 00:25:24,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:24,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-12 00:25:24,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:24,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2024-10-12 00:25:24,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:25:24,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 11 states and 14 transitions. [2024-10-12 00:25:24,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-12 00:25:24,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:25:24,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2024-10-12 00:25:24,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:25:24,672 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-10-12 00:25:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2024-10-12 00:25:24,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-12 00:25:24,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-10-12 00:25:24,692 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-10-12 00:25:24,692 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-10-12 00:25:24,692 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:25:24,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2024-10-12 00:25:24,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:25:24,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:25:24,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:25:24,694 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:25:24,694 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:25:24,694 INFO L745 eck$LassoCheckResult]: Stem: 104#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet6#1, main_#t~post7#1, main_~i~0#1, main_#t~ret8#1, main_~length1~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc main_#t~nondet4#1;main_~length1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 95#L524 assume !(main_~length1~0#1 < 1); 96#L524-2 call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~i~0#1 := 0; 100#L528-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 99#L528-4 havoc main_~i~0#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 97#L518-4 [2024-10-12 00:25:24,694 INFO L747 eck$LassoCheckResult]: Loop: 97#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 98#L518-1 assume !!(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 103#L518-3 cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset; 97#L518-4 [2024-10-12 00:25:24,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:24,696 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2024-10-12 00:25:24,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:24,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659697886] [2024-10-12 00:25:24,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:24,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:24,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:24,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:24,742 INFO L85 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 1 times [2024-10-12 00:25:24,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:24,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756256754] [2024-10-12 00:25:24,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:24,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:24,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:24,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:24,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1183925680, now seen corresponding path program 1 times [2024-10-12 00:25:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:24,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606394617] [2024-10-12 00:25:24,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:25:25,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:25:25,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606394617] [2024-10-12 00:25:25,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606394617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:25:25,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:25:25,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 00:25:25,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177387496] [2024-10-12 00:25:25,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:25:25,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:25:25,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:25:25,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:25:25,165 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:25:25,216 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2024-10-12 00:25:25,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2024-10-12 00:25:25,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:25:25,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 12 states and 14 transitions. [2024-10-12 00:25:25,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:25:25,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:25:25,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2024-10-12 00:25:25,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:25:25,219 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-10-12 00:25:25,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2024-10-12 00:25:25,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-12 00:25:25,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2024-10-12 00:25:25,221 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-10-12 00:25:25,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 00:25:25,222 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-10-12 00:25:25,223 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:25:25,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2024-10-12 00:25:25,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:25:25,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:25:25,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:25:25,224 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:25:25,224 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:25:25,224 INFO L745 eck$LassoCheckResult]: Stem: 143#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 144#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet6#1, main_#t~post7#1, main_~i~0#1, main_#t~ret8#1, main_~length1~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc main_#t~nondet4#1;main_~length1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 135#L524 assume !(main_~length1~0#1 < 1); 136#L524-2 call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~i~0#1 := 0; 140#L528-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet6#1;call write~int#0(main_#t~nondet6#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet6#1; 141#L528-2 main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 142#L528-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 139#L528-4 havoc main_~i~0#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);assume { :begin_inline_cstrlen } true;cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrlen_#res#1;havoc cstrlen_#t~mem2#1, cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset, cstrlen_~str#1.base, cstrlen_~str#1.offset, cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~str#1.base, cstrlen_~str#1.offset := cstrlen_#in~str#1.base, cstrlen_#in~str#1.offset;havoc cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~str#1.base, cstrlen_~str#1.offset; 137#L518-4 [2024-10-12 00:25:25,224 INFO L747 eck$LassoCheckResult]: Loop: 137#L518-4 call cstrlen_#t~mem2#1 := read~int#0(cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset, 1); 138#L518-1 assume !!(0 != cstrlen_#t~mem2#1);havoc cstrlen_#t~mem2#1; 145#L518-3 cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;cstrlen_~s~0#1.base, cstrlen_~s~0#1.offset := cstrlen_~s~0#1.base, 1 + cstrlen_~s~0#1.offset;havoc cstrlen_#t~pre3#1.base, cstrlen_#t~pre3#1.offset; 137#L518-4 [2024-10-12 00:25:25,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:25,225 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2024-10-12 00:25:25,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:25,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052823628] [2024-10-12 00:25:25,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:25,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:25,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:25,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:25,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:25,299 INFO L85 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 2 times [2024-10-12 00:25:25,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:25,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392259613] [2024-10-12 00:25:25,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:25,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:25,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:25:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:25,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:25,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:25,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:25,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1235379726, now seen corresponding path program 1 times [2024-10-12 00:25:25,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:25,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104080770] [2024-10-12 00:25:25,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:25,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:25,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:25,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:25,623 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:25:25,623 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:25:25,623 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:25:25,624 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:25:25,624 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:25:25,624 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:25,624 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:25:25,624 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:25:25,624 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlen-alloca-1.i_Iteration3_Lasso [2024-10-12 00:25:25,624 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:25:25,624 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:25:25,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:25,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:26,025 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:25:26,025 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:25:26,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:26,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:26,028 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:25:26,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:25:26,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-12 00:25:26,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:26,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:26,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:26,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:26,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:26,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:26,055 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:26,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:26,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:26,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:26,073 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:25:26,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:25:26,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-12 00:25:26,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:26,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:26,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:26,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:26,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:26,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:26,094 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:26,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 00:25:26,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:26,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:26,112 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:25:26,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:25:26,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-12 00:25:26,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:26,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:26,128 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:25:26,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:26,136 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-12 00:25:26,137 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-12 00:25:26,147 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:26,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:26,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:26,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:26,164 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:25:26,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:25:26,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-12 00:25:26,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:26,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:26,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:26,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:26,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:26,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:26,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:26,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 00:25:26,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:26,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:26,206 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:25:26,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:25:26,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-12 00:25:26,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:26,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:26,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:26,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:26,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:26,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:26,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:26,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 00:25:26,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:26,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:26,251 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:25:26,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:25:26,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-10-12 00:25:26,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:26,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:26,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:26,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:26,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:26,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:26,283 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:25:26,303 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-10-12 00:25:26,304 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-12 00:25:26,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:26,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:26,306 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:25:26,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:25:26,308 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:25:26,321 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:25:26,322 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:25:26,322 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlen_~s~0#1.offset, v_rep(select #length ULTIMATE.start_cstrlen_~s~0#1.base)_1) = -1*ULTIMATE.start_cstrlen_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrlen_~s~0#1.base)_1 Supporting invariants [] [2024-10-12 00:25:26,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:26,341 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-10-12 00:25:26,343 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-10-12 00:25:26,344 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:25:26,344 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:25:26,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:26,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:25:26,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:26,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:25:26,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:25:26,409 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-10-12 00:25:26,409 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-10-12 00:25:26,424 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 14 states and 17 transitions. Complement of second has 4 states. [2024-10-12 00:25:26,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:25:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-10-12 00:25:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2024-10-12 00:25:26,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2024-10-12 00:25:26,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:26,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 11 letters. Loop has 3 letters. [2024-10-12 00:25:26,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:26,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 8 letters. Loop has 6 letters. [2024-10-12 00:25:26,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:26,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2024-10-12 00:25:26,427 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:25:26,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2024-10-12 00:25:26,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:25:26,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:25:26,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:25:26,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:25:26,428 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:25:26,428 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:25:26,428 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:25:26,428 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:25:26,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:25:26,429 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:25:26,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:25:26,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:25:26 BoogieIcfgContainer [2024-10-12 00:25:26,436 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:25:26,437 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:25:26,437 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:25:26,437 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:25:26,437 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:25:23" (3/4) ... [2024-10-12 00:25:26,439 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:25:26,440 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:25:26,441 INFO L158 Benchmark]: Toolchain (without parser) took 4293.81ms. Allocated memory is still 195.0MB. Free memory was 164.5MB in the beginning and 70.7MB in the end (delta: 93.8MB). Peak memory consumption was 94.0MB. Max. memory is 16.1GB. [2024-10-12 00:25:26,441 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 99.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:25:26,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.24ms. Allocated memory is still 195.0MB. Free memory was 164.3MB in the beginning and 149.8MB in the end (delta: 14.5MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-10-12 00:25:26,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.23ms. Allocated memory is still 195.0MB. Free memory was 149.8MB in the beginning and 147.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:25:26,442 INFO L158 Benchmark]: Boogie Preprocessor took 45.55ms. Allocated memory is still 195.0MB. Free memory was 147.7MB in the beginning and 145.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:25:26,443 INFO L158 Benchmark]: RCFGBuilder took 317.35ms. Allocated memory is still 195.0MB. Free memory was 145.6MB in the beginning and 134.2MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 00:25:26,443 INFO L158 Benchmark]: BuchiAutomizer took 3395.45ms. Allocated memory is still 195.0MB. Free memory was 134.2MB in the beginning and 70.7MB in the end (delta: 63.6MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2024-10-12 00:25:26,443 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 195.0MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:25:26,445 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.16ms. Allocated memory is still 134.2MB. Free memory is still 99.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 480.24ms. Allocated memory is still 195.0MB. Free memory was 164.3MB in the beginning and 149.8MB in the end (delta: 14.5MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.23ms. Allocated memory is still 195.0MB. Free memory was 149.8MB in the beginning and 147.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.55ms. Allocated memory is still 195.0MB. Free memory was 147.7MB in the beginning and 145.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 317.35ms. Allocated memory is still 195.0MB. Free memory was 145.6MB in the beginning and 134.2MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 3395.45ms. Allocated memory is still 195.0MB. Free memory was 134.2MB in the beginning and 70.7MB in the end (delta: 63.6MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 195.0MB. Free memory is still 70.7MB. 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: ~s~0!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 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (length1 + ((long long) -1 * i)) and consists of 4 locations. One deterministic module has affine ranking function null and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 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: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 21 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital93 mio100 ax119 hnf100 lsp82 ukn86 mio100 lsp47 div138 bol100 ite100 ukn100 eq169 hnf91 smp85 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 2 VariablesLoop: 1 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-10-12 00:25:26,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:25:26,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE