/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/weaver/popl20-three-array-max.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:56:09,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:56:09,394 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 20:56:09,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:56:09,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:56:09,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:56:09,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:56:09,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:56:09,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:56:09,417 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:56:09,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:56:09,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:56:09,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:56:09,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:56:09,418 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:56:09,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:56:09,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:56:09,418 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:56:09,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:56:09,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:56:09,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:56:09,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:56:09,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:56:09,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:56:09,419 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:56:09,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:56:09,419 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:56:09,419 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:56:09,419 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:56:09,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:56:09,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:56:09,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:56:09,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:56:09,419 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:56:09,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:56:09,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:56:09,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:56:09,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:56:09,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:56:09,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:56:09,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:56:09,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:56:09,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:56:09,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:56:09,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:56:09,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:56:09,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:56:09,420 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 20:56:09,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:56:09,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:56:09,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:56:09,662 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:56:09,662 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:56:09,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2025-04-13 20:56:10,964 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b287c500d/eca42fec61d94ad2b07b5d906c8a165f/FLAG08126f8a6 [2025-04-13 20:56:11,145 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:56:11,145 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2025-04-13 20:56:11,154 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b287c500d/eca42fec61d94ad2b07b5d906c8a165f/FLAG08126f8a6 [2025-04-13 20:56:12,016 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b287c500d/eca42fec61d94ad2b07b5d906c8a165f [2025-04-13 20:56:12,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:56:12,019 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:56:12,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:56:12,021 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:56:12,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:56:12,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:56:12" (1/1) ... [2025-04-13 20:56:12,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11cb5ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:56:12, skipping insertion in model container [2025-04-13 20:56:12,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:56:12" (1/1) ... [2025-04-13 20:56:12,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:56:12,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c[2862,2875] [2025-04-13 20:56:12,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:56:12,233 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:56:12,263 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c[2862,2875] [2025-04-13 20:56:12,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:56:12,285 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:56:12,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:56:12 WrapperNode [2025-04-13 20:56:12,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:56:12,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:56:12,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:56:12,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:56:12,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:56:12" (1/1) ... [2025-04-13 20:56:12,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:56:12" (1/1) ... [2025-04-13 20:56:12,328 INFO L138 Inliner]: procedures = 25, calls = 42, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 210 [2025-04-13 20:56:12,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:56:12,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:56:12,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:56:12,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:56:12,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:56:12" (1/1) ... [2025-04-13 20:56:12,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:56:12" (1/1) ... [2025-04-13 20:56:12,345 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:56:12" (1/1) ... [2025-04-13 20:56:12,362 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-04-13 20:56:12,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:56:12" (1/1) ... [2025-04-13 20:56:12,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:56:12" (1/1) ... [2025-04-13 20:56:12,367 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:56:12" (1/1) ... [2025-04-13 20:56:12,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:56:12" (1/1) ... [2025-04-13 20:56:12,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:56:12" (1/1) ... [2025-04-13 20:56:12,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:56:12" (1/1) ... [2025-04-13 20:56:12,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:56:12" (1/1) ... [2025-04-13 20:56:12,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:56:12,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:56:12,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:56:12,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:56:12,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:56:12" (1/1) ... [2025-04-13 20:56:12,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:56:12,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:56:12,404 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 20:56:12,406 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 20:56:12,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:56:12,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:56:12,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:56:12,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:56:12,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:56:12,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:56:12,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:56:12,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:56:12,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:56:12,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:56:12,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:56:12,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:56:12,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:56:12,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:56:12,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:56:12,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:56:12,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:56:12,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:56:12,424 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 20:56:12,496 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:56:12,498 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:56:12,834 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:56:12,834 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:56:12,834 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:56:13,136 WARN L179 LargeBlockEncoding]: Complex 3:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:56:13,138 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:56:13,142 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:56:13,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:56:13 BoogieIcfgContainer [2025-04-13 20:56:13,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:56:13,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:56:13,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:56:13,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:56:13,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:56:12" (1/3) ... [2025-04-13 20:56:13,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b8f397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:56:13, skipping insertion in model container [2025-04-13 20:56:13,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:56:12" (2/3) ... [2025-04-13 20:56:13,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b8f397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:56:13, skipping insertion in model container [2025-04-13 20:56:13,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:56:13" (3/3) ... [2025-04-13 20:56:13,148 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2025-04-13 20:56:13,158 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:56:13,159 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-max.wvr.c that has 4 procedures, 29 locations, 35 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 20:56:13,159 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:56:13,206 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:56:13,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 38 transitions, 97 flow [2025-04-13 20:56:13,252 INFO L116 PetriNetUnfolderBase]: 10/35 cut-off events. [2025-04-13 20:56:13,255 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:56:13,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 10/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 26. Up to 3 conditions per place. [2025-04-13 20:56:13,257 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 38 transitions, 97 flow [2025-04-13 20:56:13,259 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 34 transitions, 86 flow [2025-04-13 20:56:13,267 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:56:13,275 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;@1ebc0cf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:56:13,275 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:56:13,291 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:56:13,291 INFO L116 PetriNetUnfolderBase]: 10/33 cut-off events. [2025-04-13 20:56:13,291 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:56:13,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:13,292 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:13,292 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:56:13,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:13,300 INFO L85 PathProgramCache]: Analyzing trace with hash -894410509, now seen corresponding path program 1 times [2025-04-13 20:56:13,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:13,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685893209] [2025-04-13 20:56:13,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:56:13,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:13,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:56:13,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:56:13,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:56:13,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:13,673 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 20:56:13,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:13,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685893209] [2025-04-13 20:56:13,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685893209] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:56:13,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:56:13,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:56:13,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202717242] [2025-04-13 20:56:13,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:56:13,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:56:13,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:13,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:56:13,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:56:13,697 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-04-13 20:56:13,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:56:13,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:13,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-04-13 20:56:13,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:13,863 INFO L116 PetriNetUnfolderBase]: 455/656 cut-off events. [2025-04-13 20:56:13,863 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-13 20:56:13,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 656 events. 455/656 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1979 event pairs, 226 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 1122. Up to 608 conditions per place. [2025-04-13 20:56:13,870 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 31 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-04-13 20:56:13,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 35 transitions, 154 flow [2025-04-13 20:56:13,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:56:13,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:56:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-04-13 20:56:13,879 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4298245614035088 [2025-04-13 20:56:13,880 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 86 flow. Second operand 3 states and 49 transitions. [2025-04-13 20:56:13,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 35 transitions, 154 flow [2025-04-13 20:56:13,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 142 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:56:13,887 INFO L231 Difference]: Finished difference. Result has 31 places, 35 transitions, 86 flow [2025-04-13 20:56:13,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=31, PETRI_TRANSITIONS=35} [2025-04-13 20:56:13,892 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2025-04-13 20:56:13,892 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 35 transitions, 86 flow [2025-04-13 20:56:13,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:56:13,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:13,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:13,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:56:13,893 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:56:13,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:13,893 INFO L85 PathProgramCache]: Analyzing trace with hash 928793418, now seen corresponding path program 1 times [2025-04-13 20:56:13,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:13,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871009432] [2025-04-13 20:56:13,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:56:13,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:13,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:56:13,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:56:13,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:56:13,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:56:14,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:14,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871009432] [2025-04-13 20:56:14,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871009432] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:56:14,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:56:14,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:56:14,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501261650] [2025-04-13 20:56:14,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:56:14,054 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:56:14,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:14,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:56:14,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:56:14,055 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-04-13 20:56:14,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 35 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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 20:56:14,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:14,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-04-13 20:56:14,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:14,192 INFO L116 PetriNetUnfolderBase]: 455/658 cut-off events. [2025-04-13 20:56:14,192 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-13 20:56:14,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1293 conditions, 658 events. 455/658 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1968 event pairs, 226 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 1282. Up to 607 conditions per place. [2025-04-13 20:56:14,198 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 29 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2025-04-13 20:56:14,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 160 flow [2025-04-13 20:56:14,198 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:56:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:56:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-13 20:56:14,200 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-13 20:56:14,200 INFO L175 Difference]: Start difference. First operand has 31 places, 35 transitions, 86 flow. Second operand 4 states and 57 transitions. [2025-04-13 20:56:14,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 160 flow [2025-04-13 20:56:14,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 156 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:56:14,201 INFO L231 Difference]: Finished difference. Result has 34 places, 37 transitions, 110 flow [2025-04-13 20:56:14,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=34, PETRI_TRANSITIONS=37} [2025-04-13 20:56:14,202 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2025-04-13 20:56:14,202 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 37 transitions, 110 flow [2025-04-13 20:56:14,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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 20:56:14,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:14,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:14,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:56:14,202 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:56:14,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:14,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2039789406, now seen corresponding path program 1 times [2025-04-13 20:56:14,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:14,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773583919] [2025-04-13 20:56:14,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:56:14,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:14,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:56:14,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:56:14,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:56:14,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:56:14,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:14,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773583919] [2025-04-13 20:56:14,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773583919] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:56:14,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:56:14,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:56:14,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34773839] [2025-04-13 20:56:14,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:56:14,355 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:56:14,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:14,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:56:14,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:56:14,356 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-04-13 20:56:14,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 37 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:56:14,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:14,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-04-13 20:56:14,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:14,494 INFO L116 PetriNetUnfolderBase]: 636/956 cut-off events. [2025-04-13 20:56:14,494 INFO L117 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-04-13 20:56:14,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 956 events. 636/956 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3213 event pairs, 172 based on Foata normal form. 1/682 useless extension candidates. Maximal degree in co-relation 1822. Up to 446 conditions per place. [2025-04-13 20:56:14,500 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 45 selfloop transitions, 2 changer transitions 3/52 dead transitions. [2025-04-13 20:56:14,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 52 transitions, 243 flow [2025-04-13 20:56:14,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:56:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:56:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-04-13 20:56:14,502 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2025-04-13 20:56:14,502 INFO L175 Difference]: Start difference. First operand has 34 places, 37 transitions, 110 flow. Second operand 3 states and 63 transitions. [2025-04-13 20:56:14,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 52 transitions, 243 flow [2025-04-13 20:56:14,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 52 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:56:14,504 INFO L231 Difference]: Finished difference. Result has 36 places, 37 transitions, 119 flow [2025-04-13 20:56:14,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=36, PETRI_TRANSITIONS=37} [2025-04-13 20:56:14,504 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2025-04-13 20:56:14,504 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 37 transitions, 119 flow [2025-04-13 20:56:14,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:56:14,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:14,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:14,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:56:14,505 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:56:14,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash -60265696, now seen corresponding path program 1 times [2025-04-13 20:56:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:14,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78855084] [2025-04-13 20:56:14,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:56:14,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:14,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:56:14,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:56:14,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:56:14,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:14,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:56:14,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:14,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78855084] [2025-04-13 20:56:14,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78855084] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:56:14,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:56:14,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:56:14,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150932454] [2025-04-13 20:56:14,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:56:14,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:56:14,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:14,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:56:14,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:56:14,584 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-04-13 20:56:14,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 37 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 20:56:14,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:14,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-04-13 20:56:14,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:14,718 INFO L116 PetriNetUnfolderBase]: 695/1070 cut-off events. [2025-04-13 20:56:14,718 INFO L117 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-04-13 20:56:14,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2190 conditions, 1070 events. 695/1070 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4091 event pairs, 334 based on Foata normal form. 8/791 useless extension candidates. Maximal degree in co-relation 2168. Up to 774 conditions per place. [2025-04-13 20:56:14,722 INFO L140 encePairwiseOnDemand]: 36/38 looper letters, 48 selfloop transitions, 1 changer transitions 2/53 dead transitions. [2025-04-13 20:56:14,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 53 transitions, 264 flow [2025-04-13 20:56:14,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:56:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:56:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-04-13 20:56:14,723 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2025-04-13 20:56:14,723 INFO L175 Difference]: Start difference. First operand has 36 places, 37 transitions, 119 flow. Second operand 3 states and 62 transitions. [2025-04-13 20:56:14,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 53 transitions, 264 flow [2025-04-13 20:56:14,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 53 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:56:14,725 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 122 flow [2025-04-13 20:56:14,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2025-04-13 20:56:14,725 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2025-04-13 20:56:14,725 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 122 flow [2025-04-13 20:56:14,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 20:56:14,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:14,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:14,727 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:56:14,727 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:56:14,728 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:14,728 INFO L85 PathProgramCache]: Analyzing trace with hash 473396364, now seen corresponding path program 2 times [2025-04-13 20:56:14,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:14,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645534039] [2025-04-13 20:56:14,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:56:14,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:14,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:56:14,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 25 statements. [2025-04-13 20:56:14,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:56:14,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:56:14,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:14,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645534039] [2025-04-13 20:56:14,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645534039] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:56:14,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:56:14,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:56:14,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542442040] [2025-04-13 20:56:14,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:56:14,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:56:14,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:14,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:56:14,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:56:14,800 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-04-13 20:56:14,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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 20:56:14,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:14,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-04-13 20:56:14,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:14,917 INFO L116 PetriNetUnfolderBase]: 610/951 cut-off events. [2025-04-13 20:56:14,917 INFO L117 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2025-04-13 20:56:14,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1931 conditions, 951 events. 610/951 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3367 event pairs, 73 based on Foata normal form. 35/787 useless extension candidates. Maximal degree in co-relation 1908. Up to 531 conditions per place. [2025-04-13 20:56:14,921 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 51 selfloop transitions, 5 changer transitions 2/60 dead transitions. [2025-04-13 20:56:14,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 291 flow [2025-04-13 20:56:14,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:56:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:56:14,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-13 20:56:14,922 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5131578947368421 [2025-04-13 20:56:14,922 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 122 flow. Second operand 4 states and 78 transitions. [2025-04-13 20:56:14,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 60 transitions, 291 flow [2025-04-13 20:56:14,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 288 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:56:14,941 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 149 flow [2025-04-13 20:56:14,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2025-04-13 20:56:14,942 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2025-04-13 20:56:14,942 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 149 flow [2025-04-13 20:56:14,942 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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 20:56:14,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:14,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:14,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:56:14,943 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:56:14,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:14,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1032286133, now seen corresponding path program 1 times [2025-04-13 20:56:14,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:14,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337443207] [2025-04-13 20:56:14,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:56:14,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:14,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:56:14,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:56:14,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:56:14,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:56:15,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:15,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337443207] [2025-04-13 20:56:15,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337443207] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:56:15,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32569607] [2025-04-13 20:56:15,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:56:15,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:56:15,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:56:15,065 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 20:56:15,066 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 20:56:15,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:56:15,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:56:15,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:56:15,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:15,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:56:15,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:56:15,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:56:15,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:56:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:56:15,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32569607] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:56:15,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:56:15,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-04-13 20:56:15,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472486698] [2025-04-13 20:56:15,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:56:15,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:56:15,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:15,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:56:15,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:56:15,294 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-04-13 20:56:15,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 149 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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 20:56:15,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:15,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-04-13 20:56:15,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:15,522 INFO L116 PetriNetUnfolderBase]: 610/956 cut-off events. [2025-04-13 20:56:15,522 INFO L117 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-04-13 20:56:15,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2261 conditions, 956 events. 610/956 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3211 event pairs, 309 based on Foata normal form. 20/797 useless extension candidates. Maximal degree in co-relation 2121. Up to 799 conditions per place. [2025-04-13 20:56:15,529 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 32 selfloop transitions, 9 changer transitions 23/66 dead transitions. [2025-04-13 20:56:15,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 373 flow [2025-04-13 20:56:15,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:56:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:56:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2025-04-13 20:56:15,531 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33223684210526316 [2025-04-13 20:56:15,531 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 149 flow. Second operand 8 states and 101 transitions. [2025-04-13 20:56:15,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 373 flow [2025-04-13 20:56:15,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 369 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 20:56:15,533 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 201 flow [2025-04-13 20:56:15,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=201, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2025-04-13 20:56:15,535 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2025-04-13 20:56:15,535 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 201 flow [2025-04-13 20:56:15,535 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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 20:56:15,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:15,535 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:15,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 20:56:15,739 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 20:56:15,739 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:56:15,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:15,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1082692708, now seen corresponding path program 2 times [2025-04-13 20:56:15,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:15,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517850947] [2025-04-13 20:56:15,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:56:15,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:15,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 20:56:15,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-04-13 20:56:15,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:56:15,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 20:56:15,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:15,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517850947] [2025-04-13 20:56:15,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517850947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:56:15,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:56:15,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:56:15,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65140165] [2025-04-13 20:56:15,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:56:15,821 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:56:15,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:15,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:56:15,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:56:15,822 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-04-13 20:56:15,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 20:56:15,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:15,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-04-13 20:56:15,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:16,026 INFO L116 PetriNetUnfolderBase]: 969/1431 cut-off events. [2025-04-13 20:56:16,027 INFO L117 PetriNetUnfolderBase]: For 508/508 co-relation queries the response was YES. [2025-04-13 20:56:16,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3442 conditions, 1431 events. 969/1431 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5536 event pairs, 299 based on Foata normal form. 33/1154 useless extension candidates. Maximal degree in co-relation 3405. Up to 805 conditions per place. [2025-04-13 20:56:16,033 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 76 selfloop transitions, 3 changer transitions 4/85 dead transitions. [2025-04-13 20:56:16,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 85 transitions, 506 flow [2025-04-13 20:56:16,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:56:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:56:16,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-13 20:56:16,034 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5657894736842105 [2025-04-13 20:56:16,034 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 201 flow. Second operand 4 states and 86 transitions. [2025-04-13 20:56:16,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 85 transitions, 506 flow [2025-04-13 20:56:16,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 85 transitions, 478 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-04-13 20:56:16,038 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 203 flow [2025-04-13 20:56:16,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-04-13 20:56:16,038 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2025-04-13 20:56:16,038 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 203 flow [2025-04-13 20:56:16,038 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 20:56:16,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:16,038 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:16,040 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:56:16,040 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:56:16,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:16,041 INFO L85 PathProgramCache]: Analyzing trace with hash -621525596, now seen corresponding path program 3 times [2025-04-13 20:56:16,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:16,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008591829] [2025-04-13 20:56:16,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:56:16,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:16,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-04-13 20:56:16,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-04-13 20:56:16,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:56:16,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 20:56:16,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:16,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008591829] [2025-04-13 20:56:16,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008591829] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:56:16,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:56:16,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:56:16,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258053036] [2025-04-13 20:56:16,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:56:16,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:56:16,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:16,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:56:16,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:56:16,126 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-04-13 20:56:16,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 20:56:16,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:16,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-04-13 20:56:16,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:16,380 INFO L116 PetriNetUnfolderBase]: 1786/2616 cut-off events. [2025-04-13 20:56:16,380 INFO L117 PetriNetUnfolderBase]: For 1791/1791 co-relation queries the response was YES. [2025-04-13 20:56:16,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6928 conditions, 2616 events. 1786/2616 cut-off events. For 1791/1791 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10926 event pairs, 185 based on Foata normal form. 80/2197 useless extension candidates. Maximal degree in co-relation 6894. Up to 1364 conditions per place. [2025-04-13 20:56:16,392 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 93 selfloop transitions, 12 changer transitions 1/108 dead transitions. [2025-04-13 20:56:16,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 108 transitions, 648 flow [2025-04-13 20:56:16,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:56:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:56:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-04-13 20:56:16,394 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 20:56:16,394 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 203 flow. Second operand 6 states and 114 transitions. [2025-04-13 20:56:16,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 108 transitions, 648 flow [2025-04-13 20:56:16,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 630 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-13 20:56:16,398 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 283 flow [2025-04-13 20:56:16,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2025-04-13 20:56:16,398 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2025-04-13 20:56:16,398 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 283 flow [2025-04-13 20:56:16,398 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 20:56:16,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:16,399 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:16,400 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:56:16,400 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:56:16,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:16,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1252740796, now seen corresponding path program 4 times [2025-04-13 20:56:16,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:16,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641491964] [2025-04-13 20:56:16,400 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:56:16,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:16,411 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 20:56:16,413 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 20:56:16,413 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:56:16,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 20:56:16,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:16,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641491964] [2025-04-13 20:56:16,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641491964] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:56:16,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:56:16,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:56:16,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667477274] [2025-04-13 20:56:16,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:56:16,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:56:16,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:56:16,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:56:16,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:56:16,431 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2025-04-13 20:56:16,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 20:56:16,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:56:16,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2025-04-13 20:56:16,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:56:16,652 INFO L116 PetriNetUnfolderBase]: 1625/2394 cut-off events. [2025-04-13 20:56:16,652 INFO L117 PetriNetUnfolderBase]: For 3244/3244 co-relation queries the response was YES. [2025-04-13 20:56:16,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7234 conditions, 2394 events. 1625/2394 cut-off events. For 3244/3244 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9906 event pairs, 458 based on Foata normal form. 80/2035 useless extension candidates. Maximal degree in co-relation 7197. Up to 1375 conditions per place. [2025-04-13 20:56:16,664 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 80 selfloop transitions, 13 changer transitions 1/96 dead transitions. [2025-04-13 20:56:16,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 96 transitions, 664 flow [2025-04-13 20:56:16,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:56:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:56:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-04-13 20:56:16,665 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2025-04-13 20:56:16,665 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 283 flow. Second operand 4 states and 82 transitions. [2025-04-13 20:56:16,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 96 transitions, 664 flow [2025-04-13 20:56:16,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 96 transitions, 650 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-13 20:56:16,670 INFO L231 Difference]: Finished difference. Result has 57 places, 59 transitions, 347 flow [2025-04-13 20:56:16,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=347, PETRI_PLACES=57, PETRI_TRANSITIONS=59} [2025-04-13 20:56:16,670 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2025-04-13 20:56:16,671 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 347 flow [2025-04-13 20:56:16,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 20:56:16,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:56:16,671 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:56:16,671 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:56:16,671 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:56:16,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:56:16,671 INFO L85 PathProgramCache]: Analyzing trace with hash 647031279, now seen corresponding path program 1 times [2025-04-13 20:56:16,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:56:16,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691355167] [2025-04-13 20:56:16,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:56:16,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:56:16,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:56:16,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:56:16,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:56:16,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:56:18,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:56:18,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691355167] [2025-04-13 20:56:18,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691355167] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:56:18,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169770322] [2025-04-13 20:56:18,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:56:18,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:56:18,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:56:18,168 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 20:56:18,169 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 20:56:18,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 20:56:18,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 20:56:18,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:56:18,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:56:18,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 20:56:18,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:56:18,712 INFO L325 Elim1Store]: treesize reduction 80, result has 60.2 percent of original size [2025-04-13 20:56:18,713 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 135 treesize of output 171 [2025-04-13 20:56:53,174 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification. DAG size of input: 826 DAG size of output: 817 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)