./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:01:32,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:01:32,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:01:32,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:01:32,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:01:32,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:01:32,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:01:32,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:01:32,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:01:32,146 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:01:32,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:01:32,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:01:32,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:01:32,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:01:32,147 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:01:32,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:01:32,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:01:32,147 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:01:32,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:01:32,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:01:32,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:01:32,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:01:32,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:01:32,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:01:32,148 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:01:32,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:01:32,148 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:01:32,148 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:01:32,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:01:32,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:01:32,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:01:32,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:01:32,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:01:32,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:01:32,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:01:32,149 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:01:32,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:01:32,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:01:32,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:01:32,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:01:32,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:01:32,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:01:32,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:01:32,150 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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(G ! call(reach_error())) ) 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 -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b [2025-02-05 16:01:32,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:01:32,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:01:32,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:01:32,398 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:01:32,398 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:01:32,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2025-02-05 16:01:33,557 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94402a99c/6963a12e53434d6baf7db2d3a50b9760/FLAGc0abadb77 [2025-02-05 16:01:33,801 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:01:33,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2025-02-05 16:01:33,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94402a99c/6963a12e53434d6baf7db2d3a50b9760/FLAGc0abadb77 [2025-02-05 16:01:33,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94402a99c/6963a12e53434d6baf7db2d3a50b9760 [2025-02-05 16:01:33,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:01:33,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:01:33,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:01:33,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:01:33,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:01:33,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:01:33" (1/1) ... [2025-02-05 16:01:33,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2b9dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:33, skipping insertion in model container [2025-02-05 16:01:33,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:01:33" (1/1) ... [2025-02-05 16:01:33,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:01:33,932 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2025-02-05 16:01:33,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:01:33,940 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:01:33,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2025-02-05 16:01:33,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:01:33,958 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:01:33,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:33 WrapperNode [2025-02-05 16:01:33,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:01:33,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:01:33,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:01:33,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:01:33,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:33" (1/1) ... [2025-02-05 16:01:33,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:33" (1/1) ... [2025-02-05 16:01:33,979 INFO L138 Inliner]: procedures = 13, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2025-02-05 16:01:33,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:01:33,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:01:33,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:01:33,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:01:33,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:33" (1/1) ... [2025-02-05 16:01:33,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:33" (1/1) ... [2025-02-05 16:01:33,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:33" (1/1) ... [2025-02-05 16:01:33,999 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1]. The 4 writes are split as follows [0, 2, 2]. [2025-02-05 16:01:33,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:33" (1/1) ... [2025-02-05 16:01:33,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:33" (1/1) ... [2025-02-05 16:01:34,003 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:33" (1/1) ... [2025-02-05 16:01:34,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:33" (1/1) ... [2025-02-05 16:01:34,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:33" (1/1) ... [2025-02-05 16:01:34,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:33" (1/1) ... [2025-02-05 16:01:34,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:01:34,010 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:01:34,010 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:01:34,010 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:01:34,010 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:33" (1/1) ... [2025-02-05 16:01:34,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:01:34,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:01:34,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:01:34,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:01:34,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:01:34,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:01:34,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 16:01:34,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 16:01:34,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 16:01:34,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 16:01:34,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 16:01:34,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 16:01:34,059 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2025-02-05 16:01:34,060 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2025-02-05 16:01:34,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:01:34,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:01:34,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 16:01:34,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 16:01:34,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 16:01:34,060 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2025-02-05 16:01:34,060 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2025-02-05 16:01:34,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 16:01:34,114 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:01:34,116 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:01:34,184 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L61: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset; [2025-02-05 16:01:34,202 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-02-05 16:01:34,203 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:01:34,208 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:01:34,208 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:01:34,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:01:34 BoogieIcfgContainer [2025-02-05 16:01:34,209 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:01:34,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:01:34,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:01:34,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:01:34,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:01:33" (1/3) ... [2025-02-05 16:01:34,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a63d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:01:34, skipping insertion in model container [2025-02-05 16:01:34,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:01:33" (2/3) ... [2025-02-05 16:01:34,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a63d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:01:34, skipping insertion in model container [2025-02-05 16:01:34,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:01:34" (3/3) ... [2025-02-05 16:01:34,215 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2025-02-05 16:01:34,224 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:01:34,225 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_2.c that has 3 procedures, 24 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:01:34,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:01:34,277 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@163df893, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:01:34,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:01:34,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.3125) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 16:01:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 16:01:34,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:01:34,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:01:34,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:01:34,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:01:34,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1504494570, now seen corresponding path program 1 times [2025-02-05 16:01:34,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:01:34,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026967667] [2025-02-05 16:01:34,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:01:34,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:01:34,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 16:01:34,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 16:01:34,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:01:34,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:01:34,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:01:34,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026967667] [2025-02-05 16:01:34,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026967667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:01:34,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:01:34,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:01:34,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585618813] [2025-02-05 16:01:34,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:01:34,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:01:34,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:01:34,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:01:34,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:01:34,700 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.3125) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 16:01:34,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:01:34,808 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2025-02-05 16:01:34,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:01:34,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-05 16:01:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:01:34,814 INFO L225 Difference]: With dead ends: 35 [2025-02-05 16:01:34,814 INFO L226 Difference]: Without dead ends: 22 [2025-02-05 16:01:34,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:01:34,818 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:01:34,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:01:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-05 16:01:34,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-05 16:01:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-05 16:01:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-02-05 16:01:34,847 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 11 [2025-02-05 16:01:34,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:01:34,848 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-02-05 16:01:34,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 16:01:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-02-05 16:01:34,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 16:01:34,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:01:34,849 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:01:34,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:01:34,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:01:34,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:01:34,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1403001686, now seen corresponding path program 1 times [2025-02-05 16:01:34,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:01:34,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65956951] [2025-02-05 16:01:34,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:01:34,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:01:34,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 16:01:34,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 16:01:34,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:01:34,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:35,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:01:35,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:01:35,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65956951] [2025-02-05 16:01:35,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65956951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:01:35,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:01:35,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:01:35,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241941264] [2025-02-05 16:01:35,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:01:35,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:01:35,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:01:35,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:01:35,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:01:35,080 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:01:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:01:35,140 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2025-02-05 16:01:35,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:01:35,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2025-02-05 16:01:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:01:35,142 INFO L225 Difference]: With dead ends: 43 [2025-02-05 16:01:35,142 INFO L226 Difference]: Without dead ends: 24 [2025-02-05 16:01:35,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:01:35,144 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:01:35,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 57 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:01:35,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-05 16:01:35,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-05 16:01:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-05 16:01:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-02-05 16:01:35,149 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 22 [2025-02-05 16:01:35,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:01:35,149 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-02-05 16:01:35,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 16:01:35,149 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-02-05 16:01:35,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 16:01:35,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:01:35,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:01:35,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:01:35,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:01:35,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:01:35,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1171971531, now seen corresponding path program 1 times [2025-02-05 16:01:35,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:01:35,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266767491] [2025-02-05 16:01:35,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:01:35,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:01:35,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 16:01:35,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 16:01:35,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:01:35,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:35,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 16:01:35,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:01:35,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266767491] [2025-02-05 16:01:35,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266767491] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:01:35,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90184949] [2025-02-05 16:01:35,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:01:35,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:01:35,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:01:35,485 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:01:35,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:01:35,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 16:01:35,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 16:01:35,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:01:35,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:35,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 16:01:35,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:01:35,599 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 [2025-02-05 16:01:35,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 16:01:35,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:01:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:01:36,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90184949] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:01:36,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:01:36,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2025-02-05 16:01:36,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307264544] [2025-02-05 16:01:36,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:01:36,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 16:01:36,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:01:36,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 16:01:36,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2025-02-05 16:01:36,192 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 24 states, 18 states have (on average 2.111111111111111) internal successors, (38), 20 states have internal predecessors, (38), 10 states have call successors, (11), 5 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) [2025-02-05 16:01:36,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:01:36,452 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2025-02-05 16:01:36,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:01:36,453 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.111111111111111) internal successors, (38), 20 states have internal predecessors, (38), 10 states have call successors, (11), 5 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) Word has length 27 [2025-02-05 16:01:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:01:36,453 INFO L225 Difference]: With dead ends: 49 [2025-02-05 16:01:36,453 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 16:01:36,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=878, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 16:01:36,454 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:01:36,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 105 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:01:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 16:01:36,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-05 16:01:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-05 16:01:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-02-05 16:01:36,459 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 27 [2025-02-05 16:01:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:01:36,459 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-02-05 16:01:36,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.111111111111111) internal successors, (38), 20 states have internal predecessors, (38), 10 states have call successors, (11), 5 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) [2025-02-05 16:01:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-02-05 16:01:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:01:36,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:01:36,460 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:01:36,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 16:01:36,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:01:36,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:01:36,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:01:36,666 INFO L85 PathProgramCache]: Analyzing trace with hash -488170110, now seen corresponding path program 2 times [2025-02-05 16:01:36,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:01:36,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327564043] [2025-02-05 16:01:36,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:01:36,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:01:36,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-02-05 16:01:36,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:01:36,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 16:01:36,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 16:01:37,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:01:37,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327564043] [2025-02-05 16:01:37,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327564043] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:01:37,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958595542] [2025-02-05 16:01:37,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:01:37,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:01:37,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:01:37,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:01:37,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:01:37,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-02-05 16:01:37,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:01:37,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 16:01:37,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:37,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-05 16:01:37,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:01:37,123 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 [2025-02-05 16:01:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-02-05 16:01:37,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:01:37,928 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-05 16:01:37,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958595542] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:01:37,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:01:37,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 32 [2025-02-05 16:01:37,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747398515] [2025-02-05 16:01:37,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:01:37,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 16:01:37,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:01:37,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 16:01:37,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2025-02-05 16:01:37,930 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 32 states, 24 states have (on average 2.0) internal successors, (48), 27 states have internal predecessors, (48), 13 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (17), 11 states have call predecessors, (17), 13 states have call successors, (17) [2025-02-05 16:01:38,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:01:38,232 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2025-02-05 16:01:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:01:38,232 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 24 states have (on average 2.0) internal successors, (48), 27 states have internal predecessors, (48), 13 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (17), 11 states have call predecessors, (17), 13 states have call successors, (17) Word has length 53 [2025-02-05 16:01:38,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:01:38,233 INFO L225 Difference]: With dead ends: 57 [2025-02-05 16:01:38,233 INFO L226 Difference]: Without dead ends: 32 [2025-02-05 16:01:38,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=1449, Unknown=0, NotChecked=0, Total=1722 [2025-02-05 16:01:38,235 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:01:38,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 161 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:01:38,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-05 16:01:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-05 16:01:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 8 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-05 16:01:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-02-05 16:01:38,243 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 53 [2025-02-05 16:01:38,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:01:38,243 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-02-05 16:01:38,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 24 states have (on average 2.0) internal successors, (48), 27 states have internal predecessors, (48), 13 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (17), 11 states have call predecessors, (17), 13 states have call successors, (17) [2025-02-05 16:01:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-02-05 16:01:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:01:38,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:01:38,249 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:01:38,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:01:38,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:01:38,450 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:01:38,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:01:38,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1751379651, now seen corresponding path program 3 times [2025-02-05 16:01:38,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:01:38,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61234850] [2025-02-05 16:01:38,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 16:01:38,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:01:38,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 89 statements into 7 equivalence classes. [2025-02-05 16:01:38,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 59 of 89 statements. [2025-02-05 16:01:38,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 16:01:38,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-02-05 16:01:38,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:01:38,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61234850] [2025-02-05 16:01:38,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61234850] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:01:38,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394233282] [2025-02-05 16:01:38,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 16:01:38,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:01:38,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:01:38,771 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:01:38,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:01:38,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 89 statements into 7 equivalence classes. [2025-02-05 16:01:38,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 59 of 89 statements. [2025-02-05 16:01:38,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-05 16:01:38,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:38,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-05 16:01:38,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:01:38,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-02-05 16:01:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-02-05 16:01:39,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:01:40,097 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-02-05 16:01:40,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394233282] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:01:40,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:01:40,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 18] total 36 [2025-02-05 16:01:40,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12288312] [2025-02-05 16:01:40,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:01:40,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 16:01:40,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:01:40,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 16:01:40,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 16:01:40,100 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 36 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 14 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (18), 16 states have call predecessors, (18), 14 states have call successors, (18) [2025-02-05 16:01:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:01:40,407 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-02-05 16:01:40,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:01:40,408 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 14 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (18), 16 states have call predecessors, (18), 14 states have call successors, (18) Word has length 89 [2025-02-05 16:01:40,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:01:40,409 INFO L225 Difference]: With dead ends: 39 [2025-02-05 16:01:40,409 INFO L226 Difference]: Without dead ends: 34 [2025-02-05 16:01:40,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=326, Invalid=1566, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 16:01:40,410 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:01:40,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 100 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:01:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-05 16:01:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-05 16:01:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-05 16:01:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-02-05 16:01:40,414 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 89 [2025-02-05 16:01:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:01:40,414 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-02-05 16:01:40,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 14 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (18), 16 states have call predecessors, (18), 14 states have call successors, (18) [2025-02-05 16:01:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-02-05 16:01:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 16:01:40,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:01:40,415 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 12, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:01:40,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:01:40,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:01:40,616 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:01:40,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:01:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1146915985, now seen corresponding path program 1 times [2025-02-05 16:01:40,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:01:40,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819117770] [2025-02-05 16:01:40,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:01:40,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:01:40,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 16:01:40,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 16:01:40,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:01:40,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 12 proven. 243 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2025-02-05 16:01:41,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:01:41,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819117770] [2025-02-05 16:01:41,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819117770] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:01:41,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983037988] [2025-02-05 16:01:41,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:01:41,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:01:41,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:01:41,417 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:01:41,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:01:41,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 16:01:41,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 16:01:41,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:01:41,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:41,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-02-05 16:01:41,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:01:41,642 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 15 treesize of output 1 [2025-02-05 16:01:41,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 13 [2025-02-05 16:01:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 236 proven. 15 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-02-05 16:01:41,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:01:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 236 proven. 27 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2025-02-05 16:01:43,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983037988] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:01:43,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:01:43,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 18] total 35 [2025-02-05 16:01:43,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126942322] [2025-02-05 16:01:43,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:01:43,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 16:01:43,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:01:43,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 16:01:43,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 16:01:43,944 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 35 states, 25 states have (on average 2.08) internal successors, (52), 30 states have internal predecessors, (52), 13 states have call successors, (18), 7 states have call predecessors, (18), 11 states have return successors, (22), 10 states have call predecessors, (22), 13 states have call successors, (22) [2025-02-05 16:01:44,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:01:44,238 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2025-02-05 16:01:44,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:01:44,239 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 25 states have (on average 2.08) internal successors, (52), 30 states have internal predecessors, (52), 13 states have call successors, (18), 7 states have call predecessors, (18), 11 states have return successors, (22), 10 states have call predecessors, (22), 13 states have call successors, (22) Word has length 115 [2025-02-05 16:01:44,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:01:44,240 INFO L225 Difference]: With dead ends: 69 [2025-02-05 16:01:44,240 INFO L226 Difference]: Without dead ends: 38 [2025-02-05 16:01:44,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=337, Invalid=1469, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 16:01:44,241 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:01:44,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 189 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:01:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-05 16:01:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-05 16:01:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 24 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (13), 11 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-05 16:01:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2025-02-05 16:01:44,253 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 115 [2025-02-05 16:01:44,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:01:44,253 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2025-02-05 16:01:44,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 25 states have (on average 2.08) internal successors, (52), 30 states have internal predecessors, (52), 13 states have call successors, (18), 7 states have call predecessors, (18), 11 states have return successors, (22), 10 states have call predecessors, (22), 13 states have call successors, (22) [2025-02-05 16:01:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2025-02-05 16:01:44,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 16:01:44,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:01:44,257 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 20, 20, 20, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:01:44,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 16:01:44,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-05 16:01:44,458 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:01:44,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:01:44,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2066942673, now seen corresponding path program 2 times [2025-02-05 16:01:44,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:01:44,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968854155] [2025-02-05 16:01:44,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:01:44,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:01:44,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 155 statements into 2 equivalence classes. [2025-02-05 16:01:44,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 16:01:44,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 16:01:44,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 192 proven. 379 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2025-02-05 16:01:45,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:01:45,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968854155] [2025-02-05 16:01:45,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968854155] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:01:45,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439610270] [2025-02-05 16:01:45,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:01:45,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:01:45,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:01:45,315 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:01:45,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 16:01:45,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 155 statements into 2 equivalence classes. [2025-02-05 16:01:45,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 16:01:45,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 16:01:45,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:45,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-05 16:01:45,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:01:45,461 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 [2025-02-05 16:01:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1328 trivial. 0 not checked. [2025-02-05 16:01:45,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:01:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1294 trivial. 0 not checked. [2025-02-05 16:01:47,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439610270] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:01:47,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:01:47,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 22] total 45 [2025-02-05 16:01:47,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881178971] [2025-02-05 16:01:47,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:01:47,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-05 16:01:47,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:01:47,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-05 16:01:47,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1707, Unknown=0, NotChecked=0, Total=1980 [2025-02-05 16:01:47,350 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 45 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 38 states have internal predecessors, (61), 17 states have call successors, (20), 8 states have call predecessors, (20), 18 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2025-02-05 16:01:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:01:47,746 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2025-02-05 16:01:47,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 16:01:47,747 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 38 states have internal predecessors, (61), 17 states have call successors, (20), 8 states have call predecessors, (20), 18 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) Word has length 155 [2025-02-05 16:01:47,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:01:47,747 INFO L225 Difference]: With dead ends: 77 [2025-02-05 16:01:47,747 INFO L226 Difference]: Without dead ends: 42 [2025-02-05 16:01:47,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=502, Invalid=2804, Unknown=0, NotChecked=0, Total=3306 [2025-02-05 16:01:47,749 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:01:47,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 154 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:01:47,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-05 16:01:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-05 16:01:47,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 13 states have return successors, (15), 13 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 16:01:47,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2025-02-05 16:01:47,755 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 155 [2025-02-05 16:01:47,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:01:47,756 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2025-02-05 16:01:47,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 38 states have internal predecessors, (61), 17 states have call successors, (20), 8 states have call predecessors, (20), 18 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2025-02-05 16:01:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2025-02-05 16:01:47,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-05 16:01:47,758 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:01:47,758 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:01:47,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 16:01:47,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:01:47,962 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:01:47,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:01:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1992595793, now seen corresponding path program 3 times [2025-02-05 16:01:47,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:01:47,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443017147] [2025-02-05 16:01:47,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 16:01:47,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:01:47,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 216 statements into 30 equivalence classes. [2025-02-05 16:01:48,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 204 of 216 statements. [2025-02-05 16:01:48,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-02-05 16:01:48,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 793 proven. 29 refuted. 0 times theorem prover too weak. 2083 trivial. 0 not checked. [2025-02-05 16:01:48,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:01:48,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443017147] [2025-02-05 16:01:48,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443017147] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:01:48,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653361645] [2025-02-05 16:01:48,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 16:01:48,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:01:48,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:01:48,819 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:01:48,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 16:01:48,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 216 statements into 30 equivalence classes. [2025-02-05 16:01:51,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 204 of 216 statements. [2025-02-05 16:01:51,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-02-05 16:01:51,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:01:51,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 140 conjuncts are in the unsatisfiable core [2025-02-05 16:01:51,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:01:51,420 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 [2025-02-05 16:01:51,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-02-05 16:01:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 937 proven. 76 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2025-02-05 16:01:51,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:01:52,455 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 25 treesize of output 21 [2025-02-05 16:01:52,789 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 25 treesize of output 21 [2025-02-05 16:01:53,106 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 25 treesize of output 21 [2025-02-05 16:01:53,374 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 25 treesize of output 21 [2025-02-05 16:01:54,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653361645] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:01:54,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 16:01:54,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 24 [2025-02-05 16:01:54,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990586193] [2025-02-05 16:01:54,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 16:01:54,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 16:01:54,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:01:54,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 16:01:54,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:01:54,205 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 24 states, 20 states have (on average 2.1) internal successors, (42), 24 states have internal predecessors, (42), 9 states have call successors, (11), 2 states have call predecessors, (11), 11 states have return successors, (16), 12 states have call predecessors, (16), 9 states have call successors, (16) [2025-02-05 16:01:54,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:01:54,610 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2025-02-05 16:01:54,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 16:01:54,610 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.1) internal successors, (42), 24 states have internal predecessors, (42), 9 states have call successors, (11), 2 states have call predecessors, (11), 11 states have return successors, (16), 12 states have call predecessors, (16), 9 states have call successors, (16) Word has length 216 [2025-02-05 16:01:54,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:01:54,611 INFO L225 Difference]: With dead ends: 44 [2025-02-05 16:01:54,611 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 16:01:54,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=1457, Unknown=0, NotChecked=0, Total=1640 [2025-02-05 16:01:54,613 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:01:54,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 205 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:01:54,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 16:01:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 16:01:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2025-02-05 16:01:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 16:01:54,614 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2025-02-05 16:01:54,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:01:54,614 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 16:01:54,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.1) internal successors, (42), 24 states have internal predecessors, (42), 9 states have call successors, (11), 2 states have call predecessors, (11), 11 states have return successors, (16), 12 states have call predecessors, (16), 9 states have call successors, (16) [2025-02-05 16:01:54,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 16:01:54,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 16:01:54,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 16:01:54,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 16:01:54,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-05 16:01:54,822 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1] [2025-02-05 16:01:54,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 16:01:55,416 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 16:01:55,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 04:01:55 BoogieIcfgContainer [2025-02-05 16:01:55,422 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 16:01:55,423 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 16:01:55,423 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 16:01:55,423 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 16:01:55,423 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:01:34" (3/4) ... [2025-02-05 16:01:55,424 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 16:01:55,428 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_21_0 [2025-02-05 16:01:55,429 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_21_to_21_0 [2025-02-05 16:01:55,430 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-05 16:01:55,432 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-05 16:01:55,432 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 16:01:55,433 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 16:01:55,483 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 16:01:55,484 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 16:01:55,484 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 16:01:55,486 INFO L158 Benchmark]: Toolchain (without parser) took 21659.41ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 122.1MB in the beginning and 254.7MB in the end (delta: -132.7MB). Peak memory consumption was 143.2MB. Max. memory is 16.1GB. [2025-02-05 16:01:55,486 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 16:01:55,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 131.91ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 111.4MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 16:01:55,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.96ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 16:01:55,487 INFO L158 Benchmark]: Boogie Preprocessor took 29.05ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 16:01:55,487 INFO L158 Benchmark]: IcfgBuilder took 199.29ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 97.2MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 16:01:55,487 INFO L158 Benchmark]: TraceAbstraction took 21211.73ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 96.8MB in the beginning and 262.8MB in the end (delta: -166.0MB). Peak memory consumption was 109.7MB. Max. memory is 16.1GB. [2025-02-05 16:01:55,488 INFO L158 Benchmark]: Witness Printer took 61.48ms. Allocated memory is still 444.6MB. Free memory was 262.8MB in the beginning and 254.7MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 16:01:55,489 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.13ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 131.91ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 111.4MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.96ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.05ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 199.29ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 97.2MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21211.73ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 96.8MB in the beginning and 262.8MB in the end (delta: -166.0MB). Peak memory consumption was 109.7MB. Max. memory is 16.1GB. * Witness Printer took 61.48ms. Allocated memory is still 444.6MB. Free memory was 262.8MB in the beginning and 254.7MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 69]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.6s, OverallIterations: 8, TraceHistogramMax: 35, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 184 mSDsluCounter, 1029 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 918 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1703 IncrementalHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 111 mSDtfsCounter, 1703 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1304 GetRequests, 1043 SyntacticMatches, 2 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2782 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=7, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 1343 NumberOfCodeBlocks, 1259 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 1763 ConstructedInterpolants, 0 QuantifiedInterpolants, 6905 SizeOfPredicates, 63 NumberOfNonLiveVariables, 2731 ConjunctsInSsa, 418 ConjunctsInUnsatCore, 19 InterpolantComputations, 2 PerfectInterpolantSequences, 11962/12948 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-05 16:01:55,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE