/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread/stack-1.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:13:46,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:13:46,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:13:46,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:13:46,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:13:46,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:13:46,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:13:46,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:13:46,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:13:46,108 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:13:46,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:13:46,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:13:46,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:13:46,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:13:46,108 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:13:46,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:13:46,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:13:46,109 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:13:46,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:13:46,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:13:46,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:13:46,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:13:46,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:13:46,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:13:46,110 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:13:46,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:13:46,110 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:13:46,110 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:13:46,110 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:13:46,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:13:46,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:13:46,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:13:46,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:13:46,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:13:46,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:13:46,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:13:46,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:13:46,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:13:46,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:13:46,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:13:46,111 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:13:46,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:13:46,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:13:46,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:13:46,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:13:46,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:13:46,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:13:46,111 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:13:46,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:13:46,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:13:46,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:13:46,330 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:13:46,330 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:13:46,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-1.i [2025-04-13 19:13:47,599 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218129229/c4247443ceee48eb8e248a2024eddad7/FLAGe40b7c227 [2025-04-13 19:13:47,830 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:13:47,831 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2025-04-13 19:13:47,849 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218129229/c4247443ceee48eb8e248a2024eddad7/FLAGe40b7c227 [2025-04-13 19:13:48,652 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218129229/c4247443ceee48eb8e248a2024eddad7 [2025-04-13 19:13:48,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:13:48,655 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:13:48,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:13:48,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:13:48,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:13:48,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:13:48" (1/1) ... [2025-04-13 19:13:48,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea84e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:13:48, skipping insertion in model container [2025-04-13 19:13:48,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:13:48" (1/1) ... [2025-04-13 19:13:48,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:13:49,090 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2025-04-13 19:13:49,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:13:49,128 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:13:49,183 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2025-04-13 19:13:49,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:13:49,234 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:13:49,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:13:49 WrapperNode [2025-04-13 19:13:49,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:13:49,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:13:49,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:13:49,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:13:49,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:13:49" (1/1) ... [2025-04-13 19:13:49,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:13:49" (1/1) ... [2025-04-13 19:13:49,270 INFO L138 Inliner]: procedures = 277, calls = 35, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 144 [2025-04-13 19:13:49,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:13:49,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:13:49,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:13:49,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:13:49,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:13:49" (1/1) ... [2025-04-13 19:13:49,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:13:49" (1/1) ... [2025-04-13 19:13:49,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:13:49" (1/1) ... [2025-04-13 19:13:49,301 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 1 writes are split as follows [0, 0, 1]. [2025-04-13 19:13:49,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:13:49" (1/1) ... [2025-04-13 19:13:49,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:13:49" (1/1) ... [2025-04-13 19:13:49,306 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:13:49" (1/1) ... [2025-04-13 19:13:49,306 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:13:49" (1/1) ... [2025-04-13 19:13:49,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:13:49" (1/1) ... [2025-04-13 19:13:49,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:13:49" (1/1) ... [2025-04-13 19:13:49,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:13:49" (1/1) ... [2025-04-13 19:13:49,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:13:49,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:13:49,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:13:49,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:13:49,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:13:49" (1/1) ... [2025-04-13 19:13:49,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:13:49,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:13:49,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:13:49,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:13:49,358 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 19:13:49,358 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 19:13:49,358 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 19:13:49,358 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 19:13:49,358 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:13:49,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:13:49,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:13:49,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 19:13:49,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:13:49,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:13:49,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 19:13:49,359 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:13:49,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:13:49,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:13:49,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:13:49,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:13:49,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:13:49,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:13:49,360 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:13:49,475 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:13:49,477 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:13:49,660 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:13:49,661 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:13:49,661 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:13:49,889 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:13:49,890 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:13:49,895 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:13:49,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:13:49 BoogieIcfgContainer [2025-04-13 19:13:49,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:13:49,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:13:49,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:13:49,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:13:49,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:13:48" (1/3) ... [2025-04-13 19:13:49,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@308069db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:13:49, skipping insertion in model container [2025-04-13 19:13:49,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:13:49" (2/3) ... [2025-04-13 19:13:49,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@308069db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:13:49, skipping insertion in model container [2025-04-13 19:13:49,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:13:49" (3/3) ... [2025-04-13 19:13:49,903 INFO L128 eAbstractionObserver]: Analyzing ICFG stack-1.i [2025-04-13 19:13:49,913 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:13:49,915 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack-1.i that has 3 procedures, 23 locations, 24 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 19:13:49,916 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:13:49,968 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 19:13:49,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 66 flow [2025-04-13 19:13:50,021 INFO L116 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-04-13 19:13:50,025 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:13:50,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 4/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-13 19:13:50,026 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 66 flow [2025-04-13 19:13:50,032 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 22 transitions, 53 flow [2025-04-13 19:13:50,042 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:13:50,053 INFO L340 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;@b1d2c60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:13:50,054 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:13:50,057 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:13:50,057 INFO L116 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-04-13 19:13:50,057 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:13:50,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:13:50,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:13:50,058 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:13:50,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:13:50,062 INFO L85 PathProgramCache]: Analyzing trace with hash 381703198, now seen corresponding path program 1 times [2025-04-13 19:13:50,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:13:50,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252395275] [2025-04-13 19:13:50,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:13:50,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:13:50,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:13:50,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:13:50,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:13:50,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:50,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:13:50,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252395275] [2025-04-13 19:13:50,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252395275] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:13:50,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:13:50,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:13:50,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546814863] [2025-04-13 19:13:50,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:13:50,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:13:50,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:13:50,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:13:50,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:13:50,324 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:13:50,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:13:50,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:13:50,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:13:50,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:13:50,477 INFO L116 PetriNetUnfolderBase]: 206/352 cut-off events. [2025-04-13 19:13:50,477 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 19:13:50,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 352 events. 206/352 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1216 event pairs, 52 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 690. Up to 263 conditions per place. [2025-04-13 19:13:50,484 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-04-13 19:13:50,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 31 transitions, 136 flow [2025-04-13 19:13:50,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:13:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:13:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-13 19:13:50,494 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-04-13 19:13:50,496 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 53 flow. Second operand 3 states and 42 transitions. [2025-04-13 19:13:50,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 31 transitions, 136 flow [2025-04-13 19:13:50,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:13:50,503 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 58 flow [2025-04-13 19:13:50,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-04-13 19:13:50,508 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2025-04-13 19:13:50,508 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 58 flow [2025-04-13 19:13:50,508 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:13:50,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:13:50,508 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:13:50,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:13:50,508 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:13:50,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:13:50,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1491107969, now seen corresponding path program 1 times [2025-04-13 19:13:50,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:13:50,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932091830] [2025-04-13 19:13:50,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:13:50,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:13:50,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:13:50,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:13:50,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:13:50,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:50,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:13:50,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932091830] [2025-04-13 19:13:50,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932091830] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:13:50,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001862653] [2025-04-13 19:13:50,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:13:50,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:13:50,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:13:50,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:13:50,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 19:13:50,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:13:50,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:13:50,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:13:50,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:50,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 19:13:50,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:13:50,908 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:13:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:50,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:13:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:50,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001862653] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:13:50,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:13:50,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-04-13 19:13:50,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352539348] [2025-04-13 19:13:50,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:13:50,982 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:13:50,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:13:50,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:13:50,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:13:50,982 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:13:50,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 58 flow. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-04-13 19:13:50,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:13:50,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:13:50,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:13:51,314 INFO L116 PetriNetUnfolderBase]: 771/1322 cut-off events. [2025-04-13 19:13:51,314 INFO L117 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2025-04-13 19:13:51,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 1322 events. 771/1322 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5778 event pairs, 54 based on Foata normal form. 11/1141 useless extension candidates. Maximal degree in co-relation 2517. Up to 270 conditions per place. [2025-04-13 19:13:51,324 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 94 selfloop transitions, 17 changer transitions 2/113 dead transitions. [2025-04-13 19:13:51,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 113 transitions, 506 flow [2025-04-13 19:13:51,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:13:51,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:13:51,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2025-04-13 19:13:51,326 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6442307692307693 [2025-04-13 19:13:51,326 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 58 flow. Second operand 8 states and 134 transitions. [2025-04-13 19:13:51,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 113 transitions, 506 flow [2025-04-13 19:13:51,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 113 transitions, 504 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:13:51,328 INFO L231 Difference]: Finished difference. Result has 37 places, 38 transitions, 194 flow [2025-04-13 19:13:51,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=194, PETRI_PLACES=37, PETRI_TRANSITIONS=38} [2025-04-13 19:13:51,329 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 12 predicate places. [2025-04-13 19:13:51,329 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 38 transitions, 194 flow [2025-04-13 19:13:51,329 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-04-13 19:13:51,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:13:51,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:13:51,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 19:13:51,529 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:13:51,530 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:13:51,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:13:51,530 INFO L85 PathProgramCache]: Analyzing trace with hash 423503570, now seen corresponding path program 1 times [2025-04-13 19:13:51,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:13:51,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34512207] [2025-04-13 19:13:51,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:13:51,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:13:51,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:13:51,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:13:51,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:13:51,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:51,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:13:51,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34512207] [2025-04-13 19:13:51,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34512207] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:13:51,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:13:51,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:13:51,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780781115] [2025-04-13 19:13:51,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:13:51,598 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:13:51,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:13:51,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:13:51,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:13:51,599 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:13:51,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 38 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-04-13 19:13:51,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:13:51,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:13:51,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:13:51,718 INFO L116 PetriNetUnfolderBase]: 531/934 cut-off events. [2025-04-13 19:13:51,718 INFO L117 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2025-04-13 19:13:51,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 934 events. 531/934 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3986 event pairs, 194 based on Foata normal form. 52/830 useless extension candidates. Maximal degree in co-relation 2011. Up to 505 conditions per place. [2025-04-13 19:13:51,724 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 43 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-04-13 19:13:51,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 303 flow [2025-04-13 19:13:51,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:13:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:13:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 19:13:51,725 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2025-04-13 19:13:51,725 INFO L175 Difference]: Start difference. First operand has 37 places, 38 transitions, 194 flow. Second operand 3 states and 38 transitions. [2025-04-13 19:13:51,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 303 flow [2025-04-13 19:13:51,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 283 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-04-13 19:13:51,733 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 174 flow [2025-04-13 19:13:51,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-04-13 19:13:51,734 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2025-04-13 19:13:51,734 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 174 flow [2025-04-13 19:13:51,734 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-04-13 19:13:51,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:13:51,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:13:51,734 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:13:51,734 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:13:51,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:13:51,735 INFO L85 PathProgramCache]: Analyzing trace with hash -131028002, now seen corresponding path program 1 times [2025-04-13 19:13:51,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:13:51,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103650350] [2025-04-13 19:13:51,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:13:51,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:13:51,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:13:51,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:13:51,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:13:51,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:52,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:13:52,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103650350] [2025-04-13 19:13:52,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103650350] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:13:52,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:13:52,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:13:52,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749170908] [2025-04-13 19:13:52,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:13:52,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:13:52,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:13:52,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:13:52,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:13:52,076 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:13:52,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:13:52,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:13:52,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:13:52,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:13:52,223 INFO L116 PetriNetUnfolderBase]: 583/1026 cut-off events. [2025-04-13 19:13:52,223 INFO L117 PetriNetUnfolderBase]: For 409/409 co-relation queries the response was YES. [2025-04-13 19:13:52,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2648 conditions, 1026 events. 583/1026 cut-off events. For 409/409 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4334 event pairs, 149 based on Foata normal form. 7/837 useless extension candidates. Maximal degree in co-relation 2042. Up to 817 conditions per place. [2025-04-13 19:13:52,227 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 54 selfloop transitions, 4 changer transitions 2/60 dead transitions. [2025-04-13 19:13:52,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 60 transitions, 365 flow [2025-04-13 19:13:52,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:13:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:13:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-04-13 19:13:52,229 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2025-04-13 19:13:52,229 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 174 flow. Second operand 4 states and 54 transitions. [2025-04-13 19:13:52,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 60 transitions, 365 flow [2025-04-13 19:13:52,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:13:52,233 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 199 flow [2025-04-13 19:13:52,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-04-13 19:13:52,233 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 17 predicate places. [2025-04-13 19:13:52,233 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 199 flow [2025-04-13 19:13:52,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:13:52,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:13:52,234 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:13:52,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:13:52,234 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:13:52,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:13:52,234 INFO L85 PathProgramCache]: Analyzing trace with hash 249841179, now seen corresponding path program 1 times [2025-04-13 19:13:52,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:13:52,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228343448] [2025-04-13 19:13:52,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:13:52,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:13:52,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:13:52,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:13:52,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:13:52,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:52,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:52,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:13:52,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228343448] [2025-04-13 19:13:52,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228343448] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:13:52,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450481693] [2025-04-13 19:13:52,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:13:52,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:13:52,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:13:52,633 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:13:52,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 19:13:52,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:13:52,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:13:52,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:13:52,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:52,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 19:13:52,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:13:52,761 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2025-04-13 19:13:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:13:52,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 19:13:52,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450481693] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:13:52,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 19:13:52,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2025-04-13 19:13:52,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137783948] [2025-04-13 19:13:52,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:13:52,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:13:52,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:13:52,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:13:52,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:13:52,814 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:13:52,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-04-13 19:13:52,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:13:52,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:13:52,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:13:52,983 INFO L116 PetriNetUnfolderBase]: 612/1081 cut-off events. [2025-04-13 19:13:52,983 INFO L117 PetriNetUnfolderBase]: For 568/568 co-relation queries the response was YES. [2025-04-13 19:13:52,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2680 conditions, 1081 events. 612/1081 cut-off events. For 568/568 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4619 event pairs, 134 based on Foata normal form. 7/885 useless extension candidates. Maximal degree in co-relation 2115. Up to 663 conditions per place. [2025-04-13 19:13:52,987 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 41 selfloop transitions, 9 changer transitions 0/50 dead transitions. [2025-04-13 19:13:52,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 321 flow [2025-04-13 19:13:52,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:13:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:13:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-13 19:13:52,988 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2025-04-13 19:13:52,988 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 199 flow. Second operand 3 states and 41 transitions. [2025-04-13 19:13:52,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 321 flow [2025-04-13 19:13:52,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 310 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-13 19:13:52,991 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 220 flow [2025-04-13 19:13:52,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2025-04-13 19:13:52,992 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 17 predicate places. [2025-04-13 19:13:52,992 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 220 flow [2025-04-13 19:13:52,992 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-04-13 19:13:52,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:13:52,992 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:13:52,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 19:13:53,192 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:13:53,193 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:13:53,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:13:53,193 INFO L85 PathProgramCache]: Analyzing trace with hash -760945824, now seen corresponding path program 1 times [2025-04-13 19:13:53,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:13:53,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050111680] [2025-04-13 19:13:53,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:13:53,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:13:53,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:13:53,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:13:53,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:13:53,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:53,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:13:53,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050111680] [2025-04-13 19:13:53,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050111680] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:13:53,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64536518] [2025-04-13 19:13:53,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:13:53,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:13:53,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:13:53,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:13:53,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 19:13:53,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:13:53,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:13:53,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:13:53,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:53,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 19:13:53,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:13:53,492 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:13:53,518 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:13:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:53,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:13:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:13:53,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64536518] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 19:13:53,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 19:13:53,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 10 [2025-04-13 19:13:53,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546104138] [2025-04-13 19:13:53,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:13:53,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:13:53,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:13:53,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:13:53,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:13:53,834 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:13:53,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-04-13 19:13:53,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:13:53,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:13:53,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:13:54,029 INFO L116 PetriNetUnfolderBase]: 763/1350 cut-off events. [2025-04-13 19:13:54,030 INFO L117 PetriNetUnfolderBase]: For 891/891 co-relation queries the response was YES. [2025-04-13 19:13:54,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 1350 events. 763/1350 cut-off events. For 891/891 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5995 event pairs, 70 based on Foata normal form. 12/1124 useless extension candidates. Maximal degree in co-relation 2684. Up to 696 conditions per place. [2025-04-13 19:13:54,034 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 50 selfloop transitions, 22 changer transitions 0/72 dead transitions. [2025-04-13 19:13:54,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 72 transitions, 482 flow [2025-04-13 19:13:54,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:13:54,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:13:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-04-13 19:13:54,035 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2025-04-13 19:13:54,035 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 220 flow. Second operand 5 states and 64 transitions. [2025-04-13 19:13:54,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 72 transitions, 482 flow [2025-04-13 19:13:54,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 72 transitions, 421 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-04-13 19:13:54,038 INFO L231 Difference]: Finished difference. Result has 40 places, 47 transitions, 299 flow [2025-04-13 19:13:54,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=40, PETRI_TRANSITIONS=47} [2025-04-13 19:13:54,039 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 15 predicate places. [2025-04-13 19:13:54,039 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 47 transitions, 299 flow [2025-04-13 19:13:54,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-04-13 19:13:54,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:13:54,039 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:13:54,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 19:13:54,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:13:54,240 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:13:54,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:13:54,240 INFO L85 PathProgramCache]: Analyzing trace with hash -644551170, now seen corresponding path program 1 times [2025-04-13 19:13:54,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:13:54,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665133397] [2025-04-13 19:13:54,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:13:54,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:13:54,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:13:54,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:13:54,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:13:54,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:54,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:13:54,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665133397] [2025-04-13 19:13:54,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665133397] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:13:54,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371812560] [2025-04-13 19:13:54,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:13:54,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:13:54,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:13:54,781 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:13:54,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 19:13:54,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:13:54,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:13:54,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:13:54,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:54,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 19:13:54,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:13:54,898 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 19:13:54,937 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2025-04-13 19:13:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:55,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:13:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:55,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371812560] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:13:55,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:13:55,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-04-13 19:13:55,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738136902] [2025-04-13 19:13:55,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:13:55,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 19:13:55,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:13:55,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 19:13:55,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-04-13 19:13:55,314 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:13:55,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 47 transitions, 299 flow. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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-04-13 19:13:55,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:13:55,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:13:55,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:13:55,973 INFO L116 PetriNetUnfolderBase]: 1710/3034 cut-off events. [2025-04-13 19:13:55,973 INFO L117 PetriNetUnfolderBase]: For 1901/1901 co-relation queries the response was YES. [2025-04-13 19:13:55,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7708 conditions, 3034 events. 1710/3034 cut-off events. For 1901/1901 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 14970 event pairs, 277 based on Foata normal form. 36/2488 useless extension candidates. Maximal degree in co-relation 6678. Up to 571 conditions per place. [2025-04-13 19:13:55,984 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 141 selfloop transitions, 48 changer transitions 20/209 dead transitions. [2025-04-13 19:13:55,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 209 transitions, 1318 flow [2025-04-13 19:13:55,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:13:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 19:13:55,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 218 transitions. [2025-04-13 19:13:55,986 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5240384615384616 [2025-04-13 19:13:55,986 INFO L175 Difference]: Start difference. First operand has 40 places, 47 transitions, 299 flow. Second operand 16 states and 218 transitions. [2025-04-13 19:13:55,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 209 transitions, 1318 flow [2025-04-13 19:13:55,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 209 transitions, 1272 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-04-13 19:13:55,991 INFO L231 Difference]: Finished difference. Result has 62 places, 75 transitions, 666 flow [2025-04-13 19:13:55,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=666, PETRI_PLACES=62, PETRI_TRANSITIONS=75} [2025-04-13 19:13:55,993 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 37 predicate places. [2025-04-13 19:13:55,993 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 75 transitions, 666 flow [2025-04-13 19:13:55,993 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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-04-13 19:13:55,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:13:55,993 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1] [2025-04-13 19:13:56,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 19:13:56,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:13:56,197 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:13:56,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:13:56,197 INFO L85 PathProgramCache]: Analyzing trace with hash 202542250, now seen corresponding path program 2 times [2025-04-13 19:13:56,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:13:56,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160269085] [2025-04-13 19:13:56,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:13:56,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:13:56,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 19:13:56,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:13:56,219 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:13:56,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:56,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:13:56,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160269085] [2025-04-13 19:13:56,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160269085] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:13:56,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407721974] [2025-04-13 19:13:56,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:13:56,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:13:56,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:13:56,356 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:13:56,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 19:13:56,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 19:13:56,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:13:56,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:13:56,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:56,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 19:13:56,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:13:56,469 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:13:56,502 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:13:56,532 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:13:56,556 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 19:13:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:56,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:13:56,636 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:56,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407721974] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:13:56,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:13:56,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-04-13 19:13:56,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092574347] [2025-04-13 19:13:56,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:13:56,637 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 19:13:56,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:13:56,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 19:13:56,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2025-04-13 19:13:56,638 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:13:56,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 75 transitions, 666 flow. Second operand has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 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-04-13 19:13:56,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:13:56,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:13:56,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:13:57,253 INFO L116 PetriNetUnfolderBase]: 2867/5075 cut-off events. [2025-04-13 19:13:57,254 INFO L117 PetriNetUnfolderBase]: For 7412/7412 co-relation queries the response was YES. [2025-04-13 19:13:57,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13739 conditions, 5075 events. 2867/5075 cut-off events. For 7412/7412 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27586 event pairs, 698 based on Foata normal form. 90/4190 useless extension candidates. Maximal degree in co-relation 13003. Up to 1045 conditions per place. [2025-04-13 19:13:57,301 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 164 selfloop transitions, 87 changer transitions 10/261 dead transitions. [2025-04-13 19:13:57,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 261 transitions, 2015 flow [2025-04-13 19:13:57,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 19:13:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 19:13:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 230 transitions. [2025-04-13 19:13:57,303 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5528846153846154 [2025-04-13 19:13:57,303 INFO L175 Difference]: Start difference. First operand has 62 places, 75 transitions, 666 flow. Second operand 16 states and 230 transitions. [2025-04-13 19:13:57,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 261 transitions, 2015 flow [2025-04-13 19:13:57,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 261 transitions, 1971 flow, removed 15 selfloop flow, removed 3 redundant places. [2025-04-13 19:13:57,318 INFO L231 Difference]: Finished difference. Result has 76 places, 119 transitions, 1347 flow [2025-04-13 19:13:57,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1347, PETRI_PLACES=76, PETRI_TRANSITIONS=119} [2025-04-13 19:13:57,319 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 51 predicate places. [2025-04-13 19:13:57,319 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 119 transitions, 1347 flow [2025-04-13 19:13:57,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 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-04-13 19:13:57,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:13:57,319 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1] [2025-04-13 19:13:57,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 19:13:57,519 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:13:57,520 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:13:57,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:13:57,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1913361165, now seen corresponding path program 3 times [2025-04-13 19:13:57,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:13:57,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919673784] [2025-04-13 19:13:57,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:13:57,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:13:57,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 6 equivalence classes. [2025-04-13 19:13:57,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:13:57,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 19:13:57,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:57,635 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:57,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:13:57,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919673784] [2025-04-13 19:13:57,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919673784] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:13:57,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:13:57,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:13:57,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160663324] [2025-04-13 19:13:57,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:13:57,636 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:13:57,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:13:57,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:13:57,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:13:57,636 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:13:57,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 119 transitions, 1347 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-13 19:13:57,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:13:57,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:13:57,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:13:58,200 INFO L116 PetriNetUnfolderBase]: 3792/6599 cut-off events. [2025-04-13 19:13:58,200 INFO L117 PetriNetUnfolderBase]: For 12034/12034 co-relation queries the response was YES. [2025-04-13 19:13:58,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18493 conditions, 6599 events. 3792/6599 cut-off events. For 12034/12034 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 37779 event pairs, 422 based on Foata normal form. 0/5411 useless extension candidates. Maximal degree in co-relation 18167. Up to 4183 conditions per place. [2025-04-13 19:13:58,225 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 156 selfloop transitions, 7 changer transitions 71/234 dead transitions. [2025-04-13 19:13:58,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 234 transitions, 2743 flow [2025-04-13 19:13:58,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:13:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:13:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-04-13 19:13:58,227 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5494505494505495 [2025-04-13 19:13:58,228 INFO L175 Difference]: Start difference. First operand has 76 places, 119 transitions, 1347 flow. Second operand 7 states and 100 transitions. [2025-04-13 19:13:58,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 234 transitions, 2743 flow [2025-04-13 19:13:58,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 234 transitions, 2496 flow, removed 43 selfloop flow, removed 9 redundant places. [2025-04-13 19:13:58,259 INFO L231 Difference]: Finished difference. Result has 70 places, 83 transitions, 760 flow [2025-04-13 19:13:58,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=760, PETRI_PLACES=70, PETRI_TRANSITIONS=83} [2025-04-13 19:13:58,259 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 45 predicate places. [2025-04-13 19:13:58,259 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 83 transitions, 760 flow [2025-04-13 19:13:58,260 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-04-13 19:13:58,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:13:58,260 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:13:58,260 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:13:58,260 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:13:58,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:13:58,260 INFO L85 PathProgramCache]: Analyzing trace with hash -172557678, now seen corresponding path program 2 times [2025-04-13 19:13:58,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:13:58,261 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563709244] [2025-04-13 19:13:58,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:13:58,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:13:58,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 19:13:58,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 19:13:58,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:13:58,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:13:58,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:13:58,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563709244] [2025-04-13 19:13:58,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563709244] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:13:58,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795386523] [2025-04-13 19:13:58,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:13:58,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:13:58,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:13:58,799 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:13:58,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 19:13:58,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 19:13:58,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 19:13:58,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:13:58,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:58,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 19:13:58,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:13:58,941 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 19:13:58,998 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2025-04-13 19:13:59,073 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 19 [2025-04-13 19:13:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:59,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:13:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:59,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795386523] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:13:59,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:13:59,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2025-04-13 19:13:59,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102280335] [2025-04-13 19:13:59,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:13:59,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 19:13:59,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:13:59,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 19:13:59,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-04-13 19:13:59,923 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:13:59,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 83 transitions, 760 flow. Second operand has 18 states, 18 states have (on average 6.5) internal successors, (117), 18 states have internal predecessors, (117), 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-04-13 19:13:59,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:13:59,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:13:59,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:01,208 INFO L116 PetriNetUnfolderBase]: 2465/4552 cut-off events. [2025-04-13 19:14:01,208 INFO L117 PetriNetUnfolderBase]: For 7186/7186 co-relation queries the response was YES. [2025-04-13 19:14:01,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13280 conditions, 4552 events. 2465/4552 cut-off events. For 7186/7186 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 25802 event pairs, 413 based on Foata normal form. 46/4310 useless extension candidates. Maximal degree in co-relation 12825. Up to 928 conditions per place. [2025-04-13 19:14:01,223 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 148 selfloop transitions, 37 changer transitions 117/302 dead transitions. [2025-04-13 19:14:01,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 302 transitions, 2236 flow [2025-04-13 19:14:01,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 19:14:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 19:14:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 261 transitions. [2025-04-13 19:14:01,226 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4562937062937063 [2025-04-13 19:14:01,226 INFO L175 Difference]: Start difference. First operand has 70 places, 83 transitions, 760 flow. Second operand 22 states and 261 transitions. [2025-04-13 19:14:01,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 302 transitions, 2236 flow [2025-04-13 19:14:01,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 302 transitions, 2206 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 19:14:01,238 INFO L231 Difference]: Finished difference. Result has 89 places, 65 transitions, 631 flow [2025-04-13 19:14:01,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=631, PETRI_PLACES=89, PETRI_TRANSITIONS=65} [2025-04-13 19:14:01,238 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 64 predicate places. [2025-04-13 19:14:01,238 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 65 transitions, 631 flow [2025-04-13 19:14:01,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.5) internal successors, (117), 18 states have internal predecessors, (117), 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-04-13 19:14:01,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:01,239 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:01,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 19:14:01,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:01,439 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:14:01,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:01,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1664678640, now seen corresponding path program 3 times [2025-04-13 19:14:01,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:01,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134114672] [2025-04-13 19:14:01,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:14:01,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:01,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-04-13 19:14:01,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:14:01,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 19:14:01,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:02,494 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:14:02,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:02,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134114672] [2025-04-13 19:14:02,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134114672] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:14:02,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591916078] [2025-04-13 19:14:02,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:14:02,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:02,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:14:02,497 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:14:02,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 19:14:02,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-04-13 19:14:02,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:14:02,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 19:14:02,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:02,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 19:14:02,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:14:02,717 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-04-13 19:14:02,775 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 19:14:02,824 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 19:14:02,879 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 19:14:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:03,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:14:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:03,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591916078] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:14:03,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:14:03,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-04-13 19:14:03,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453417173] [2025-04-13 19:14:03,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:14:03,941 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 19:14:03,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:03,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 19:14:03,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:14:03,942 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:14:03,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 65 transitions, 631 flow. Second operand has 25 states, 25 states have (on average 6.2) internal successors, (155), 25 states have internal predecessors, (155), 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-04-13 19:14:03,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:03,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:14:03,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:04,896 INFO L116 PetriNetUnfolderBase]: 1020/1970 cut-off events. [2025-04-13 19:14:04,896 INFO L117 PetriNetUnfolderBase]: For 3771/3771 co-relation queries the response was YES. [2025-04-13 19:14:04,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5828 conditions, 1970 events. 1020/1970 cut-off events. For 3771/3771 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9068 event pairs, 142 based on Foata normal form. 29/1947 useless extension candidates. Maximal degree in co-relation 5810. Up to 405 conditions per place. [2025-04-13 19:14:04,902 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 80 selfloop transitions, 12 changer transitions 99/191 dead transitions. [2025-04-13 19:14:04,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 191 transitions, 1400 flow [2025-04-13 19:14:04,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:14:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 19:14:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 199 transitions. [2025-04-13 19:14:04,904 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4502262443438914 [2025-04-13 19:14:04,904 INFO L175 Difference]: Start difference. First operand has 89 places, 65 transitions, 631 flow. Second operand 17 states and 199 transitions. [2025-04-13 19:14:04,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 191 transitions, 1400 flow [2025-04-13 19:14:04,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 191 transitions, 1200 flow, removed 28 selfloop flow, removed 21 redundant places. [2025-04-13 19:14:04,910 INFO L231 Difference]: Finished difference. Result has 81 places, 34 transitions, 211 flow [2025-04-13 19:14:04,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=211, PETRI_PLACES=81, PETRI_TRANSITIONS=34} [2025-04-13 19:14:04,911 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 56 predicate places. [2025-04-13 19:14:04,911 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 34 transitions, 211 flow [2025-04-13 19:14:04,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.2) internal successors, (155), 25 states have internal predecessors, (155), 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-04-13 19:14:04,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:04,911 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:04,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 19:14:05,111 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:05,112 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:14:05,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:05,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2072088286, now seen corresponding path program 4 times [2025-04-13 19:14:05,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:05,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56841090] [2025-04-13 19:14:05,113 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:14:05,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:05,126 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 19:14:05,181 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 19:14:05,181 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:14:05,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:06,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:06,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56841090] [2025-04-13 19:14:06,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56841090] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:14:06,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481171739] [2025-04-13 19:14:06,371 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:14:06,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:06,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:14:06,373 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:14:06,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 19:14:06,469 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 19:14:06,507 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 19:14:06,507 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:14:06,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:06,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 19:14:06,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:14:06,546 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 19:14:06,595 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2025-04-13 19:14:06,668 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2025-04-13 19:14:06,734 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2025-04-13 19:14:06,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 19 [2025-04-13 19:14:07,711 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 4 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:07,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:14:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:08,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481171739] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:14:08,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:14:08,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2025-04-13 19:14:08,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158525626] [2025-04-13 19:14:08,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:14:08,601 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 19:14:08,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:08,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 19:14:08,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2025-04-13 19:14:08,602 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 19:14:08,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 34 transitions, 211 flow. Second operand has 31 states, 31 states have (on average 6.161290322580645) internal successors, (191), 31 states have internal predecessors, (191), 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-04-13 19:14:08,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:08,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 19:14:08,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:09,515 INFO L116 PetriNetUnfolderBase]: 366/705 cut-off events. [2025-04-13 19:14:09,515 INFO L117 PetriNetUnfolderBase]: For 832/832 co-relation queries the response was YES. [2025-04-13 19:14:09,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1975 conditions, 705 events. 366/705 cut-off events. For 832/832 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2107 event pairs, 68 based on Foata normal form. 10/715 useless extension candidates. Maximal degree in co-relation 1961. Up to 135 conditions per place. [2025-04-13 19:14:09,517 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 0 selfloop transitions, 0 changer transitions 102/102 dead transitions. [2025-04-13 19:14:09,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 102 transitions, 601 flow [2025-04-13 19:14:09,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 19:14:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 19:14:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 126 transitions. [2025-04-13 19:14:09,518 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3727810650887574 [2025-04-13 19:14:09,518 INFO L175 Difference]: Start difference. First operand has 81 places, 34 transitions, 211 flow. Second operand 13 states and 126 transitions. [2025-04-13 19:14:09,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 102 transitions, 601 flow [2025-04-13 19:14:09,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 102 transitions, 551 flow, removed 13 selfloop flow, removed 12 redundant places. [2025-04-13 19:14:09,520 INFO L231 Difference]: Finished difference. Result has 56 places, 0 transitions, 0 flow [2025-04-13 19:14:09,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=56, PETRI_TRANSITIONS=0} [2025-04-13 19:14:09,520 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 31 predicate places. [2025-04-13 19:14:09,520 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 0 transitions, 0 flow [2025-04-13 19:14:09,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.161290322580645) internal successors, (191), 31 states have internal predecessors, (191), 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-04-13 19:14:09,522 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 19:14:09,522 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-13 19:14:09,523 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 19:14:09,523 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:14:09,523 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 19:14:09,523 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:14:09,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 19:14:09,727 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 19:14:09,727 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1] [2025-04-13 19:14:09,731 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:14:09,731 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:14:09,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:14:09 BasicIcfg [2025-04-13 19:14:09,734 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:14:09,734 INFO L158 Benchmark]: Toolchain (without parser) took 21079.91ms. Allocated memory was 155.2MB in the beginning and 654.3MB in the end (delta: 499.1MB). Free memory was 109.2MB in the beginning and 312.2MB in the end (delta: -203.1MB). Peak memory consumption was 297.6MB. Max. memory is 8.0GB. [2025-04-13 19:14:09,735 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 163.6MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:14:09,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.07ms. Allocated memory is still 155.2MB. Free memory was 109.2MB in the beginning and 76.6MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-13 19:14:09,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.28ms. Allocated memory is still 155.2MB. Free memory was 76.6MB in the beginning and 73.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:14:09,735 INFO L158 Benchmark]: Boogie Preprocessor took 42.27ms. Allocated memory is still 155.2MB. Free memory was 73.8MB in the beginning and 71.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:14:09,735 INFO L158 Benchmark]: RCFGBuilder took 582.45ms. Allocated memory is still 155.2MB. Free memory was 71.7MB in the beginning and 97.0MB in the end (delta: -25.4MB). Peak memory consumption was 53.4MB. Max. memory is 8.0GB. [2025-04-13 19:14:09,735 INFO L158 Benchmark]: TraceAbstraction took 19835.21ms. Allocated memory was 155.2MB in the beginning and 654.3MB in the end (delta: 499.1MB). Free memory was 97.0MB in the beginning and 312.2MB in the end (delta: -215.2MB). Peak memory consumption was 286.2MB. Max. memory is 8.0GB. [2025-04-13 19:14:09,736 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 163.6MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 579.07ms. Allocated memory is still 155.2MB. Free memory was 109.2MB in the beginning and 76.6MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.28ms. Allocated memory is still 155.2MB. Free memory was 76.6MB in the beginning and 73.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.27ms. Allocated memory is still 155.2MB. Free memory was 73.8MB in the beginning and 71.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 582.45ms. Allocated memory is still 155.2MB. Free memory was 71.7MB in the beginning and 97.0MB in the end (delta: -25.4MB). Peak memory consumption was 53.4MB. Max. memory is 8.0GB. * TraceAbstraction took 19835.21ms. Allocated memory was 155.2MB in the beginning and 654.3MB in the end (delta: 499.1MB). Free memory was 97.0MB in the beginning and 312.2MB in the end (delta: -215.2MB). Peak memory consumption was 286.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 941]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 941]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 39 locations, 46 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.7s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1803 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1803 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4340 IncrementalHoareTripleChecker+Invalid, 4514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 0 mSDtfsCounter, 4340 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1347occurred in iteration=8, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 427 NumberOfCodeBlocks, 427 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 573 ConstructedInterpolants, 7 QuantifiedInterpolants, 13766 SizeOfPredicates, 84 NumberOfNonLiveVariables, 1654 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 89/656 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 19:14:09,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...