./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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-2.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 52ed361cdf08860b8c7c7d564ef95393de2d3a38663ac135cf0da9ded1f39b3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:03:43,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:03:43,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:03:43,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:03:43,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:03:43,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:03:43,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:03:43,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:03:43,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:03:43,171 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:03:43,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:03:43,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:03:43,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:03:43,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:03:43,171 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:03:43,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:03:43,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:03:43,172 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:03:43,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:03:43,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:03:43,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:03:43,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:03:43,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:03:43,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:03:43,172 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:03:43,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:03:43,173 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:03:43,173 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:03:43,173 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:03:43,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:03:43,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:03:43,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:03:43,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:03:43,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:03:43,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:03:43,174 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:03:43,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:03:43,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:03:43,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:03:43,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:03:43,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:03:43,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:03:43,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:03:43,174 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 -> 52ed361cdf08860b8c7c7d564ef95393de2d3a38663ac135cf0da9ded1f39b3f [2025-02-07 20:03:43,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:03:43,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:03:43,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:03:43,395 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:03:43,395 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:03:43,396 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-2.i [2025-02-07 20:03:44,651 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0187be9c/8a0ec799e9a64c77a640225532281be0/FLAGf93a3e4e9 [2025-02-07 20:03:44,988 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:03:44,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i [2025-02-07 20:03:45,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0187be9c/8a0ec799e9a64c77a640225532281be0/FLAGf93a3e4e9 [2025-02-07 20:03:45,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0187be9c/8a0ec799e9a64c77a640225532281be0 [2025-02-07 20:03:45,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:03:45,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:03:45,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:03:45,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:03:45,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:03:45,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:03:45" (1/1) ... [2025-02-07 20:03:45,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bb3c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:45, skipping insertion in model container [2025-02-07 20:03:45,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:03:45" (1/1) ... [2025-02-07 20:03:45,261 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:03:45,507 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-2.i[26271,26284] [2025-02-07 20:03:45,512 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-2.i[26396,26409] [2025-02-07 20:03:45,513 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-2.i[26511,26524] [2025-02-07 20:03:45,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:03:45,529 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:03:45,568 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-2.i[26271,26284] [2025-02-07 20:03:45,569 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-2.i[26396,26409] [2025-02-07 20:03:45,569 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-2.i[26511,26524] [2025-02-07 20:03:45,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:03:45,591 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:03:45,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:45 WrapperNode [2025-02-07 20:03:45,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:03:45,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:03:45,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:03:45,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:03:45,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:45" (1/1) ... [2025-02-07 20:03:45,613 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:45" (1/1) ... [2025-02-07 20:03:45,627 INFO L138 Inliner]: procedures = 142, calls = 63, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 175 [2025-02-07 20:03:45,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:03:45,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:03:45,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:03:45,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:03:45,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:45" (1/1) ... [2025-02-07 20:03:45,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:45" (1/1) ... [2025-02-07 20:03:45,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:45" (1/1) ... [2025-02-07 20:03:45,669 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-07 20:03:45,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:45" (1/1) ... [2025-02-07 20:03:45,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:45" (1/1) ... [2025-02-07 20:03:45,677 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:45" (1/1) ... [2025-02-07 20:03:45,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:45" (1/1) ... [2025-02-07 20:03:45,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:45" (1/1) ... [2025-02-07 20:03:45,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:45" (1/1) ... [2025-02-07 20:03:45,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:03:45,687 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:03:45,687 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:03:45,687 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:03:45,691 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:45" (1/1) ... [2025-02-07 20:03:45,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:03:45,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:03:45,720 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-07 20:03:45,727 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-07 20:03:45,745 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2025-02-07 20:03:45,745 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2025-02-07 20:03:45,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2025-02-07 20:03:45,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2025-02-07 20:03:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:03:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:03:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:03:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:03:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2025-02-07 20:03:45,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2025-02-07 20:03:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:03:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:03:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:03:45,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 20:03:45,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 20:03:45,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2025-02-07 20:03:45,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2025-02-07 20:03:45,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:03:45,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:03:45,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2025-02-07 20:03:45,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2025-02-07 20:03:45,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:03:45,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:03:45,868 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:03:45,871 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:03:46,090 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L667: havoc ldv_set_empty_#t~ret31#1; [2025-02-07 20:03:46,090 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: havoc ldv_list_empty_#t~mem10#1.base, ldv_list_empty_#t~mem10#1.offset; [2025-02-07 20:03:46,137 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-02-07 20:03:46,137 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:03:46,143 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:03:46,143 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:03:46,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:03:46 BoogieIcfgContainer [2025-02-07 20:03:46,144 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:03:46,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:03:46,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:03:46,149 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:03:46,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:03:45" (1/3) ... [2025-02-07 20:03:46,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3362110e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:03:46, skipping insertion in model container [2025-02-07 20:03:46,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:03:45" (2/3) ... [2025-02-07 20:03:46,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3362110e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:03:46, skipping insertion in model container [2025-02-07 20:03:46,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:03:46" (3/3) ... [2025-02-07 20:03:46,151 INFO L128 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-2.i [2025-02-07 20:03:46,164 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:03:46,165 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_mutex_unbounded-2.i that has 6 procedures, 64 locations, 1 initial locations, 5 loop locations, and 3 error locations. [2025-02-07 20:03:46,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:03:46,220 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;@39424dbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:03:46,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-07 20:03:46,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 48 states have internal predecessors, (60), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 20:03:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 20:03:46,231 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:46,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:03:46,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:46,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:46,236 INFO L85 PathProgramCache]: Analyzing trace with hash 132497927, now seen corresponding path program 1 times [2025-02-07 20:03:46,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:46,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526829158] [2025-02-07 20:03:46,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:46,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:46,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 20:03:46,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 20:03:46,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:46,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:46,712 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-07 20:03:46,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:46,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526829158] [2025-02-07 20:03:46,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526829158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:03:46,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:03:46,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:03:46,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570706930] [2025-02-07 20:03:46,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:03:46,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:03:46,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:46,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:03:46,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:03:46,734 INFO L87 Difference]: Start difference. First operand has 64 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 48 states have internal predecessors, (60), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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-07 20:03:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:46,990 INFO L93 Difference]: Finished difference Result 176 states and 230 transitions. [2025-02-07 20:03:46,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:03:46,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2025-02-07 20:03:46,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:46,997 INFO L225 Difference]: With dead ends: 176 [2025-02-07 20:03:46,997 INFO L226 Difference]: Without dead ends: 104 [2025-02-07 20:03:46,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:03:47,001 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 54 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:47,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 274 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:03:47,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-07 20:03:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 81. [2025-02-07 20:03:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 62 states have internal predecessors, (77), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-07 20:03:47,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2025-02-07 20:03:47,033 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 8 [2025-02-07 20:03:47,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:47,034 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2025-02-07 20:03:47,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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-07 20:03:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2025-02-07 20:03:47,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 20:03:47,035 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:47,035 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:03:47,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:03:47,035 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:47,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:47,036 INFO L85 PathProgramCache]: Analyzing trace with hash 531587700, now seen corresponding path program 1 times [2025-02-07 20:03:47,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:47,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917198820] [2025-02-07 20:03:47,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:47,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:47,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 20:03:47,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 20:03:47,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:47,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:47,109 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-07 20:03:47,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:47,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917198820] [2025-02-07 20:03:47,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917198820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:03:47,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:03:47,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:03:47,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025010335] [2025-02-07 20:03:47,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:03:47,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:03:47,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:47,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:03:47,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:03:47,113 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:03:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:47,201 INFO L93 Difference]: Finished difference Result 148 states and 181 transitions. [2025-02-07 20:03:47,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:03:47,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-07 20:03:47,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:47,202 INFO L225 Difference]: With dead ends: 148 [2025-02-07 20:03:47,202 INFO L226 Difference]: Without dead ends: 73 [2025-02-07 20:03:47,202 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-07 20:03:47,203 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 13 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:47,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 178 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:03:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-07 20:03:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2025-02-07 20:03:47,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 51 states have internal predecessors, (58), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-07 20:03:47,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2025-02-07 20:03:47,208 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 11 [2025-02-07 20:03:47,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:47,209 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2025-02-07 20:03:47,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:03:47,209 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2025-02-07 20:03:47,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 20:03:47,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:47,209 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] [2025-02-07 20:03:47,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:03:47,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:47,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:47,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1820697950, now seen corresponding path program 1 times [2025-02-07 20:03:47,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:47,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967802386] [2025-02-07 20:03:47,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:47,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:47,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 20:03:47,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 20:03:47,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:47,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:47,571 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-07 20:03:47,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:47,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967802386] [2025-02-07 20:03:47,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967802386] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:03:47,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021885767] [2025-02-07 20:03:47,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:47,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:03:47,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:03:47,574 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-07 20:03:47,579 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-07 20:03:47,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 20:03:47,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 20:03:47,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:47,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:47,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-07 20:03:47,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:03:47,792 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:03:47,793 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-07 20:03:47,899 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-07 20:03:47,909 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-07 20:03:47,927 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-07 20:03:47,932 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-07 20:03:47,937 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-07 20:03:47,941 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 17 [2025-02-07 20:03:47,944 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 0 case distinctions, treesize of input 49 treesize of output 28 [2025-02-07 20:03:47,954 INFO L349 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2025-02-07 20:03:47,954 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 1 case distinctions, treesize of input 16 treesize of output 20 [2025-02-07 20:03:47,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:47,962 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 7 [2025-02-07 20:03:47,967 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-07 20:03:48,005 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2025-02-07 20:03:48,005 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 18 treesize of output 26 [2025-02-07 20:03:48,031 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-07 20:03:48,047 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2025-02-07 20:03:48,048 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 18 treesize of output 30 [2025-02-07 20:03:48,099 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-07 20:03:48,111 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-07 20:03:48,135 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-07 20:03:48,141 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 55 [2025-02-07 20:03:48,150 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 14 treesize of output 13 [2025-02-07 20:03:48,158 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2025-02-07 20:03:48,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 46 [2025-02-07 20:03:48,181 INFO L349 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2025-02-07 20:03:48,181 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2025-02-07 20:03:48,199 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 13 treesize of output 17 [2025-02-07 20:03:48,207 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-07 20:03:49,358 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 438 treesize of output 406 [2025-02-07 20:03:49,364 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 70 treesize of output 58 [2025-02-07 20:03:49,371 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 58 treesize of output 61 [2025-02-07 20:03:49,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:49,376 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 59 treesize of output 51 [2025-02-07 20:03:49,379 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-07 20:03:49,390 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-07 20:03:49,413 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-07 20:03:49,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:03:49,672 INFO L349 Elim1Store]: treesize reduction 136, result has 36.7 percent of original size [2025-02-07 20:03:49,673 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 554 treesize of output 361 [2025-02-07 20:03:49,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:49,729 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 235 treesize of output 259 [2025-02-07 20:03:49,741 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-07 20:03:49,750 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-07 20:03:49,931 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-07 20:03:49,961 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-07 20:03:49,990 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-07 20:03:50,032 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-07 20:03:50,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:50,054 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 47 treesize of output 51 [2025-02-07 20:03:50,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:03:50,090 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 39 treesize of output 43 [2025-02-07 20:03:50,172 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:03:50,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:03:50,177 INFO L349 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2025-02-07 20:03:50,178 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-07 20:03:50,296 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-07 20:03:50,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021885767] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:03:50,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:03:50,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2025-02-07 20:03:50,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361633798] [2025-02-07 20:03:50,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:03:50,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-07 20:03:50,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:50,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-07 20:03:50,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2025-02-07 20:03:50,299 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 31 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 24 states have internal predecessors, (44), 7 states have call successors, (8), 5 states have call predecessors, (8), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-07 20:03:54,500 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-07 20:03:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:56,147 INFO L93 Difference]: Finished difference Result 153 states and 183 transitions. [2025-02-07 20:03:56,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-07 20:03:56,148 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 24 states have internal predecessors, (44), 7 states have call successors, (8), 5 states have call predecessors, (8), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 26 [2025-02-07 20:03:56,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:56,149 INFO L225 Difference]: With dead ends: 153 [2025-02-07 20:03:56,149 INFO L226 Difference]: Without dead ends: 128 [2025-02-07 20:03:56,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=318, Invalid=2116, Unknown=16, NotChecked=0, Total=2450 [2025-02-07 20:03:56,150 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 413 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 151 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:56,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 548 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 931 Invalid, 36 Unknown, 0 Unchecked, 5.2s Time] [2025-02-07 20:03:56,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-07 20:03:56,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2025-02-07 20:03:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 80 states have internal predecessors, (95), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-07 20:03:56,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 127 transitions. [2025-02-07 20:03:56,167 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 127 transitions. Word has length 26 [2025-02-07 20:03:56,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:56,167 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 127 transitions. [2025-02-07 20:03:56,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 24 states have internal predecessors, (44), 7 states have call successors, (8), 5 states have call predecessors, (8), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-07 20:03:56,167 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2025-02-07 20:03:56,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 20:03:56,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:56,169 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] [2025-02-07 20:03:56,179 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-07 20:03:56,373 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-07 20:03:56,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:56,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:56,374 INFO L85 PathProgramCache]: Analyzing trace with hash -368563267, now seen corresponding path program 1 times [2025-02-07 20:03:56,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:56,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244950155] [2025-02-07 20:03:56,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:56,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:56,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 20:03:56,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 20:03:56,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:56,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:56,442 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-07 20:03:56,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:56,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244950155] [2025-02-07 20:03:56,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244950155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:03:56,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:03:56,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:03:56,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087412527] [2025-02-07 20:03:56,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:03:56,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:03:56,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:56,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:03:56,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:03:56,447 INFO L87 Difference]: Start difference. First operand 104 states and 127 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-07 20:03:56,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:56,464 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2025-02-07 20:03:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:03:56,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 29 [2025-02-07 20:03:56,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:56,466 INFO L225 Difference]: With dead ends: 116 [2025-02-07 20:03:56,467 INFO L226 Difference]: Without dead ends: 114 [2025-02-07 20:03:56,468 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-07 20:03:56,468 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 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-07 20:03:56,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:03:56,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-07 20:03:56,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2025-02-07 20:03:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 86 states have internal predecessors, (101), 16 states have call successors, (16), 10 states have call predecessors, (16), 12 states have return successors, (21), 15 states have call predecessors, (21), 16 states have call successors, (21) [2025-02-07 20:03:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2025-02-07 20:03:56,488 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 29 [2025-02-07 20:03:56,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:56,488 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2025-02-07 20:03:56,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-07 20:03:56,488 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2025-02-07 20:03:56,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-07 20:03:56,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:56,490 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] [2025-02-07 20:03:56,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:03:56,490 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:56,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1445084530, now seen corresponding path program 1 times [2025-02-07 20:03:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:56,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367407066] [2025-02-07 20:03:56,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:56,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:56,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-07 20:03:56,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 20:03:56,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:56,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:58,092 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-07 20:03:58,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:58,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367407066] [2025-02-07 20:03:58,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367407066] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:03:58,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125719542] [2025-02-07 20:03:58,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:03:58,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:03:58,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:03:58,098 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-07 20:03:58,099 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-07 20:03:58,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-07 20:03:58,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 20:03:58,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:03:58,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:58,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-02-07 20:03:58,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:03:58,474 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-07 20:03:58,474 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-07 20:03:58,584 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-07 20:04:02,646 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2025-02-07 20:04:02,656 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 12 treesize of output 1 [2025-02-07 20:04:02,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:04:02,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 48 [2025-02-07 20:04:02,668 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 42 treesize of output 43 [2025-02-07 20:04:02,677 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-07 20:04:02,690 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 5 treesize of output 3 [2025-02-07 20:04:04,481 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-07 20:04:04,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:04:06,179 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_~#drvlist~0.base|) |c_~#drvlist~0.offset|))) (let ((.cse5 (+ |c_ULTIMATE.start_foo_~me~0#1.offset| 12)) (.cse6 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse4 (+ |c_ULTIMATE.start_foo_~me~0#1.offset| 8))) (and (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_190 (Array Int Int)) (v___ldv_list_add_~next.offset_25 Int) (v_ArrVal_193 Int) (v_ArrVal_192 Int) (v_ArrVal_189 (Array Int Int))) (let ((.cse1 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_191))) (store .cse8 |c_ULTIMATE.start_foo_~me~0#1.base| (store (store (select .cse8 |c_ULTIMATE.start_foo_~me~0#1.base|) .cse4 .cse2) .cse5 v_ArrVal_193))))) (store .cse7 |c_~#drvlist~0.base| (store (select .cse7 |c_~#drvlist~0.base|) |c_~#drvlist~0.offset| |c_ULTIMATE.start_foo_~me~0#1.base|))))) (let ((.cse0 (select (select .cse1 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (or (= |c_~#mutexes~0.base| .cse0) (not (= (select (select .cse1 .cse0) (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_190) |c_ULTIMATE.start_foo_~me~0#1.base| v_ArrVal_189) |c_~#drvlist~0.base| (store (select (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse2 (store .cse6 (+ v___ldv_list_add_~next.offset_25 4) v_ArrVal_192)))) (store .cse3 |c_ULTIMATE.start_foo_~me~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_foo_~me~0#1.base|) .cse4 v___ldv_list_add_~next.offset_25) .cse5 |c_~#drvlist~0.offset|))) |c_~#drvlist~0.base|) |c_~#drvlist~0.offset| .cse4)) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|) (- 4))) |c_ULTIMATE.start_foo_~me~0#1.base|)))))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_190 (Array Int Int)) (v___ldv_list_add_~next.offset_25 Int) (v_ArrVal_193 Int) (v_ArrVal_192 Int) (v_ArrVal_189 (Array Int Int))) (let ((.cse9 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_190) |c_ULTIMATE.start_foo_~me~0#1.base| v_ArrVal_189) |c_~#drvlist~0.base| (store (select (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| .cse2 (store .cse6 (+ v___ldv_list_add_~next.offset_25 4) v_ArrVal_192)))) (store .cse13 |c_ULTIMATE.start_foo_~me~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_foo_~me~0#1.base|) .cse4 v___ldv_list_add_~next.offset_25) .cse5 |c_~#drvlist~0.offset|))) |c_~#drvlist~0.base|) |c_~#drvlist~0.offset| .cse4)) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (or (= .cse9 |c_~#mutexes~0.offset|) (not (= (select (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_191))) (store .cse12 |c_ULTIMATE.start_foo_~me~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_foo_~me~0#1.base|) .cse4 .cse2) .cse5 v_ArrVal_193))))) (store .cse11 |c_~#drvlist~0.base| (store (select .cse11 |c_~#drvlist~0.base|) |c_~#drvlist~0.offset| |c_ULTIMATE.start_foo_~me~0#1.base|))))) (select .cse10 (select (select .cse10 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (+ .cse9 (- 4))) |c_ULTIMATE.start_foo_~me~0#1.base|)))))))) is different from false [2025-02-07 20:04:06,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125719542] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:04:06,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:04:06,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2025-02-07 20:04:06,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39054206] [2025-02-07 20:04:06,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:04:06,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-07 20:04:06,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:04:06,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-07 20:04:06,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1226, Unknown=4, NotChecked=72, Total=1482 [2025-02-07 20:04:06,199 INFO L87 Difference]: Start difference. First operand 112 states and 138 transitions. Second operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 24 states have internal predecessors, (41), 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-07 20:04:06,879 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c___ldv_list_add_#in~prev.base| |c___ldv_list_add_#in~new.base|))) (let ((.cse2 (+ |c___ldv_list_add_#in~new.offset| 4)) (.cse4 (not .cse7))) (and (let ((.cse3 (= .cse2 |c___ldv_list_add_#in~prev.offset|))) (or (and (exists ((v_ArrVal_149 (Array Int Int))) (= |c_#memory_$Pointer$#1.base| (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| v_ArrVal_149))) (store .cse1 |c___ldv_list_add_#in~new.base| (store (store (select .cse1 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) .cse2 (select (select |c_#memory_$Pointer$#1.base| |c___ldv_list_add_#in~new.base|) .cse2)))))) (store .cse0 |c___ldv_list_add_#in~prev.base| (store (select .cse0 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))))) (or (not .cse3) .cse4)) (and (exists ((v_ArrVal_149 (Array Int Int))) (= (let ((.cse5 (let ((.cse6 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| v_ArrVal_149))) (store .cse6 |c___ldv_list_add_#in~new.base| (store (select .cse6 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|))))) (store .cse5 |c___ldv_list_add_#in~prev.base| (store (select .cse5 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$#1.base|)) .cse7 .cse3))) (= |c_#valid| |c_old(#valid)|) (= |c_~#mutexes~0.offset| 0) (let ((.cse14 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base|)) (.cse13 (select |c_old(#memory_$Pointer$#1.offset)| |c___ldv_list_add_#in~next.base|))) (let ((.cse8 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~prev.base|)) (.cse9 (or (and (exists ((v___ldv_list_add_~next.offset_18 Int) (v_ArrVal_152 Int)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse16 (store |c_old(#memory_$Pointer$#1.offset)| |c___ldv_list_add_#in~next.base| (store .cse13 (+ v___ldv_list_add_~next.offset_18 4) v_ArrVal_152)))) (store .cse16 |c___ldv_list_add_#in~new.base| (store (store (select .cse16 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| v___ldv_list_add_~next.offset_18) .cse2 |c___ldv_list_add_#in~prev.offset|))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)))) .cse7) (and (exists ((v___ldv_list_add_~next.offset_18 Int) (v_ArrVal_152 Int)) (= |c_#memory_$Pointer$#1.offset| (store (store |c_old(#memory_$Pointer$#1.offset)| |c___ldv_list_add_#in~new.base| .cse14) |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse17 (store |c_old(#memory_$Pointer$#1.offset)| |c___ldv_list_add_#in~next.base| (store .cse13 (+ v___ldv_list_add_~next.offset_18 4) v_ArrVal_152)))) (store .cse17 |c___ldv_list_add_#in~new.base| (store (store (select .cse17 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| v___ldv_list_add_~next.offset_18) .cse2 |c___ldv_list_add_#in~prev.offset|))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)))) .cse4))) (.cse10 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~new.base|))) (or (and .cse8 .cse9) (and (not .cse8) (not .cse10) (let ((.cse11 (store |c_old(#memory_$Pointer$#1.offset)| |c___ldv_list_add_#in~next.base| (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base|)))) (or (and (exists ((v___ldv_list_add_~next.offset_18 Int) (v_ArrVal_152 Int)) (= |c_#memory_$Pointer$#1.offset| (store .cse11 |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse12 (store |c_old(#memory_$Pointer$#1.offset)| |c___ldv_list_add_#in~next.base| (store .cse13 (+ v___ldv_list_add_~next.offset_18 4) v_ArrVal_152)))) (store .cse12 |c___ldv_list_add_#in~new.base| (store (store (select .cse12 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| v___ldv_list_add_~next.offset_18) .cse2 |c___ldv_list_add_#in~prev.offset|))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)))) .cse7) (and (exists ((v___ldv_list_add_~next.offset_18 Int) (v_ArrVal_152 Int)) (= (store (store .cse11 |c___ldv_list_add_#in~new.base| .cse14) |c___ldv_list_add_#in~prev.base| (store (select (let ((.cse15 (store |c_old(#memory_$Pointer$#1.offset)| |c___ldv_list_add_#in~next.base| (store .cse13 (+ v___ldv_list_add_~next.offset_18 4) v_ArrVal_152)))) (store .cse15 |c___ldv_list_add_#in~new.base| (store (store (select .cse15 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| v___ldv_list_add_~next.offset_18) .cse2 |c___ldv_list_add_#in~prev.offset|))) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)) |c_#memory_$Pointer$#1.offset|)) .cse4)))) (and .cse9 .cse10)))) (= 3 |c_~#mutexes~0.base|) (= |c_~#drvlist~0.base| 4)))) is different from true [2025-02-07 20:04:24,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:04:24,937 INFO L93 Difference]: Finished difference Result 277 states and 350 transitions. [2025-02-07 20:04:24,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-07 20:04:24,937 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 24 states have internal predecessors, (41), 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 30 [2025-02-07 20:04:24,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:04:24,939 INFO L225 Difference]: With dead ends: 277 [2025-02-07 20:04:24,940 INFO L226 Difference]: Without dead ends: 180 [2025-02-07 20:04:24,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=552, Invalid=3721, Unknown=25, NotChecked=258, Total=4556 [2025-02-07 20:04:24,945 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 183 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 90 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2025-02-07 20:04:24,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 591 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1416 Invalid, 10 Unknown, 29 Unchecked, 14.6s Time] [2025-02-07 20:04:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-07 20:04:24,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 149. [2025-02-07 20:04:24,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 113 states have internal predecessors, (131), 23 states have call successors, (23), 14 states have call predecessors, (23), 17 states have return successors, (29), 21 states have call predecessors, (29), 23 states have call successors, (29) [2025-02-07 20:04:24,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 183 transitions. [2025-02-07 20:04:24,981 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 183 transitions. Word has length 30 [2025-02-07 20:04:24,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:04:24,982 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 183 transitions. [2025-02-07 20:04:24,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 24 states have internal predecessors, (41), 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-07 20:04:24,982 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 183 transitions. [2025-02-07 20:04:24,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-07 20:04:24,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:04:24,983 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] [2025-02-07 20:04:24,990 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-07 20:04:25,188 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-07 20:04:25,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:04:25,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:04:25,189 INFO L85 PathProgramCache]: Analyzing trace with hash 457241993, now seen corresponding path program 2 times [2025-02-07 20:04:25,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:04:25,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175682624] [2025-02-07 20:04:25,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:04:25,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:04:25,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-07 20:04:25,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 20:04:25,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:04:25,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:04:28,415 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-07 20:04:28,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:04:28,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175682624] [2025-02-07 20:04:28,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175682624] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:04:28,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827926879] [2025-02-07 20:04:28,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:04:28,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:04:28,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:04:28,421 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-07 20:04:28,424 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-07 20:04:28,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-07 20:04:28,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 20:04:28,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:04:28,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:04:28,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-02-07 20:04:28,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:04:28,820 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-07 20:04:28,821 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 19 treesize of output 16 [2025-02-07 20:04:32,198 INFO L349 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2025-02-07 20:04:32,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 147 [2025-02-07 20:04:32,218 INFO L349 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2025-02-07 20:04:32,218 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 81 [2025-02-07 20:04:32,282 INFO L349 Elim1Store]: treesize reduction 85, result has 19.8 percent of original size [2025-02-07 20:04:32,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 93 [2025-02-07 20:04:32,307 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 0 case distinctions, treesize of input 43 treesize of output 16 [2025-02-07 20:04:32,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:04:32,380 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 0 case distinctions, treesize of input 101 treesize of output 71 [2025-02-07 20:04:32,529 INFO L349 Elim1Store]: treesize reduction 157, result has 25.2 percent of original size [2025-02-07 20:04:32,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 327 treesize of output 389 [2025-02-07 20:04:32,855 INFO L349 Elim1Store]: treesize reduction 95, result has 1.0 percent of original size [2025-02-07 20:04:32,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 13 [2025-02-07 20:04:35,264 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:04:35,265 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-07 20:04:37,843 INFO L349 Elim1Store]: treesize reduction 144, result has 24.2 percent of original size [2025-02-07 20:04:37,843 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 556 treesize of output 560 [2025-02-07 20:04:37,918 INFO L349 Elim1Store]: treesize reduction 98, result has 19.0 percent of original size [2025-02-07 20:04:37,919 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 564 treesize of output 509 [2025-02-07 20:04:37,972 INFO L349 Elim1Store]: treesize reduction 54, result has 19.4 percent of original size [2025-02-07 20:04:37,973 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 3 case distinctions, treesize of input 421 treesize of output 430 [2025-02-07 20:04:38,003 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:04:38,042 INFO L349 Elim1Store]: treesize reduction 88, result has 24.8 percent of original size [2025-02-07 20:04:38,042 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 705 treesize of output 680 [2025-02-07 20:04:38,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:04:38,099 INFO L349 Elim1Store]: treesize reduction 99, result has 26.1 percent of original size [2025-02-07 20:04:38,100 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 670 treesize of output 721 [2025-02-07 20:04:38,179 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-07 20:04:38,180 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 1 case distinctions, treesize of input 25 treesize of output 5 [2025-02-07 20:04:38,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 29 treesize of output 41 [2025-02-07 20:04:48,070 WARN L286 SmtUtils]: Spent 9.05s on a formula simplification. DAG size of input: 530 DAG size of output: 450 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-02-07 20:04:48,070 INFO L349 Elim1Store]: treesize reduction 408, result has 69.4 percent of original size [2025-02-07 20:04:48,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 13 select indices, 13 select index equivalence classes, 4 disjoint index pairs (out of 78 index pairs), introduced 15 new quantified variables, introduced 101 case distinctions, treesize of input 6733 treesize of output 7546