./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i --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/ldv-sets/test_mutex_unbounded-1.i -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 10aecdd717bb6691571ad1da0b912f030832fb85361f767ea82293acfe046216 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:30:33,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:30:34,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:30:34,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:30:34,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:30:34,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:30:34,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:30:34,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:30:34,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:30:34,070 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:30:34,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:30:34,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:30:34,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:30:34,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:30:34,071 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:30:34,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:30:34,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:30:34,071 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:30:34,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:30:34,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:30:34,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:30:34,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:30:34,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:30:34,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:30:34,071 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:30:34,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:30:34,072 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:30:34,072 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:30:34,072 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:30:34,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:30:34,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:30:34,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:30:34,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:30:34,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:30:34,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:30:34,072 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:30:34,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:30:34,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:30:34,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:30:34,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:30:34,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:30:34,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:30:34,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:30:34,073 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 -> 10aecdd717bb6691571ad1da0b912f030832fb85361f767ea82293acfe046216 [2025-02-05 14:30:34,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:30:34,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:30:34,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:30:34,360 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:30:34,361 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:30:34,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2025-02-05 14:30:35,556 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5605bf7f6/9025d90b05ba44b98af7f0bcda028e83/FLAGf8d579863 [2025-02-05 14:30:35,864 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:30:35,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2025-02-05 14:30:35,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5605bf7f6/9025d90b05ba44b98af7f0bcda028e83/FLAGf8d579863 [2025-02-05 14:30:36,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5605bf7f6/9025d90b05ba44b98af7f0bcda028e83 [2025-02-05 14:30:36,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:30:36,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:30:36,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:30:36,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:30:36,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:30:36,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:30:36" (1/1) ... [2025-02-05 14:30:36,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bf3bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:36, skipping insertion in model container [2025-02-05 14:30:36,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:30:36" (1/1) ... [2025-02-05 14:30:36,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:30:36,375 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/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2025-02-05 14:30:36,378 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/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2025-02-05 14:30:36,379 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/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2025-02-05 14:30:36,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:30:36,397 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:30:36,447 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/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2025-02-05 14:30:36,449 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/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2025-02-05 14:30:36,450 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/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2025-02-05 14:30:36,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:30:36,486 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:30:36,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:36 WrapperNode [2025-02-05 14:30:36,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:30:36,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:30:36,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:30:36,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:30:36,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:36" (1/1) ... [2025-02-05 14:30:36,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:36" (1/1) ... [2025-02-05 14:30:36,528 INFO L138 Inliner]: procedures = 142, calls = 62, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 174 [2025-02-05 14:30:36,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:30:36,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:30:36,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:30:36,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:30:36,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:36" (1/1) ... [2025-02-05 14:30:36,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:36" (1/1) ... [2025-02-05 14:30:36,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:36" (1/1) ... [2025-02-05 14:30:36,574 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 7 writes are split as follows [0, 7]. [2025-02-05 14:30:36,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:36" (1/1) ... [2025-02-05 14:30:36,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:36" (1/1) ... [2025-02-05 14:30:36,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:36" (1/1) ... [2025-02-05 14:30:36,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:36" (1/1) ... [2025-02-05 14:30:36,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:36" (1/1) ... [2025-02-05 14:30:36,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:36" (1/1) ... [2025-02-05 14:30:36,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:30:36,586 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:30:36,586 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:30:36,586 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:30:36,587 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:36" (1/1) ... [2025-02-05 14:30:36,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:30:36,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:30:36,614 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 14:30:36,619 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 14:30:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2025-02-05 14:30:36,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2025-02-05 14:30:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2025-02-05 14:30:36,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2025-02-05 14:30:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:30:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:30:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:30:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:30:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2025-02-05 14:30:36,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2025-02-05 14:30:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:30:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:30:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:30:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 14:30:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 14:30:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:30:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:30:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2025-02-05 14:30:36,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2025-02-05 14:30:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:30:36,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:30:36,729 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:30:36,732 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:30:36,946 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L667: havoc ldv_set_empty_#t~ret31#1; [2025-02-05 14:30:36,946 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: havoc ldv_list_empty_#t~mem10#1.base, ldv_list_empty_#t~mem10#1.offset; [2025-02-05 14:30:37,003 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-02-05 14:30:37,004 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:30:37,015 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:30:37,016 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:30:37,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:30:37 BoogieIcfgContainer [2025-02-05 14:30:37,017 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:30:37,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:30:37,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:30:37,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:30:37,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:30:36" (1/3) ... [2025-02-05 14:30:37,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76760697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:30:37, skipping insertion in model container [2025-02-05 14:30:37,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:30:36" (2/3) ... [2025-02-05 14:30:37,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76760697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:30:37, skipping insertion in model container [2025-02-05 14:30:37,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:30:37" (3/3) ... [2025-02-05 14:30:37,024 INFO L128 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-1.i [2025-02-05 14:30:37,035 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:30:37,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_mutex_unbounded-1.i that has 5 procedures, 66 locations, 1 initial locations, 5 loop locations, and 3 error locations. [2025-02-05 14:30:37,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:30:37,087 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;@45a3d172, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:30:37,087 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-05 14:30:37,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 50 states have (on average 1.3) internal successors, (65), 53 states have internal predecessors, (65), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:30:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 14:30:37,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:30:37,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:30:37,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:30:37,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:30:37,102 INFO L85 PathProgramCache]: Analyzing trace with hash 164153700, now seen corresponding path program 1 times [2025-02-05 14:30:37,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:30:37,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739796635] [2025-02-05 14:30:37,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:30:37,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:30:37,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 14:30:37,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 14:30:37,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:30:37,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:30:37,442 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 14:30:37,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:30:37,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739796635] [2025-02-05 14:30:37,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739796635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:30:37,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:30:37,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:30:37,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049092002] [2025-02-05 14:30:37,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:30:37,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 14:30:37,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:30:37,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 14:30:37,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:30:37,462 INFO L87 Difference]: Start difference. First operand has 66 states, 50 states have (on average 1.3) internal successors, (65), 53 states have internal predecessors, (65), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14:30:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:30:37,648 INFO L93 Difference]: Finished difference Result 180 states and 230 transitions. [2025-02-05 14:30:37,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:30:37,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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) Word has length 10 [2025-02-05 14:30:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:30:37,657 INFO L225 Difference]: With dead ends: 180 [2025-02-05 14:30:37,657 INFO L226 Difference]: Without dead ends: 104 [2025-02-05 14:30:37,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 14:30:37,661 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 56 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:30:37,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 270 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:30:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-05 14:30:37,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2025-02-05 14:30:37,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 70 states have internal predecessors, (87), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 14:30:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2025-02-05 14:30:37,704 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 10 [2025-02-05 14:30:37,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:30:37,705 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2025-02-05 14:30:37,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14:30:37,705 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2025-02-05 14:30:37,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 14:30:37,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:30:37,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:30:37,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:30:37,707 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:30:37,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:30:37,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1511701405, now seen corresponding path program 1 times [2025-02-05 14:30:37,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:30:37,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652691802] [2025-02-05 14:30:37,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:30:37,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:30:37,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 14:30:37,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 14:30:37,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:30:37,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:30:37,796 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 14:30:37,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:30:37,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652691802] [2025-02-05 14:30:37,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652691802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:30:37,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:30:37,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:30:37,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269238435] [2025-02-05 14:30:37,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:30:37,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:30:37,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:30:37,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:30:37,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:30:37,801 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 14:30:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:30:37,887 INFO L93 Difference]: Finished difference Result 153 states and 186 transitions. [2025-02-05 14:30:37,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:30:37,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2025-02-05 14:30:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:30:37,889 INFO L225 Difference]: With dead ends: 153 [2025-02-05 14:30:37,889 INFO L226 Difference]: Without dead ends: 73 [2025-02-05 14:30:37,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:30:37,890 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 13 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:30:37,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 172 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:30:37,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-05 14:30:37,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2025-02-05 14:30:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.196078431372549) internal successors, (61), 54 states have internal predecessors, (61), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 14:30:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2025-02-05 14:30:37,895 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 13 [2025-02-05 14:30:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:30:37,896 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2025-02-05 14:30:37,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 14:30:37,896 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2025-02-05 14:30:37,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 14:30:37,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:30:37,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:30:37,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:30:37,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:30:37,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:30:37,897 INFO L85 PathProgramCache]: Analyzing trace with hash -670609863, now seen corresponding path program 1 times [2025-02-05 14:30:37,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:30:37,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513736825] [2025-02-05 14:30:37,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:30:37,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:30:37,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 14:30:37,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 14:30:37,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:30:37,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:30:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:30:38,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:30:38,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513736825] [2025-02-05 14:30:38,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513736825] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:30:38,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941396949] [2025-02-05 14:30:38,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:30:38,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:30:38,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:30:38,326 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 14:30:38,328 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 14:30:38,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 14:30:38,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 14:30:38,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:30:38,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:30:38,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-05 14:30:38,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:30:38,588 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-05 14:30:38,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-05 14:30:38,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2025-02-05 14:30:38,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 39 treesize of output 37 [2025-02-05 14:30:38,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2025-02-05 14:30:38,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2025-02-05 14:30:38,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-02-05 14:30:38,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-05 14:30:38,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2025-02-05 14:30:38,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 74 [2025-02-05 14:30:38,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2025-02-05 14:30:38,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2025-02-05 14:30:38,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2025-02-05 14:30:38,949 INFO L349 Elim1Store]: treesize reduction 41, result has 26.8 percent of original size [2025-02-05 14:30:38,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 22 treesize of output 25 [2025-02-05 14:30:38,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2025-02-05 14:30:39,034 INFO L349 Elim1Store]: treesize reduction 38, result has 32.1 percent of original size [2025-02-05 14:30:39,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 28 [2025-02-05 14:30:43,167 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 1472 treesize of output 1362 [2025-02-05 14:30:43,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 73 [2025-02-05 14:30:43,188 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2025-02-05 14:30:43,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 85 [2025-02-05 14:30:43,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2025-02-05 14:30:43,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 60 treesize of output 63 [2025-02-05 14:30:43,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2025-02-05 14:30:43,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 51 treesize of output 54 [2025-02-05 14:30:43,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-05 14:30:43,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-05 14:30:43,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-05 14:30:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:30:43,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:30:43,652 INFO L349 Elim1Store]: treesize reduction 125, result has 41.9 percent of original size [2025-02-05 14:30:43,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1118 treesize of output 664 [2025-02-05 14:30:43,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 134 [2025-02-05 14:30:43,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 130 [2025-02-05 14:30:43,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:30:43,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 212 treesize of output 246 [2025-02-05 14:30:43,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-05 14:30:43,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-05 14:30:43,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-05 14:30:43,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:30:43,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2025-02-05 14:30:44,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:30:44,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-02-05 14:30:44,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:30:44,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2025-02-05 14:30:44,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:30:44,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 41 [2025-02-05 14:30:44,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:30:44,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-05 14:30:44,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:30:44,173 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-05 14:30:44,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2025-02-05 14:30:44,256 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:30:44,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:30:44,261 INFO L349 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2025-02-05 14:30:44,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 1 [2025-02-05 14:30:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:30:44,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941396949] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:30:44,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:30:44,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-02-05 14:30:44,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609110660] [2025-02-05 14:30:44,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:30:44,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 14:30:44,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:30:44,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 14:30:44,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1089, Unknown=4, NotChecked=0, Total=1190 [2025-02-05 14:30:44,416 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 35 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 28 states have internal predecessors, (56), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 14:30:53,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:30:58,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:31:02,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:31:06,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:31:10,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:31:12,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:31:16,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:31:20,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:31:21,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:31:21,508 INFO L93 Difference]: Finished difference Result 201 states and 242 transitions. [2025-02-05 14:31:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 14:31:21,509 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 28 states have internal predecessors, (56), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 28 [2025-02-05 14:31:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:31:21,510 INFO L225 Difference]: With dead ends: 201 [2025-02-05 14:31:21,510 INFO L226 Difference]: Without dead ends: 177 [2025-02-05 14:31:21,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=388, Invalid=2680, Unknown=12, NotChecked=0, Total=3080 [2025-02-05 14:31:21,512 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 532 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 152 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2025-02-05 14:31:21,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 876 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1263 Invalid, 29 Unknown, 0 Unchecked, 31.9s Time] [2025-02-05 14:31:21,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-02-05 14:31:21,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 116. [2025-02-05 14:31:21,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 95 states have internal predecessors, (116), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-05 14:31:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 144 transitions. [2025-02-05 14:31:21,533 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 144 transitions. Word has length 28 [2025-02-05 14:31:21,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:31:21,533 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 144 transitions. [2025-02-05 14:31:21,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 28 states have internal predecessors, (56), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 14:31:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2025-02-05 14:31:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 14:31:21,535 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:31:21,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:31:21,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 14:31:21,736 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 14:31:21,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:31:21,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:31:21,737 INFO L85 PathProgramCache]: Analyzing trace with hash 931039912, now seen corresponding path program 1 times [2025-02-05 14:31:21,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:31:21,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920940218] [2025-02-05 14:31:21,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:31:21,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:31:21,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 14:31:21,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 14:31:21,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:31:21,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:31:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:31:21,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:31:21,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920940218] [2025-02-05 14:31:21,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920940218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:31:21,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:31:21,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:31:21,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133128740] [2025-02-05 14:31:21,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:31:21,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:31:21,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:31:21,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:31:21,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:31:21,806 INFO L87 Difference]: Start difference. First operand 116 states and 144 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:31:21,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:31:21,828 INFO L93 Difference]: Finished difference Result 128 states and 161 transitions. [2025-02-05 14:31:21,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:31:21,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2025-02-05 14:31:21,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:31:21,831 INFO L225 Difference]: With dead ends: 128 [2025-02-05 14:31:21,831 INFO L226 Difference]: Without dead ends: 126 [2025-02-05 14:31:21,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:31:21,832 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:31:21,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:31:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-05 14:31:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2025-02-05 14:31:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 97 states have (on average 1.2577319587628866) internal successors, (122), 101 states have internal predecessors, (122), 14 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-02-05 14:31:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 156 transitions. [2025-02-05 14:31:21,849 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 156 transitions. Word has length 31 [2025-02-05 14:31:21,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:31:21,850 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 156 transitions. [2025-02-05 14:31:21,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 14:31:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 156 transitions. [2025-02-05 14:31:21,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 14:31:21,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:31:21,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:31:21,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 14:31:21,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:31:21,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:31:21,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1213255377, now seen corresponding path program 1 times [2025-02-05 14:31:21,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:31:21,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829601442] [2025-02-05 14:31:21,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:31:21,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:31:21,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 14:31:21,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 14:31:21,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:31:21,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:31:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:31:23,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:31:23,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829601442] [2025-02-05 14:31:23,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829601442] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:31:23,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832354309] [2025-02-05 14:31:23,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:31:23,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:31:23,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:31:23,637 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 14:31:23,639 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 14:31:23,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 14:31:23,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 14:31:23,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:31:23,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:31:23,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-02-05 14:31:23,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:31:24,080 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-05 14:31:24,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-02-05 14:31:24,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 14:31:24,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 14:31:24,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:24,578 INFO L349 Elim1Store]: treesize reduction 97, result has 30.2 percent of original size [2025-02-05 14:31:24,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 154 treesize of output 206 [2025-02-05 14:31:24,613 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-02-05 14:31:24,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 180 treesize of output 166 [2025-02-05 14:31:24,670 INFO L349 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2025-02-05 14:31:24,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 79 [2025-02-05 14:31:24,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:24,709 INFO L349 Elim1Store]: treesize reduction 42, result has 37.3 percent of original size [2025-02-05 14:31:24,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 88 [2025-02-05 14:31:24,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-05 14:31:24,770 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:31:24,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-02-05 14:31:24,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2025-02-05 14:31:24,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:24,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2025-02-05 14:31:24,907 INFO L349 Elim1Store]: treesize reduction 36, result has 50.7 percent of original size [2025-02-05 14:31:24,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2025-02-05 14:31:24,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:24,944 INFO L349 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2025-02-05 14:31:24,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 24 [2025-02-05 14:31:24,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 38 [2025-02-05 14:31:24,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:31:24,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-02-05 14:31:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:31:26,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:31:27,094 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_foo_~me~0#1.offset| 8)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_~#drvlist~0.base|))) (and (forall ((v_ArrVal_186 (Array Int Int)) (v_ldv_list_add_~head.offset_16 Int) (v_ArrVal_187 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| (select .cse2 v_ldv_list_add_~head.offset_16) v_ArrVal_186) |c_ULTIMATE.start_foo_~me~0#1.base| v_ArrVal_187))) (let ((.cse1 (store (select .cse0 |c_~#drvlist~0.base|) v_ldv_list_add_~head.offset_16 |c_ULTIMATE.start_foo_~me~0#1.base|))) (or (= |c_~#mutexes~0.base| (select (select (store .cse0 |c_~#drvlist~0.base| .cse1) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|)) (= |c_~#drvlist~0.base| (select .cse1 |c_~#drvlist~0.offset|)))))) (forall ((v_ArrVal_189 Int) (v_ldv_list_add_~head.offset_16 Int) (v___ldv_list_add_~next.offset_24 Int) (v_ArrVal_188 (Array Int Int))) (let ((.cse3 (select .cse2 v_ldv_list_add_~head.offset_16))) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (= |c_~#drvlist~0.base| (select (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_186) |c_ULTIMATE.start_foo_~me~0#1.base| v_ArrVal_187) |c_~#drvlist~0.base|) v_ldv_list_add_~head.offset_16 |c_ULTIMATE.start_foo_~me~0#1.base|) |c_~#drvlist~0.offset|))) (= (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| .cse3 (store (select |c_#memory_$Pointer$#1.offset| .cse3) (+ v___ldv_list_add_~next.offset_24 4) .cse5)) |c_ULTIMATE.start_foo_~me~0#1.base| v_ArrVal_188))) (store .cse4 |c_~#drvlist~0.base| (store (select .cse4 |c_~#drvlist~0.base|) v_ldv_list_add_~head.offset_16 v_ArrVal_189))) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|) |c_~#mutexes~0.offset|)))) (forall ((v_ArrVal_189 Int) (v_ldv_list_add_~head.offset_16 Int) (v___ldv_list_add_~next.offset_24 Int) (v_ArrVal_188 (Array Int Int))) (let ((.cse7 (store (let ((.cse8 (select .cse2 v_ldv_list_add_~head.offset_16))) (store |c_#memory_$Pointer$#1.offset| .cse8 (store (select |c_#memory_$Pointer$#1.offset| .cse8) (+ v___ldv_list_add_~next.offset_24 4) .cse5))) |c_ULTIMATE.start_foo_~me~0#1.base| v_ArrVal_188))) (let ((.cse6 (store (select .cse7 |c_~#drvlist~0.base|) v_ldv_list_add_~head.offset_16 v_ArrVal_189))) (or (= (select .cse6 |c_~#drvlist~0.offset|) |c_~#drvlist~0.offset|) (= (select (select (store .cse7 |c_~#drvlist~0.base| .cse6) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|) |c_~#mutexes~0.offset|))))) (forall ((v_ArrVal_186 (Array Int Int)) (v_ldv_list_add_~head.offset_16 Int) (v_ArrVal_187 (Array Int Int))) (let ((.cse9 (select .cse2 v_ldv_list_add_~head.offset_16))) (or (forall ((v_ArrVal_189 Int) (v___ldv_list_add_~next.offset_24 Int) (v_ArrVal_188 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$#1.offset| .cse9 (store (select |c_#memory_$Pointer$#1.offset| .cse9) (+ v___ldv_list_add_~next.offset_24 4) .cse5)) |c_ULTIMATE.start_foo_~me~0#1.base| v_ArrVal_188) |c_~#drvlist~0.base|) v_ldv_list_add_~head.offset_16 v_ArrVal_189) |c_~#drvlist~0.offset|) |c_~#drvlist~0.offset|)) (= |c_~#mutexes~0.base| (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_186) |c_ULTIMATE.start_foo_~me~0#1.base| v_ArrVal_187))) (store .cse10 |c_~#drvlist~0.base| (store (select .cse10 |c_~#drvlist~0.base|) v_ldv_list_add_~head.offset_16 |c_ULTIMATE.start_foo_~me~0#1.base|))) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))))))) is different from false [2025-02-05 14:31:27,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832354309] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:31:27,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:31:27,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2025-02-05 14:31:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066977081] [2025-02-05 14:31:27,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:31:27,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-05 14:31:27,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:31:27,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-05 14:31:27,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1034, Unknown=7, NotChecked=66, Total=1260 [2025-02-05 14:31:27,101 INFO L87 Difference]: Start difference. First operand 124 states and 156 transitions. Second operand has 31 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 24 states have internal predecessors, (45), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:31:31,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:31:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:31:48,187 INFO L93 Difference]: Finished difference Result 339 states and 450 transitions. [2025-02-05 14:31:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-05 14:31:48,188 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 24 states have internal predecessors, (45), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 32 [2025-02-05 14:31:48,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:31:48,190 INFO L225 Difference]: With dead ends: 339 [2025-02-05 14:31:48,190 INFO L226 Difference]: Without dead ends: 231 [2025-02-05 14:31:48,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=489, Invalid=3162, Unknown=13, NotChecked=118, Total=3782 [2025-02-05 14:31:48,192 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 336 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 142 mSolverCounterUnsat, 35 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 35 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:31:48,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 624 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1224 Invalid, 35 Unknown, 0 Unchecked, 6.4s Time] [2025-02-05 14:31:48,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-05 14:31:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 175. [2025-02-05 14:31:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 135 states have (on average 1.2592592592592593) internal successors, (170), 141 states have internal predecessors, (170), 22 states have call successors, (22), 12 states have call predecessors, (22), 15 states have return successors, (29), 21 states have call predecessors, (29), 22 states have call successors, (29) [2025-02-05 14:31:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 221 transitions. [2025-02-05 14:31:48,222 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 221 transitions. Word has length 32 [2025-02-05 14:31:48,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:31:48,222 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 221 transitions. [2025-02-05 14:31:48,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 24 states have internal predecessors, (45), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:31:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 221 transitions. [2025-02-05 14:31:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 14:31:48,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:31:48,223 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:31:48,233 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 14:31:48,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:31:48,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:31:48,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:31:48,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1907832900, now seen corresponding path program 2 times [2025-02-05 14:31:48,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:31:48,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950000587] [2025-02-05 14:31:48,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:31:48,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:31:48,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-02-05 14:31:48,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 14:31:48,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:31:48,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:31:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 14:31:51,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:31:51,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950000587] [2025-02-05 14:31:51,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950000587] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:31:51,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090471593] [2025-02-05 14:31:51,621 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:31:51,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:31:51,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:31:51,623 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 14:31:51,625 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 14:31:51,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-02-05 14:31:51,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 14:31:51,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:31:51,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:31:51,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-02-05 14:31:51,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:31:52,105 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:31:52,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-05 14:31:52,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2025-02-05 14:31:52,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2025-02-05 14:31:53,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2025-02-05 14:31:53,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2025-02-05 14:31:54,523 INFO L349 Elim1Store]: treesize reduction 461, result has 14.9 percent of original size [2025-02-05 14:31:54,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 10 new quantified variables, introduced 22 case distinctions, treesize of input 258 treesize of output 554 [2025-02-05 14:31:54,776 INFO L349 Elim1Store]: treesize reduction 160, result has 22.0 percent of original size [2025-02-05 14:31:54,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 234 treesize of output 316 [2025-02-05 14:31:54,968 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:31:54,973 INFO L224 Elim1Store]: Index analysis took 107 ms [2025-02-05 14:31:54,999 INFO L349 Elim1Store]: treesize reduction 199, result has 0.5 percent of original size [2025-02-05 14:31:55,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 87 treesize of output 51 [2025-02-05 14:31:55,138 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:31:55,149 INFO L349 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2025-02-05 14:31:55,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 29 [2025-02-05 14:31:55,463 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:31:55,468 INFO L224 Elim1Store]: Index analysis took 157 ms [2025-02-05 14:31:55,525 INFO L349 Elim1Store]: treesize reduction 199, result has 0.5 percent of original size [2025-02-05 14:31:55,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 87 treesize of output 51 [2025-02-05 14:31:55,735 INFO L349 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2025-02-05 14:31:55,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 11 [2025-02-05 14:31:55,872 INFO L349 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2025-02-05 14:31:55,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 11 [2025-02-05 14:31:56,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:56,036 INFO L349 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2025-02-05 14:31:56,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 11 [2025-02-05 14:31:56,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:56,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-05 14:31:56,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:56,651 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:31:56,668 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:31:56,675 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:31:56,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:56,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:56,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:56,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:56,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 358 [2025-02-05 14:31:56,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:56,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:56,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:56,835 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2025-02-05 14:31:56,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 165 [2025-02-05 14:31:56,934 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:31:56,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:56,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:56,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:57,041 INFO L349 Elim1Store]: treesize reduction 294, result has 3.9 percent of original size [2025-02-05 14:31:57,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 214 treesize of output 351 [2025-02-05 14:31:57,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:57,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:57,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:57,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:31:57,232 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2025-02-05 14:31:57,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 165 [2025-02-05 14:32:01,179 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:32:01,184 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:32:03,574 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-02-05 14:32:03,581 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 14:32:03,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:03,780 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-02-05 14:32:03,788 INFO L158 Benchmark]: Toolchain (without parser) took 87645.23ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 104.0MB in the beginning and 364.6MB in the end (delta: -260.6MB). Peak memory consumption was 421.3MB. Max. memory is 16.1GB. [2025-02-05 14:32:03,788 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 201.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:32:03,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.96ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 83.3MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 14:32:03,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.10ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 81.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:32:03,788 INFO L158 Benchmark]: Boogie Preprocessor took 54.13ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 76.2MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:32:03,788 INFO L158 Benchmark]: IcfgBuilder took 431.02ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 52.8MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 14:32:03,788 INFO L158 Benchmark]: TraceAbstraction took 86768.43ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 52.2MB in the beginning and 364.6MB in the end (delta: -312.5MB). Peak memory consumption was 371.0MB. Max. memory is 16.1GB. [2025-02-05 14:32:03,789 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.42ms. Allocated memory is still 201.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.96ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 83.3MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.10ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 81.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.13ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 76.2MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 431.02ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 52.8MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 86768.43ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 52.2MB in the beginning and 364.6MB in the end (delta: -312.5MB). Peak memory consumption was 371.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-02-05 14:32:03,998 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-02-05 14:32:04,003 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/ldv-sets/test_mutex_unbounded-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 10aecdd717bb6691571ad1da0b912f030832fb85361f767ea82293acfe046216 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:32:05,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:32:05,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 14:32:05,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:32:05,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:32:05,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:32:05,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:32:05,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:32:05,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:32:05,878 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:32:05,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:32:05,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:32:05,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:32:05,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:32:05,880 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:32:05,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:32:05,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:32:05,880 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:32:05,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:32:05,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:32:05,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:32:05,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:32:05,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:32:05,880 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 14:32:05,880 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 14:32:05,880 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 14:32:05,880 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:32:05,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:32:05,881 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:32:05,881 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:32:05,881 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:32:05,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:32:05,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:32:05,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:32:05,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:32:05,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:32:05,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:32:05,881 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:32:05,881 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:32:05,881 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 14:32:05,881 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 14:32:05,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:32:05,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:32:05,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:32:05,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:32:05,881 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 -> 10aecdd717bb6691571ad1da0b912f030832fb85361f767ea82293acfe046216 [2025-02-05 14:32:06,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:32:06,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:32:06,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:32:06,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:32:06,129 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:32:06,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2025-02-05 14:32:07,297 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8eee44f9a/9f2d71a510eb4a809b9de56aa67fbad1/FLAG70674e346 [2025-02-05 14:32:07,561 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:32:07,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2025-02-05 14:32:07,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8eee44f9a/9f2d71a510eb4a809b9de56aa67fbad1/FLAG70674e346 [2025-02-05 14:32:07,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8eee44f9a/9f2d71a510eb4a809b9de56aa67fbad1 [2025-02-05 14:32:07,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:32:07,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:32:07,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:32:07,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:32:07,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:32:07,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:32:07" (1/1) ... [2025-02-05 14:32:07,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c88c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:07, skipping insertion in model container [2025-02-05 14:32:07,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:32:07" (1/1) ... [2025-02-05 14:32:07,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:32:08,114 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-05 14:32:08,128 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/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2025-02-05 14:32:08,131 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/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2025-02-05 14:32:08,136 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/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2025-02-05 14:32:08,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:32:08,159 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-02-05 14:32:08,164 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:32:08,196 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-05 14:32:08,208 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/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2025-02-05 14:32:08,208 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/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2025-02-05 14:32:08,209 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/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2025-02-05 14:32:08,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:32:08,222 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:32:08,269 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/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2025-02-05 14:32:08,270 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/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2025-02-05 14:32:08,271 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/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2025-02-05 14:32:08,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:32:08,310 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:32:08,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:08 WrapperNode [2025-02-05 14:32:08,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:32:08,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:32:08,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:32:08,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:32:08,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:08" (1/1) ... [2025-02-05 14:32:08,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:08" (1/1) ... [2025-02-05 14:32:08,354 INFO L138 Inliner]: procedures = 143, calls = 62, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 169 [2025-02-05 14:32:08,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:32:08,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:32:08,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:32:08,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:32:08,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:08" (1/1) ... [2025-02-05 14:32:08,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:08" (1/1) ... [2025-02-05 14:32:08,372 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:08" (1/1) ... [2025-02-05 14:32:08,402 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 7 writes are split as follows [0, 7]. [2025-02-05 14:32:08,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:08" (1/1) ... [2025-02-05 14:32:08,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:08" (1/1) ... [2025-02-05 14:32:08,420 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:08" (1/1) ... [2025-02-05 14:32:08,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:08" (1/1) ... [2025-02-05 14:32:08,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:08" (1/1) ... [2025-02-05 14:32:08,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:08" (1/1) ... [2025-02-05 14:32:08,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:32:08,430 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:32:08,430 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:32:08,430 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:32:08,431 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:08" (1/1) ... [2025-02-05 14:32:08,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:32:08,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:08,454 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 14:32:08,456 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 14:32:08,475 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2025-02-05 14:32:08,475 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2025-02-05 14:32:08,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2025-02-05 14:32:08,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2025-02-05 14:32:08,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:32:08,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:32:08,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:32:08,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:32:08,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2025-02-05 14:32:08,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2025-02-05 14:32:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:32:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:32:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:32:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 14:32:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 14:32:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 14:32:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-05 14:32:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2025-02-05 14:32:08,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2025-02-05 14:32:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:32:08,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:32:08,609 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:32:08,610 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:32:08,881 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L667: havoc ldv_set_empty_#t~ret31#1; [2025-02-05 14:32:08,881 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: havoc ldv_list_empty_#t~mem10#1.base, ldv_list_empty_#t~mem10#1.offset; [2025-02-05 14:32:08,978 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-02-05 14:32:08,978 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:32:08,993 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:32:08,993 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:32:08,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:32:08 BoogieIcfgContainer [2025-02-05 14:32:08,994 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:32:09,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:32:09,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:32:09,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:32:09,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:32:07" (1/3) ... [2025-02-05 14:32:09,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34be33b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:32:09, skipping insertion in model container [2025-02-05 14:32:09,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:32:08" (2/3) ... [2025-02-05 14:32:09,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34be33b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:32:09, skipping insertion in model container [2025-02-05 14:32:09,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:32:08" (3/3) ... [2025-02-05 14:32:09,007 INFO L128 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-1.i [2025-02-05 14:32:09,018 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:32:09,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_mutex_unbounded-1.i that has 5 procedures, 63 locations, 1 initial locations, 5 loop locations, and 3 error locations. [2025-02-05 14:32:09,059 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:32:09,074 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;@53424a62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:32:09,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-05 14:32:09,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 50 states have internal predecessors, (62), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:32:09,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 14:32:09,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:09,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:09,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:09,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:09,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1743513595, now seen corresponding path program 1 times [2025-02-05 14:32:09,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:32:09,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [69491941] [2025-02-05 14:32:09,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:09,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:09,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:09,121 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 14:32:09,122 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 14:32:09,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 14:32:09,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 14:32:09,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:09,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:09,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 14:32:09,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:09,311 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 14:32:09,312 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:32:09,312 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:32:09,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69491941] [2025-02-05 14:32:09,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69491941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:09,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:09,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:32:09,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395632053] [2025-02-05 14:32:09,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:09,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 14:32:09,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:32:09,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 14:32:09,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:32:09,327 INFO L87 Difference]: Start difference. First operand has 63 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 50 states have internal predecessors, (62), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14:32:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:09,724 INFO L93 Difference]: Finished difference Result 171 states and 221 transitions. [2025-02-05 14:32:09,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:32:09,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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) Word has length 10 [2025-02-05 14:32:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:09,730 INFO L225 Difference]: With dead ends: 171 [2025-02-05 14:32:09,730 INFO L226 Difference]: Without dead ends: 98 [2025-02-05 14:32:09,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 14:32:09,733 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 53 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:09,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 255 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 14:32:09,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-05 14:32:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2025-02-05 14:32:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 64 states have internal predecessors, (81), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 14:32:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2025-02-05 14:32:09,789 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 10 [2025-02-05 14:32:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:09,790 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2025-02-05 14:32:09,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14:32:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2025-02-05 14:32:09,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 14:32:09,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:09,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:09,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 14:32:09,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:09,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:09,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:09,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1903122020, now seen corresponding path program 1 times [2025-02-05 14:32:09,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:32:09,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1665577217] [2025-02-05 14:32:09,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:09,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:09,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:09,999 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 14:32:10,000 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 14:32:10,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 14:32:10,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 14:32:10,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:10,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:10,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 14:32:10,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:10,086 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 14:32:10,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:32:10,087 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:32:10,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665577217] [2025-02-05 14:32:10,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665577217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:10,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:10,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:32:10,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054025132] [2025-02-05 14:32:10,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:10,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:32:10,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:32:10,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:32:10,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:32:10,089 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 14:32:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:10,110 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2025-02-05 14:32:10,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:32:10,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2025-02-05 14:32:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:10,113 INFO L225 Difference]: With dead ends: 89 [2025-02-05 14:32:10,113 INFO L226 Difference]: Without dead ends: 87 [2025-02-05 14:32:10,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:32:10,113 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:10,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:32:10,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-05 14:32:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-05 14:32:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 68 states have internal predecessors, (85), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2025-02-05 14:32:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2025-02-05 14:32:10,128 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 12 [2025-02-05 14:32:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:10,128 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2025-02-05 14:32:10,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 14:32:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2025-02-05 14:32:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 14:32:10,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:10,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:10,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 14:32:10,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:10,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:10,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:10,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1270961980, now seen corresponding path program 1 times [2025-02-05 14:32:10,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:32:10,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [567297871] [2025-02-05 14:32:10,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:10,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:10,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:10,332 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 14:32:10,334 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 14:32:10,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 14:32:10,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 14:32:10,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:10,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:10,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 14:32:10,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:10,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 14:32:10,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-05 14:32:10,467 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 14:32:10,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:32:10,467 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:32:10,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567297871] [2025-02-05 14:32:10,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567297871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:32:10,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:32:10,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:32:10,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035916993] [2025-02-05 14:32:10,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:32:10,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:32:10,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:32:10,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:32:10,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:32:10,468 INFO L87 Difference]: Start difference. First operand 87 states and 113 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 14:32:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:32:10,865 INFO L93 Difference]: Finished difference Result 153 states and 192 transitions. [2025-02-05 14:32:10,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:32:10,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2025-02-05 14:32:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:32:10,867 INFO L225 Difference]: With dead ends: 153 [2025-02-05 14:32:10,867 INFO L226 Difference]: Without dead ends: 73 [2025-02-05 14:32:10,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:32:10,868 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 13 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:32:10,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 163 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 14:32:10,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-05 14:32:10,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2025-02-05 14:32:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-05 14:32:10,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2025-02-05 14:32:10,874 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 13 [2025-02-05 14:32:10,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:32:10,874 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2025-02-05 14:32:10,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 14:32:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2025-02-05 14:32:10,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 14:32:10,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:32:10,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:32:10,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 14:32:11,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:11,076 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:32:11,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:32:11,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1900906071, now seen corresponding path program 1 times [2025-02-05 14:32:11,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 14:32:11,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1458932182] [2025-02-05 14:32:11,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:32:11,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:32:11,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:32:11,081 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 14:32:11,082 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 14:32:11,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 14:32:11,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 14:32:11,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:32:11,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:32:11,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 14:32:11,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:32:11,286 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-05 14:32:11,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-02-05 14:32:11,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:11,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-05 14:32:11,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-02-05 14:32:11,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 44 [2025-02-05 14:32:11,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-02-05 14:32:11,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2025-02-05 14:32:11,432 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:32:11,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2025-02-05 14:32:11,451 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:32:11,456 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 27 treesize of output 17 [2025-02-05 14:32:11,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-02-05 14:32:11,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2025-02-05 14:32:11,477 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:32:11,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 17 [2025-02-05 14:32:11,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-05 14:32:11,588 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 16 treesize of output 8 [2025-02-05 14:32:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:11,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:32:12,038 INFO L349 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2025-02-05 14:32:12,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 394 treesize of output 337 [2025-02-05 14:32:12,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:32:12,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 255 [2025-02-05 14:32:12,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 236 [2025-02-05 14:32:12,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 194 [2025-02-05 14:32:12,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-05 14:32:12,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-05 14:32:12,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-02-05 14:32:12,512 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:32:12,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:32:12,517 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-05 14:32:12,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 1 [2025-02-05 14:32:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:32:12,664 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 14:32:12,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458932182] [2025-02-05 14:32:12,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458932182] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:32:12,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:32:12,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2025-02-05 14:32:12,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785003482] [2025-02-05 14:32:12,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:32:12,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 14:32:12,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 14:32:12,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 14:32:12,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2025-02-05 14:32:12,666 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 25 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 19 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)