./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_cstrpbrk-alloca-2.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_cstrpbrk-alloca-2.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 d450427152972d80716d02c80706dd3b248a3fc7c05c71ffd29d66e32e1e82f2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:25:30,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:25:30,771 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:30,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:25:30,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:25:30,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:25:30,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:25:30,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:25:30,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:25:30,817 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:25:30,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:25:30,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:25:30,819 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:25:30,821 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:25:30,821 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:25:30,821 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:25:30,821 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:25:30,822 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:25:30,822 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:25:30,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:25:30,826 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:25:30,826 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:25:30,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:25:30,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:25:30,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:25:30,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:25:30,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:25:30,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:25:30,828 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:25:30,828 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:25:30,828 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:25:30,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:25:30,829 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:25:30,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:25:30,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:25:30,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:25:30,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:25:30,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:25:30,831 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:25:30,831 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 -> d450427152972d80716d02c80706dd3b248a3fc7c05c71ffd29d66e32e1e82f2 [2024-10-12 00:25:31,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:25:31,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:25:31,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:25:31,148 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:25:31,149 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:25:31,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.i [2024-10-12 00:25:32,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:25:32,796 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:25:32,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrpbrk-alloca-2.i [2024-10-12 00:25:32,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/47a493d44/c824598cb70844ecbaf10aad6c7ffe47/FLAG5ac4a2882 [2024-10-12 00:25:32,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/47a493d44/c824598cb70844ecbaf10aad6c7ffe47 [2024-10-12 00:25:32,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:25:32,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:25:32,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:25:32,835 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:25:32,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:25:32,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:25:32" (1/1) ... [2024-10-12 00:25:32,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7877bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:32, skipping insertion in model container [2024-10-12 00:25:32,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:25:32" (1/1) ... [2024-10-12 00:25:32,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:25:33,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:25:33,203 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:25:33,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:25:33,288 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:25:33,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:33 WrapperNode [2024-10-12 00:25:33,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:25:33,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:25:33,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:25:33,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:25:33,297 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:33" (1/1) ... [2024-10-12 00:25:33,314 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:33" (1/1) ... [2024-10-12 00:25:33,337 INFO L138 Inliner]: procedures = 117, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2024-10-12 00:25:33,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:25:33,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:25:33,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:25:33,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:25:33,350 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:33" (1/1) ... [2024-10-12 00:25:33,351 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:33" (1/1) ... [2024-10-12 00:25:33,353 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:33" (1/1) ... [2024-10-12 00:25:33,371 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [3, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2024-10-12 00:25:33,376 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:33" (1/1) ... [2024-10-12 00:25:33,376 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:33" (1/1) ... [2024-10-12 00:25:33,384 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:33" (1/1) ... [2024-10-12 00:25:33,387 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:33" (1/1) ... [2024-10-12 00:25:33,389 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:33" (1/1) ... [2024-10-12 00:25:33,390 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:33" (1/1) ... [2024-10-12 00:25:33,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:25:33,393 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:25:33,393 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:25:33,393 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:25:33,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:33" (1/1) ... [2024-10-12 00:25:33,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:33,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:33,429 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:33,432 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:33,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:25:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:25:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:25:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:25:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:25:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:25:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:25:33,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:25:33,628 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:25:33,630 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:25:33,764 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-10-12 00:25:33,765 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:25:33,776 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:25:33,776 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 00:25:33,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:25:33 BoogieIcfgContainer [2024-10-12 00:25:33,777 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:25:33,778 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:25:33,778 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:25:33,781 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:25:33,782 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:25:33,782 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:25:32" (1/3) ... [2024-10-12 00:25:33,783 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b01489b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:25:33, skipping insertion in model container [2024-10-12 00:25:33,783 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:25:33,784 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:25:33" (2/3) ... [2024-10-12 00:25:33,784 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b01489b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:25:33, skipping insertion in model container [2024-10-12 00:25:33,785 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:25:33,785 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:25:33" (3/3) ... [2024-10-12 00:25:33,786 INFO L332 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca-2.i [2024-10-12 00:25:33,842 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:25:33,843 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:25:33,843 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:25:33,843 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:25:33,843 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:25:33,843 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:25:33,843 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:25:33,844 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:25:33,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:33,864 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-12 00:25:33,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:25:33,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:25:33,871 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:25:33,871 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:25:33,871 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:25:33,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:33,875 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-12 00:25:33,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:25:33,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:25:33,875 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-12 00:25:33,877 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:25:33,884 INFO L745 eck$LassoCheckResult]: Stem: 14#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 11#L528true assume !(main_~length1~0#1 < 1); 5#L528-2true assume !(main_~length2~0#1 < 1); 12#L531-1true call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 4#L537-3true [2024-10-12 00:25:33,884 INFO L747 eck$LassoCheckResult]: Loop: 4#L537-3true assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 15#L537-2true main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 4#L537-3true [2024-10-12 00:25:33,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:33,895 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2024-10-12 00:25:33,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:33,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207446872] [2024-10-12 00:25:33,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:33,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:34,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:34,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:34,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:34,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2024-10-12 00:25:34,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:34,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416712927] [2024-10-12 00:25:34,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:34,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:34,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:34,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:34,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:34,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2024-10-12 00:25:34,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:34,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284557832] [2024-10-12 00:25:34,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:34,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:34,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:34,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:34,635 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:25:34,636 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:25:34,636 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:25:34,637 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:25:34,637 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:25:34,637 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:34,637 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:25:34,637 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:25:34,637 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration1_Lasso [2024-10-12 00:25:34,638 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:25:34,638 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:25:34,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:34,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:34,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:34,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:34,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:34,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:34,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:34,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:34,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:34,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:34,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:34,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:34,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:34,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:34,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:34,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:34,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:35,377 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:25:35,381 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:25:35,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:35,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:35,385 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:35,387 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:35,388 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:35,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:35,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:25:35,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:35,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:35,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:35,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:25:35,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:25:35,411 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:35,426 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:35,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:35,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:35,429 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:35,431 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:35,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:25:35,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:35,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:25:35,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:35,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:35,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:35,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:25:35,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:25:35,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:35,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:25:35,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:35,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:35,468 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:35,470 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:35,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:25:35,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:35,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:25:35,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:35,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:35,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:35,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:25:35,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:25:35,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:35,499 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:35,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:35,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:35,502 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:35,503 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:35,504 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:35,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:35,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:35,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:35,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:35,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:35,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:35,538 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:25:35,575 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-10-12 00:25:35,576 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-10-12 00:25:35,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:35,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:35,758 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:35,760 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:35,761 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:25:35,778 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:25:35,778 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:25:35,779 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:35,790 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:35,806 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-10-12 00:25:35,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:35,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:25:35,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:35,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:25:35,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:35,900 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:35,936 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:35,938 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:35,991 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 37 states and 56 transitions. Complement of second has 6 states. [2024-10-12 00:25:35,994 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:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2024-10-12 00:25:36,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2024-10-12 00:25:36,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:36,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 7 letters. Loop has 2 letters. [2024-10-12 00:25:36,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:36,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 5 letters. Loop has 4 letters. [2024-10-12 00:25:36,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:36,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 56 transitions. [2024-10-12 00:25:36,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-12 00:25:36,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 17 states and 25 transitions. [2024-10-12 00:25:36,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-12 00:25:36,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-10-12 00:25:36,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2024-10-12 00:25:36,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:25:36,016 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 25 transitions. [2024-10-12 00:25:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2024-10-12 00:25:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-12 00:25:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2024-10-12 00:25:36,042 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 25 transitions. [2024-10-12 00:25:36,042 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2024-10-12 00:25:36,042 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:25:36,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2024-10-12 00:25:36,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-12 00:25:36,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:25:36,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:25:36,044 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:25:36,044 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:25:36,045 INFO L745 eck$LassoCheckResult]: Stem: 141#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 134#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 135#L528 assume !(main_~length1~0#1 < 1); 132#L528-2 assume !(main_~length2~0#1 < 1); 133#L531-1 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 129#L537-3 assume !(main_~i~0#1 < main_~length1~0#1); 127#L537-4 havoc main_~i~0#1;main_~i~1#1 := 0; 128#L541-3 [2024-10-12 00:25:36,045 INFO L747 eck$LassoCheckResult]: Loop: 128#L541-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1; 142#L541-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 128#L541-3 [2024-10-12 00:25:36,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:36,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2024-10-12 00:25:36,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:36,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128395313] [2024-10-12 00:25:36,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:36,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:36,174 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:36,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:25:36,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128395313] [2024-10-12 00:25:36,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128395313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:25:36,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:25:36,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:25:36,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131162219] [2024-10-12 00:25:36,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:25:36,180 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:25:36,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:36,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2024-10-12 00:25:36,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:36,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621918007] [2024-10-12 00:25:36,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:36,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:36,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:36,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:36,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:25:36,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:25:36,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:25:36,260 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:36,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:25:36,292 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-10-12 00:25:36,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2024-10-12 00:25:36,293 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-12 00:25:36,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2024-10-12 00:25:36,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-12 00:25:36,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-10-12 00:25:36,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2024-10-12 00:25:36,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:25:36,294 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-10-12 00:25:36,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2024-10-12 00:25:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-10-12 00:25:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-10-12 00:25:36,296 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-10-12 00:25:36,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:25:36,298 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-10-12 00:25:36,298 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:25:36,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2024-10-12 00:25:36,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2024-10-12 00:25:36,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:25:36,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:25:36,300 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:25:36,300 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:25:36,301 INFO L745 eck$LassoCheckResult]: Stem: 183#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 176#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 177#L528 assume !(main_~length1~0#1 < 1); 174#L528-2 assume !(main_~length2~0#1 < 1); 175#L531-1 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 171#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 172#L537-2 main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 173#L537-3 assume !(main_~i~0#1 < main_~length1~0#1); 169#L537-4 havoc main_~i~0#1;main_~i~1#1 := 0; 170#L541-3 [2024-10-12 00:25:36,301 INFO L747 eck$LassoCheckResult]: Loop: 170#L541-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1; 184#L541-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 170#L541-3 [2024-10-12 00:25:36,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:36,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2024-10-12 00:25:36,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:36,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833711193] [2024-10-12 00:25:36,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:36,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:36,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:36,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:36,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2024-10-12 00:25:36,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:36,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102888189] [2024-10-12 00:25:36,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:36,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:36,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:36,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:36,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:36,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2024-10-12 00:25:36,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:36,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575398222] [2024-10-12 00:25:36,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:36,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:36,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:36,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:36,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:36,791 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:25:36,792 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:25:36,792 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:25:36,792 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:25:36,792 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:25:36,793 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:36,793 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:25:36,793 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:25:36,793 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration3_Lasso [2024-10-12 00:25:36,793 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:25:36,793 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:25:36,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:36,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:36,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:36,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:36,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:36,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:36,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:36,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:36,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:36,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:36,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:36,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:36,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:36,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:36,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:36,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:36,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:37,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:37,266 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:25:37,267 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:25:37,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:37,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:37,270 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:37,272 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:37,273 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:37,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:37,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:25:37,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:37,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:37,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:37,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:25:37,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:25:37,292 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:37,308 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:37,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:37,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:37,312 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:37,314 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:37,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:25:37,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:37,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:37,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:37,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:37,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:37,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:37,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:37,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:25:37,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:37,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:37,367 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:37,369 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:37,370 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:37,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:37,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:25:37,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:37,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:37,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:37,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:25:37,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:25:37,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:37,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:37,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:37,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:37,406 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:37,407 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:37,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:25:37,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:37,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:37,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:37,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:37,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:37,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:37,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:37,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:25:37,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:37,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:37,448 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:37,450 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:37,451 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:37,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:37,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:37,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:37,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:37,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:37,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:37,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:37,491 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:37,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:37,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:37,494 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:37,496 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:37,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:25:37,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:37,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:37,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:37,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:37,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:37,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:37,530 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:25:37,544 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-12 00:25:37,544 INFO L444 ModelExtractionUtils]: 11 out of 19 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-12 00:25:37,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:37,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:37,551 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:37,553 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:37,554 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:25:37,568 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:25:37,568 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:25:37,568 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~length2~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~length2~0#1 Supporting invariants [] [2024-10-12 00:25:37,585 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:37,598 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-10-12 00:25:37,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:37,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:25:37,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:37,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:25:37,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:37,673 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:37,673 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:37,674 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8 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:37,699 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 22 transitions. cyclomatic complexity: 8. 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 19 states and 26 transitions. Complement of second has 5 states. [2024-10-12 00:25:37,700 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:37,701 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:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-12 00:25:37,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2024-10-12 00:25:37,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:37,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2024-10-12 00:25:37,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:37,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-12 00:25:37,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:37,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2024-10-12 00:25:37,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:25:37,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 24 transitions. [2024-10-12 00:25:37,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-12 00:25:37,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-12 00:25:37,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2024-10-12 00:25:37,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:25:37,705 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-10-12 00:25:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2024-10-12 00:25:37,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-12 00:25:37,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-10-12 00:25:37,707 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-10-12 00:25:37,707 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-10-12 00:25:37,707 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:25:37,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2024-10-12 00:25:37,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:25:37,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:25:37,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:25:37,708 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:25:37,709 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:25:37,710 INFO L745 eck$LassoCheckResult]: Stem: 296#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 289#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 290#L528 assume !(main_~length1~0#1 < 1); 287#L528-2 assume !(main_~length2~0#1 < 1); 288#L531-1 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 284#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 285#L537-2 main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 286#L537-3 assume !(main_~i~0#1 < main_~length1~0#1); 282#L537-4 havoc main_~i~0#1;main_~i~1#1 := 0; 283#L541-3 assume !(main_~i~1#1 < main_~length2~0#1); 291#L541-4 havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset, cstrpbrk_~c~0#1, cstrpbrk_~sc~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;havoc cstrpbrk_~c~0#1;havoc cstrpbrk_~sc~0#1; 292#L519-4 [2024-10-12 00:25:37,710 INFO L747 eck$LassoCheckResult]: Loop: 292#L519-4 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1; 299#L518-1 assume !!(0 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset; 294#L519-3 cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1; 295#L519-1 assume !(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1; 292#L519-4 [2024-10-12 00:25:37,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:37,710 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2024-10-12 00:25:37,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:37,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3908727] [2024-10-12 00:25:37,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:37,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:37,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:25:37,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:25:37,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3908727] [2024-10-12 00:25:37,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3908727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:25:37,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:25:37,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:25:37,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55010855] [2024-10-12 00:25:37,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:25:37,776 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:25:37,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:37,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2406249, now seen corresponding path program 1 times [2024-10-12 00:25:37,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:37,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617711398] [2024-10-12 00:25:37,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:37,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:37,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:37,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:37,899 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:37,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:25:37,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:25:37,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:25:37,959 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:37,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:25:37,982 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2024-10-12 00:25:37,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2024-10-12 00:25:37,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:25:37,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 24 transitions. [2024-10-12 00:25:37,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-12 00:25:37,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-12 00:25:37,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2024-10-12 00:25:37,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:25:37,983 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-10-12 00:25:37,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2024-10-12 00:25:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-10-12 00:25:37,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2024-10-12 00:25:37,985 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-10-12 00:25:37,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:25:37,986 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-10-12 00:25:37,986 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:25:37,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2024-10-12 00:25:37,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:25:37,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:25:37,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:25:37,988 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:25:37,988 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:25:37,988 INFO L745 eck$LassoCheckResult]: Stem: 340#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 333#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 334#L528 assume !(main_~length1~0#1 < 1); 331#L528-2 assume !(main_~length2~0#1 < 1); 332#L531-1 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 328#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 329#L537-2 main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 330#L537-3 assume !(main_~i~0#1 < main_~length1~0#1); 326#L537-4 havoc main_~i~0#1;main_~i~1#1 := 0; 327#L541-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1; 341#L541-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 342#L541-3 assume !(main_~i~1#1 < main_~length2~0#1); 337#L541-4 havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset, cstrpbrk_~c~0#1, cstrpbrk_~sc~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;havoc cstrpbrk_~c~0#1;havoc cstrpbrk_~sc~0#1; 338#L519-4 [2024-10-12 00:25:37,988 INFO L747 eck$LassoCheckResult]: Loop: 338#L519-4 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1; 343#L518-1 assume !!(0 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset; 336#L519-3 cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1; 339#L519-1 assume !(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1; 338#L519-4 [2024-10-12 00:25:37,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:37,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2024-10-12 00:25:37,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:37,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121083882] [2024-10-12 00:25:37,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:37,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:38,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:38,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:38,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:38,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2406249, now seen corresponding path program 2 times [2024-10-12 00:25:38,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:38,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630709558] [2024-10-12 00:25:38,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:38,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:38,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:38,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:38,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:38,046 INFO L85 PathProgramCache]: Analyzing trace with hash -796589374, now seen corresponding path program 1 times [2024-10-12 00:25:38,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:38,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230782905] [2024-10-12 00:25:38,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:38,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:38,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:25:38,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:25:38,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230782905] [2024-10-12 00:25:38,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230782905] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:25:38,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574470448] [2024-10-12 00:25:38,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:38,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:25:38,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:38,366 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:25:38,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-12 00:25:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:38,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-12 00:25:38,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:38,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 00:25:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:25:38,535 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:25:38,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-12 00:25:38,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-10-12 00:25:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 00:25:38,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574470448] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:25:38,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:25:38,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-10-12 00:25:38,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114109327] [2024-10-12 00:25:38,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:25:38,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:25:38,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 00:25:38,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-12 00:25:38,726 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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:38,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:25:38,850 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-10-12 00:25:38,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 41 transitions. [2024-10-12 00:25:38,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:25:38,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 25 transitions. [2024-10-12 00:25:38,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-12 00:25:38,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-12 00:25:38,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2024-10-12 00:25:38,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:25:38,853 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-12 00:25:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2024-10-12 00:25:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-10-12 00:25:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 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:38,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-12 00:25:38,855 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-12 00:25:38,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:25:38,855 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-12 00:25:38,856 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:25:38,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2024-10-12 00:25:38,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-12 00:25:38,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:25:38,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:25:38,857 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:25:38,857 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:25:38,857 INFO L745 eck$LassoCheckResult]: Stem: 514#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 507#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 508#L528 assume !(main_~length1~0#1 < 1); 505#L528-2 assume !(main_~length2~0#1 < 1); 506#L531-1 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 501#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 502#L537-2 main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 503#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 504#L537-2 main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 518#L537-3 assume !(main_~i~0#1 < main_~length1~0#1); 499#L537-4 havoc main_~i~0#1;main_~i~1#1 := 0; 500#L541-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1; 515#L541-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 516#L541-3 assume !(main_~i~1#1 < main_~length2~0#1); 509#L541-4 havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset, cstrpbrk_~c~0#1, cstrpbrk_~sc~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;havoc cstrpbrk_~c~0#1;havoc cstrpbrk_~sc~0#1; 510#L519-4 [2024-10-12 00:25:38,857 INFO L747 eck$LassoCheckResult]: Loop: 510#L519-4 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1; 517#L518-1 assume !!(0 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset; 512#L519-3 cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1; 513#L519-1 assume !(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1; 510#L519-4 [2024-10-12 00:25:38,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:38,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1523394364, now seen corresponding path program 2 times [2024-10-12 00:25:38,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:38,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854086691] [2024-10-12 00:25:38,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:38,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:38,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:38,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:38,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:38,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2406249, now seen corresponding path program 3 times [2024-10-12 00:25:38,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:38,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508992913] [2024-10-12 00:25:38,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:38,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:38,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:38,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:38,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:38,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1430636836, now seen corresponding path program 2 times [2024-10-12 00:25:38,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:38,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880613890] [2024-10-12 00:25:38,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:38,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:38,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:38,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:39,809 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:25:39,809 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:25:39,810 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:25:39,810 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:25:39,810 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:25:39,810 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:39,810 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:25:39,810 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:25:39,810 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration6_Lasso [2024-10-12 00:25:39,810 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:25:39,810 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:25:39,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:39,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:39,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:39,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:39,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:39,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:40,506 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:25:40,506 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:25:40,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:40,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:40,514 INFO L229 MonitoredProcess]: Starting monitored process 15 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:40,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:25:40,516 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:40,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:40,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:25:40,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:40,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:40,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:40,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:25:40,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:25:40,532 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:40,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 00:25:40,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:40,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:40,545 INFO L229 MonitoredProcess]: Starting monitored process 16 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:40,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:25:40,547 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:40,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:40,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:25:40,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:40,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:40,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:40,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:25:40,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:25:40,559 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:40,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-12 00:25:40,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:40,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:40,571 INFO L229 MonitoredProcess]: Starting monitored process 17 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:40,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:25:40,573 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:40,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:40,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:25:40,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:40,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:40,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:40,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:25:40,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:25:40,585 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:40,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:25:40,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:40,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:40,597 INFO L229 MonitoredProcess]: Starting monitored process 18 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:40,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:25:40,600 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:40,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:40,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:25:40,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:40,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:40,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:40,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:25:40,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:25:40,613 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:40,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:40,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:40,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:40,625 INFO L229 MonitoredProcess]: Starting monitored process 19 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:40,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:25:40,627 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:40,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:40,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:25:40,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:40,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:40,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:40,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:25:40,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:25:40,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:40,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:40,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:40,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:40,652 INFO L229 MonitoredProcess]: Starting monitored process 20 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:40,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:25:40,655 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:40,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:40,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:40,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:40,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:40,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:40,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:40,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:40,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:40,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:40,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:40,695 INFO L229 MonitoredProcess]: Starting monitored process 21 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:40,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:25:40,697 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:40,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:40,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:40,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:40,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:40,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:40,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:40,714 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:40,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:40,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:40,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:40,728 INFO L229 MonitoredProcess]: Starting monitored process 22 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:40,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:25:40,730 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:40,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:40,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:40,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:40,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:40,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:40,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:40,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:40,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:40,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:40,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:40,757 INFO L229 MonitoredProcess]: Starting monitored process 23 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:40,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:25:40,759 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:40,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:40,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:40,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:40,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:40,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:40,771 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:40,775 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:40,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:40,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:40,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:40,790 INFO L229 MonitoredProcess]: Starting monitored process 24 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:40,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:25:40,793 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:40,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:40,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:40,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:40,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:40,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:40,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:40,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:40,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:40,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:40,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:40,821 INFO L229 MonitoredProcess]: Starting monitored process 25 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:40,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:25:40,823 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:40,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:40,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:40,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:40,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:40,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:40,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:40,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:40,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:40,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:40,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:40,856 INFO L229 MonitoredProcess]: Starting monitored process 26 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:40,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:25:40,858 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:40,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:40,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:25:40,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:40,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:40,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:40,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:25:40,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:25:40,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:40,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-10-12 00:25:40,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:40,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:40,893 INFO L229 MonitoredProcess]: Starting monitored process 27 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:40,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:25:40,895 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:40,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:40,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:40,909 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:25:40,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:40,919 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-12 00:25:40,919 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-12 00:25:40,934 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:40,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:40,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:40,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:40,951 INFO L229 MonitoredProcess]: Starting monitored process 28 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:40,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:25:40,954 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:40,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:40,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:40,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:40,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:40,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:40,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:40,980 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:40,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:40,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:40,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:40,998 INFO L229 MonitoredProcess]: Starting monitored process 29 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:41,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:25:41,002 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:41,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:41,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:41,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:41,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:41,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:41,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:41,026 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:25:41,042 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-10-12 00:25:41,042 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-12 00:25:41,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:41,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:41,045 INFO L229 MonitoredProcess]: Starting monitored process 30 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:41,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:25:41,047 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:25:41,058 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:25:41,059 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:25:41,059 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s1#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_3) = -1*ULTIMATE.start_cstrpbrk_~s1#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_3 Supporting invariants [] [2024-10-12 00:25:41,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:41,110 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2024-10-12 00:25:41,113 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s1!offset [2024-10-12 00:25:41,114 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:25:41,114 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:25:41,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-12 00:25:41,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:41,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:25:41,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:41,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:25:41,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:41,280 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:41,281 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-12 00:25:41,281 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:41,317 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 31 transitions. Complement of second has 5 states. [2024-10-12 00:25:41,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:25:41,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2024-10-12 00:25:41,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2024-10-12 00:25:41,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:41,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 4 letters. [2024-10-12 00:25:41,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:41,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 8 letters. [2024-10-12 00:25:41,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:41,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2024-10-12 00:25:41,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:25:41,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 30 transitions. [2024-10-12 00:25:41,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-12 00:25:41,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-12 00:25:41,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2024-10-12 00:25:41,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:25:41,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-10-12 00:25:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2024-10-12 00:25:41,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-10-12 00:25:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-10-12 00:25:41,325 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-10-12 00:25:41,325 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-10-12 00:25:41,326 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:25:41,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2024-10-12 00:25:41,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:25:41,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:25:41,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:25:41,327 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:25:41,327 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:25:41,327 INFO L745 eck$LassoCheckResult]: Stem: 691#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 681#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 682#L528 assume !(main_~length1~0#1 < 1); 679#L528-2 assume !(main_~length2~0#1 < 1); 680#L531-1 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 675#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 676#L537-2 main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 677#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 678#L537-2 main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 696#L537-3 assume !(main_~i~0#1 < main_~length1~0#1); 673#L537-4 havoc main_~i~0#1;main_~i~1#1 := 0; 674#L541-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1; 692#L541-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 693#L541-3 assume !(main_~i~1#1 < main_~length2~0#1); 683#L541-4 havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset, cstrpbrk_~c~0#1, cstrpbrk_~sc~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;havoc cstrpbrk_~c~0#1;havoc cstrpbrk_~sc~0#1; 684#L519-4 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1; 694#L518-1 assume !!(0 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset; 686#L519-3 [2024-10-12 00:25:41,328 INFO L747 eck$LassoCheckResult]: Loop: 686#L519-3 cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1; 689#L519-1 assume !!(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1; 685#L520 assume !(cstrpbrk_~sc~0#1 == cstrpbrk_~c~0#1); 686#L519-3 [2024-10-12 00:25:41,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:41,328 INFO L85 PathProgramCache]: Analyzing trace with hash -601862591, now seen corresponding path program 1 times [2024-10-12 00:25:41,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:41,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154780350] [2024-10-12 00:25:41,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:41,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:41,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:41,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:41,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:41,361 INFO L85 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 1 times [2024-10-12 00:25:41,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:41,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739360510] [2024-10-12 00:25:41,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:41,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:41,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:41,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:41,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:41,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1400069085, now seen corresponding path program 1 times [2024-10-12 00:25:41,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:41,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463333203] [2024-10-12 00:25:41,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:41,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 00:25:41,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:25:41,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463333203] [2024-10-12 00:25:41,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463333203] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:25:41,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629730783] [2024-10-12 00:25:41,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:41,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:25:41,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:41,637 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:25:41,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-10-12 00:25:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:41,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-12 00:25:41,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:41,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 00:25:41,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 00:25:41,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:25:41,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-12 00:25:41,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-10-12 00:25:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 00:25:41,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629730783] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:25:41,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:25:41,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2024-10-12 00:25:41,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626337909] [2024-10-12 00:25:41,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:25:41,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:25:41,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 00:25:41,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-10-12 00:25:41,945 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 9 Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:42,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:25:42,116 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-10-12 00:25:42,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 53 transitions. [2024-10-12 00:25:42,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:25:42,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 27 states and 31 transitions. [2024-10-12 00:25:42,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-12 00:25:42,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-12 00:25:42,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2024-10-12 00:25:42,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:25:42,118 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-12 00:25:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2024-10-12 00:25:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-10-12 00:25:42,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 states have internal predecessors, (30), 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:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-10-12 00:25:42,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-10-12 00:25:42,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 00:25:42,121 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-10-12 00:25:42,121 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:25:42,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2024-10-12 00:25:42,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:25:42,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:25:42,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:25:42,122 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:25:42,122 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:25:42,123 INFO L745 eck$LassoCheckResult]: Stem: 908#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 898#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 899#L528 assume !(main_~length1~0#1 < 1); 896#L528-2 assume !(main_~length2~0#1 < 1); 897#L531-1 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 892#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 893#L537-2 main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 894#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 895#L537-2 main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 915#L537-3 assume !(main_~i~0#1 < main_~length1~0#1); 890#L537-4 havoc main_~i~0#1;main_~i~1#1 := 0; 891#L541-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1; 909#L541-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 910#L541-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1; 911#L541-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 914#L541-3 assume !(main_~i~1#1 < main_~length2~0#1); 900#L541-4 havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset, cstrpbrk_~c~0#1, cstrpbrk_~sc~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;havoc cstrpbrk_~c~0#1;havoc cstrpbrk_~sc~0#1; 901#L519-4 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1; 912#L518-1 assume !!(0 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset; 903#L519-3 [2024-10-12 00:25:42,123 INFO L747 eck$LassoCheckResult]: Loop: 903#L519-3 cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1; 906#L519-1 assume !!(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1; 902#L520 assume !(cstrpbrk_~sc~0#1 == cstrpbrk_~c~0#1); 903#L519-3 [2024-10-12 00:25:42,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:42,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1483803875, now seen corresponding path program 2 times [2024-10-12 00:25:42,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:42,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668479844] [2024-10-12 00:25:42,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:42,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:42,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:42,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:42,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:42,152 INFO L85 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 2 times [2024-10-12 00:25:42,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:42,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251909954] [2024-10-12 00:25:42,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:42,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:42,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:42,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:42,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:42,162 INFO L85 PathProgramCache]: Analyzing trace with hash 197886459, now seen corresponding path program 2 times [2024-10-12 00:25:42,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:42,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304061760] [2024-10-12 00:25:42,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:42,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:42,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:42,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:44,300 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:25:44,300 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:25:44,300 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:25:44,300 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:25:44,300 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:25:44,300 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:44,300 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:25:44,300 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:25:44,300 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration8_Lasso [2024-10-12 00:25:44,300 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:25:44,300 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:25:44,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:44,916 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:25:44,919 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:25:44,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:44,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:44,921 INFO L229 MonitoredProcess]: Starting monitored process 32 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:44,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:25:44,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:25:44,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:44,938 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-12 00:25:44,938 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2024-10-12 00:25:44,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:44,960 INFO L401 nArgumentSynthesizer]: We have 56 Motzkin's Theorem applications. [2024-10-12 00:25:44,960 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2024-10-12 00:25:45,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:45,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:45,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:45,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:45,023 INFO L229 MonitoredProcess]: Starting monitored process 33 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:45,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-12 00:25:45,025 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:45,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:45,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:45,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:45,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:45,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:45,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:45,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:45,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-12 00:25:45,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:45,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:45,067 INFO L229 MonitoredProcess]: Starting monitored process 34 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:45,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-12 00:25:45,069 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:45,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:45,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:45,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:45,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:45,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:45,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:45,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:45,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-12 00:25:45,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:45,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:45,104 INFO L229 MonitoredProcess]: Starting monitored process 35 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:45,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-12 00:25:45,106 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:45,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:45,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:45,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:45,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:45,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:45,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:45,126 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:45,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:45,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:45,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:45,144 INFO L229 MonitoredProcess]: Starting monitored process 36 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:45,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-12 00:25:45,146 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:45,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:45,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:45,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:45,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:45,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:45,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:45,166 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:45,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:45,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:45,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:45,183 INFO L229 MonitoredProcess]: Starting monitored process 37 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:45,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-12 00:25:45,185 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:45,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:45,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:45,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:45,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:45,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:45,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:45,211 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:25:45,232 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-10-12 00:25:45,233 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-10-12 00:25:45,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:45,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:45,235 INFO L229 MonitoredProcess]: Starting monitored process 38 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:45,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-12 00:25:45,237 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:25:45,251 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:25:45,251 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:25:45,252 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_4, ULTIMATE.start_cstrpbrk_~scanp~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_4 - 1*ULTIMATE.start_cstrpbrk_~scanp~0#1.offset Supporting invariants [] [2024-10-12 00:25:45,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:45,318 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2024-10-12 00:25:45,321 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~scanp~0!offset [2024-10-12 00:25:45,321 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:25:45,321 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:25:45,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-12 00:25:45,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:45,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:25:45,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:45,447 WARN L253 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:25:45,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:45,483 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:45,484 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-12 00:25:45,484 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:45,522 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 50 transitions. Complement of second has 7 states. [2024-10-12 00:25:45,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:25:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2024-10-12 00:25:45,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 19 letters. Loop has 3 letters. [2024-10-12 00:25:45,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:45,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 22 letters. Loop has 3 letters. [2024-10-12 00:25:45,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:45,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 19 letters. Loop has 6 letters. [2024-10-12 00:25:45,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:45,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2024-10-12 00:25:45,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:25:45,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 33 states and 39 transitions. [2024-10-12 00:25:45,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-12 00:25:45,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-12 00:25:45,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2024-10-12 00:25:45,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:25:45,532 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-12 00:25:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2024-10-12 00:25:45,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2024-10-12 00:25:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-12 00:25:45,534 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-12 00:25:45,534 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-12 00:25:45,534 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:25:45,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2024-10-12 00:25:45,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:25:45,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:25:45,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:25:45,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:25:45,535 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:25:45,535 INFO L745 eck$LassoCheckResult]: Stem: 1102#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1092#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1093#L528 assume !(main_~length1~0#1 < 1); 1090#L528-2 assume !(main_~length2~0#1 < 1); 1091#L531-1 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 1086#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 1087#L537-2 main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1088#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 1089#L537-2 main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1109#L537-3 assume !(main_~i~0#1 < main_~length1~0#1); 1084#L537-4 havoc main_~i~0#1;main_~i~1#1 := 0; 1085#L541-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1; 1103#L541-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 1104#L541-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1; 1105#L541-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 1110#L541-3 assume !(main_~i~1#1 < main_~length2~0#1); 1094#L541-4 havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset, cstrpbrk_~c~0#1, cstrpbrk_~sc~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;havoc cstrpbrk_~c~0#1;havoc cstrpbrk_~sc~0#1; 1095#L519-4 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1; 1106#L518-1 assume !!(0 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset; 1099#L519-3 cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1; 1101#L519-1 assume !(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1; 1107#L519-4 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1; 1108#L518-1 assume !!(0 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset; 1097#L519-3 [2024-10-12 00:25:45,535 INFO L747 eck$LassoCheckResult]: Loop: 1097#L519-3 cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1; 1100#L519-1 assume !!(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1; 1096#L520 assume !(cstrpbrk_~sc~0#1 == cstrpbrk_~c~0#1); 1097#L519-3 [2024-10-12 00:25:45,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1839510475, now seen corresponding path program 3 times [2024-10-12 00:25:45,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:45,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81898220] [2024-10-12 00:25:45,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:45,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 00:25:46,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:25:46,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81898220] [2024-10-12 00:25:46,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81898220] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:25:46,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101089006] [2024-10-12 00:25:46,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:25:46,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:25:46,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:46,026 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:25:46,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-10-12 00:25:46,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-12 00:25:46,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:25:46,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-12 00:25:46,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:46,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-12 00:25:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 00:25:46,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:25:46,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-12 00:25:46,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-12 00:25:46,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 00:25:46,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101089006] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:25:46,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:25:46,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-10-12 00:25:46,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959597433] [2024-10-12 00:25:46,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:25:46,335 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:25:46,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:46,335 INFO L85 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 3 times [2024-10-12 00:25:46,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:46,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771151099] [2024-10-12 00:25:46,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:46,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:46,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:46,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:46,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:25:46,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 00:25:46,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-10-12 00:25:46,405 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 8 Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:25:46,556 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-10-12 00:25:46,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 50 transitions. [2024-10-12 00:25:46,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:25:46,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 30 states and 34 transitions. [2024-10-12 00:25:46,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-12 00:25:46,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-12 00:25:46,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2024-10-12 00:25:46,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:25:46,558 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-10-12 00:25:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2024-10-12 00:25:46,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-10-12 00:25:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-10-12 00:25:46,560 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-10-12 00:25:46,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:25:46,561 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-10-12 00:25:46,561 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:25:46,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2024-10-12 00:25:46,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:25:46,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:25:46,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:25:46,562 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:25:46,562 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:25:46,562 INFO L745 eck$LassoCheckResult]: Stem: 1337#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1326#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1327#L528 assume !(main_~length1~0#1 < 1); 1324#L528-2 assume !(main_~length2~0#1 < 1); 1325#L531-1 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 1320#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 1321#L537-2 main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1336#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 1346#L537-2 main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1322#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 1323#L537-2 main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1345#L537-3 assume !(main_~i~0#1 < main_~length1~0#1); 1318#L537-4 havoc main_~i~0#1;main_~i~1#1 := 0; 1319#L541-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1; 1338#L541-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 1339#L541-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1; 1340#L541-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 1344#L541-3 assume !(main_~i~1#1 < main_~length2~0#1); 1328#L541-4 havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset, cstrpbrk_~c~0#1, cstrpbrk_~sc~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;havoc cstrpbrk_~c~0#1;havoc cstrpbrk_~sc~0#1; 1329#L519-4 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1; 1341#L518-1 assume !!(0 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset; 1333#L519-3 cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1; 1335#L519-1 assume !(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1; 1342#L519-4 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1; 1343#L518-1 assume !!(0 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset; 1331#L519-3 [2024-10-12 00:25:46,563 INFO L747 eck$LassoCheckResult]: Loop: 1331#L519-3 cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1; 1334#L519-1 assume !!(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1; 1330#L520 assume !(cstrpbrk_~sc~0#1 == cstrpbrk_~c~0#1); 1331#L519-3 [2024-10-12 00:25:46,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:46,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1269061459, now seen corresponding path program 4 times [2024-10-12 00:25:46,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:46,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625138457] [2024-10-12 00:25:46,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:46,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:46,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:46,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:46,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:46,597 INFO L85 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 4 times [2024-10-12 00:25:46,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:46,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733325956] [2024-10-12 00:25:46,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:46,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:46,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:46,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:46,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:46,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1987238385, now seen corresponding path program 1 times [2024-10-12 00:25:46,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:46,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827431652] [2024-10-12 00:25:46,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:46,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 00:25:46,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:25:46,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827431652] [2024-10-12 00:25:46,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827431652] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:25:46,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547929090] [2024-10-12 00:25:46,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:46,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:25:46,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:46,751 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:25:46,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-10-12 00:25:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:46,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-12 00:25:46,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:46,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-12 00:25:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 00:25:46,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:25:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 00:25:46,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547929090] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:25:46,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:25:46,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-10-12 00:25:46,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888975547] [2024-10-12 00:25:46,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:25:46,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:25:46,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 00:25:46,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-12 00:25:46,963 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 8 Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:47,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:25:47,006 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-10-12 00:25:47,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 46 transitions. [2024-10-12 00:25:47,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:25:47,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 35 states and 39 transitions. [2024-10-12 00:25:47,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-12 00:25:47,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-10-12 00:25:47,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 39 transitions. [2024-10-12 00:25:47,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:25:47,008 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-12 00:25:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 39 transitions. [2024-10-12 00:25:47,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-10-12 00:25:47,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-10-12 00:25:47,011 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-10-12 00:25:47,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 00:25:47,012 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-10-12 00:25:47,012 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 00:25:47,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2024-10-12 00:25:47,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:25:47,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:25:47,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:25:47,014 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:25:47,014 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:25:47,014 INFO L745 eck$LassoCheckResult]: Stem: 1587#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1576#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~0#1, main_#t~nondet12#1, main_#t~post13#1, main_~i~1#1, main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1577#L528 assume !(main_~length1~0#1 < 1); 1574#L528-2 assume !(main_~length2~0#1 < 1); 1575#L531-1 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~0#1 := 0; 1570#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 1571#L537-2 main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1572#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 1573#L537-2 main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1597#L537-3 assume !!(main_~i~0#1 < main_~length1~0#1);havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet10#1; 1595#L537-2 main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1594#L537-3 assume !(main_~i~0#1 < main_~length1~0#1); 1568#L537-4 havoc main_~i~0#1;main_~i~1#1 := 0; 1569#L541-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1; 1588#L541-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 1589#L541-3 assume !!(main_~i~1#1 < main_~length2~0#1);havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet12#1; 1590#L541-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 1598#L541-3 assume !(main_~i~1#1 < main_~length2~0#1); 1578#L541-4 havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset, cstrpbrk_~c~0#1, cstrpbrk_~sc~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;havoc cstrpbrk_~c~0#1;havoc cstrpbrk_~sc~0#1; 1579#L519-4 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1; 1591#L518-1 assume !!(0 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset; 1585#L519-3 cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1; 1586#L519-1 assume !!(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1; 1582#L520 assume !(cstrpbrk_~sc~0#1 == cstrpbrk_~c~0#1); 1583#L519-3 cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1; 1596#L519-1 assume !(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1; 1592#L519-4 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;call cstrpbrk_#t~mem3#1 := read~int#0(cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem3#1; 1593#L518-1 assume !!(0 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~mem3#1;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset; 1581#L519-3 [2024-10-12 00:25:47,014 INFO L747 eck$LassoCheckResult]: Loop: 1581#L519-3 cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset := cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset;cstrpbrk_~scanp~0#1.base, cstrpbrk_~scanp~0#1.offset := cstrpbrk_#t~post4#1.base, 1 + cstrpbrk_#t~post4#1.offset;call cstrpbrk_#t~mem5#1 := read~int#1(cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset, 1);cstrpbrk_~sc~0#1 := cstrpbrk_#t~mem5#1; 1584#L519-1 assume !!(0 != cstrpbrk_~sc~0#1);havoc cstrpbrk_#t~post4#1.base, cstrpbrk_#t~post4#1.offset;havoc cstrpbrk_#t~mem5#1; 1580#L520 assume !(cstrpbrk_~sc~0#1 == cstrpbrk_~c~0#1); 1581#L519-3 [2024-10-12 00:25:47,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:47,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2062165185, now seen corresponding path program 2 times [2024-10-12 00:25:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:47,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536458842] [2024-10-12 00:25:47,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:47,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:47,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:47,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:47,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:47,063 INFO L85 PathProgramCache]: Analyzing trace with hash 86557, now seen corresponding path program 5 times [2024-10-12 00:25:47,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:47,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850297697] [2024-10-12 00:25:47,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:47,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:47,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:47,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:47,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:47,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1249118883, now seen corresponding path program 3 times [2024-10-12 00:25:47,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:25:47,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056522600] [2024-10-12 00:25:47,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:25:47,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:25:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:47,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:25:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:25:47,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:25:51,383 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:25:51,383 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:25:51,383 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:25:51,383 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:25:51,383 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:25:51,383 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:51,383 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:25:51,383 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:25:51,384 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca-2.i_Iteration11_Lasso [2024-10-12 00:25:51,384 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:25:51,384 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:25:51,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:51,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:25:52,122 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:25:52,122 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:25:52,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:52,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:52,125 INFO L229 MonitoredProcess]: Starting monitored process 41 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:52,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-12 00:25:52,127 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:52,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:52,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:25:52,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:52,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:52,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:52,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:25:52,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:25:52,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:52,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:52,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:52,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:52,155 INFO L229 MonitoredProcess]: Starting monitored process 42 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:52,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-12 00:25:52,158 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:52,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:52,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:25:52,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:52,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:52,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:52,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:25:52,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:25:52,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:52,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-10-12 00:25:52,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:52,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:52,182 INFO L229 MonitoredProcess]: Starting monitored process 43 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:52,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-12 00:25:52,183 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:52,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:52,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:25:52,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:52,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:52,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:52,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:25:52,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:25:52,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:52,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-12 00:25:52,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:52,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:52,208 INFO L229 MonitoredProcess]: Starting monitored process 44 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:52,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-12 00:25:52,210 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:52,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:52,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:25:52,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:52,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:52,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:52,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:25:52,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:25:52,223 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:52,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-12 00:25:52,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:52,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:52,236 INFO L229 MonitoredProcess]: Starting monitored process 45 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:52,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-12 00:25:52,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:25:52,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:52,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:52,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:52,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:52,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:52,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:52,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:25:52,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-12 00:25:52,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:52,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:52,267 INFO L229 MonitoredProcess]: Starting monitored process 46 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:52,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-12 00:25:52,269 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:52,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:25:52,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:25:52,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:25:52,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:25:52,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:25:52,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:25:52,292 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:25:52,310 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-10-12 00:25:52,310 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-12 00:25:52,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:25:52,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:25:52,311 INFO L229 MonitoredProcess]: Starting monitored process 47 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:52,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-12 00:25:52,313 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:25:52,325 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:25:52,325 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:25:52,325 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~scanp~0#1.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~s2#1.base)_2) = -1*ULTIMATE.start_cstrpbrk_~scanp~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s2#1.base)_2 Supporting invariants [] [2024-10-12 00:25:52,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-10-12 00:25:52,364 INFO L156 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2024-10-12 00:25:52,368 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~scanp~0!offset [2024-10-12 00:25:52,368 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:25:52,368 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:25:52,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:52,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:25:52,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:52,533 WARN L253 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 00:25:52,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:52,567 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:52,567 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-12 00:25:52,568 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:52,608 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 49 transitions. Complement of second has 7 states. [2024-10-12 00:25:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:25:52,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2024-10-12 00:25:52,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 28 letters. Loop has 3 letters. [2024-10-12 00:25:52,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:52,610 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:25:52,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:52,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:25:52,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:52,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:52,795 WARN L253 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 00:25:52,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:52,830 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:52,830 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-12 00:25:52,831 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:52,871 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 50 transitions. Complement of second has 7 states. [2024-10-12 00:25:52,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:25:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2024-10-12 00:25:52,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 3 letters. [2024-10-12 00:25:52,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:52,875 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:25:52,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:25:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:52,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:25:52,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:25:53,025 WARN L253 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 00:25:53,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:25:53,056 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:53,057 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-12 00:25:53,057 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:53,089 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 35 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 43 transitions. Complement of second has 6 states. [2024-10-12 00:25:53,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:25:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:25:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2024-10-12 00:25:53,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 28 letters. Loop has 3 letters. [2024-10-12 00:25:53,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:53,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 31 letters. Loop has 3 letters. [2024-10-12 00:25:53,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:53,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 28 letters. Loop has 6 letters. [2024-10-12 00:25:53,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:25:53,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 43 transitions. [2024-10-12 00:25:53,092 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:25:53,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2024-10-12 00:25:53,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:25:53,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:25:53,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:25:53,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:25:53,093 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:25:53,093 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:25:53,093 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:25:53,093 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 00:25:53,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:25:53,093 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:25:53,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:25:53,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:25:53 BoogieIcfgContainer [2024-10-12 00:25:53,101 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:25:53,101 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:25:53,101 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:25:53,101 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:25:53,102 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:33" (3/4) ... [2024-10-12 00:25:53,103 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:25:53,104 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:25:53,105 INFO L158 Benchmark]: Toolchain (without parser) took 20275.42ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 128.7MB in the beginning and 189.0MB in the end (delta: -60.3MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2024-10-12 00:25:53,105 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:25:53,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.36ms. Allocated memory is still 157.3MB. Free memory was 128.7MB in the beginning and 110.0MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 00:25:53,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.84ms. Allocated memory is still 157.3MB. Free memory was 110.0MB in the beginning and 107.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:25:53,106 INFO L158 Benchmark]: Boogie Preprocessor took 52.57ms. Allocated memory is still 157.3MB. Free memory was 107.9MB in the beginning and 105.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:25:53,106 INFO L158 Benchmark]: RCFGBuilder took 383.80ms. Allocated memory is still 157.3MB. Free memory was 105.8MB in the beginning and 119.8MB in the end (delta: -14.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 00:25:53,106 INFO L158 Benchmark]: BuchiAutomizer took 19323.09ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 118.8MB in the beginning and 190.0MB in the end (delta: -71.2MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2024-10-12 00:25:53,106 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 272.6MB. Free memory was 190.0MB in the beginning and 189.0MB in the end (delta: 998.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:25:53,108 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.15ms. Allocated memory is still 109.1MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.36ms. Allocated memory is still 157.3MB. Free memory was 128.7MB in the beginning and 110.0MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.84ms. Allocated memory is still 157.3MB. Free memory was 110.0MB in the beginning and 107.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.57ms. Allocated memory is still 157.3MB. Free memory was 107.9MB in the beginning and 105.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 383.80ms. Allocated memory is still 157.3MB. Free memory was 105.8MB in the beginning and 119.8MB in the end (delta: -14.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 19323.09ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 118.8MB in the beginning and 190.0MB in the end (delta: -71.2MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 272.6MB. Free memory was 190.0MB in the beginning and 189.0MB in the end (delta: 998.8kB). 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: ~s1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~scanp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~scanp~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 11 terminating modules (6 trivial, 4 deterministic, 1 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 (length2 + ((long long) -1 * i)) and consists of 3 locations. One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 5 locations. One nondeterministic module has affine ranking function null and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.2s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 17.1s. Construction of modules took 0.3s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 16 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 628 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 440 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 188 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital170 mio100 ax111 hnf100 lsp88 ukn70 mio100 lsp33 div132 bol100 ite100 ukn100 eq170 hnf90 smp88 dnf112 smp94 tf100 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 85ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 56 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-12 00:25:53,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:53,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:53,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-10-12 00:25:53,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-12 00:25:53,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE