/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-3-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:20:20,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:20:20,215 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-14 01:20:20,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:20:20,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:20:20,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:20:20,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:20:20,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:20:20,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:20:20,243 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:20:20,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:20:20,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:20:20,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:20:20,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:20:20,244 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:20:20,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:20:20,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:20:20,244 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:20:20,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:20:20,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:20:20,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:20:20,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:20:20,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:20:20,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:20:20,244 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:20:20,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:20:20,244 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:20:20,245 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:20:20,245 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:20:20,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:20:20,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:20:20,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:20:20,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:20:20,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:20:20,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:20:20,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:20:20,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:20:20,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:20:20,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:20:20,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:20:20,245 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:20:20,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:20:20,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:20:20,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:20:20,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:20:20,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:20:20,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:20:20,246 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:20:20,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:20:20,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:20:20,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:20:20,484 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:20:20,485 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:20:20,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-04-14 01:20:21,778 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35489301/8d335cad548646e1a2b312239d43c915/FLAG263260892 [2025-04-14 01:20:21,981 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:20:21,981 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-04-14 01:20:21,991 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35489301/8d335cad548646e1a2b312239d43c915/FLAG263260892 [2025-04-14 01:20:22,980 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a35489301/8d335cad548646e1a2b312239d43c915 [2025-04-14 01:20:22,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:20:22,983 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:20:22,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:20:22,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:20:22,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:20:22,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:20:22" (1/1) ... [2025-04-14 01:20:22,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5d57f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:20:22, skipping insertion in model container [2025-04-14 01:20:22,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:20:22" (1/1) ... [2025-04-14 01:20:23,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:20:23,150 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-more-queue-add-3-nl.wvr.c[3654,3667] [2025-04-14 01:20:23,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:20:23,167 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:20:23,201 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-more-queue-add-3-nl.wvr.c[3654,3667] [2025-04-14 01:20:23,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:20:23,224 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:20:23,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:20:23 WrapperNode [2025-04-14 01:20:23,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:20:23,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:20:23,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:20:23,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:20:23,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:20:23" (1/1) ... [2025-04-14 01:20:23,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:20:23" (1/1) ... [2025-04-14 01:20:23,264 INFO L138 Inliner]: procedures = 25, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 237 [2025-04-14 01:20:23,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:20:23,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:20:23,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:20:23,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:20:23,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:20:23" (1/1) ... [2025-04-14 01:20:23,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:20:23" (1/1) ... [2025-04-14 01:20:23,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:20:23" (1/1) ... [2025-04-14 01:20:23,295 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-14 01:20:23,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:20:23" (1/1) ... [2025-04-14 01:20:23,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:20:23" (1/1) ... [2025-04-14 01:20:23,303 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:20:23" (1/1) ... [2025-04-14 01:20:23,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:20:23" (1/1) ... [2025-04-14 01:20:23,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:20:23" (1/1) ... [2025-04-14 01:20:23,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:20:23" (1/1) ... [2025-04-14 01:20:23,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:20:23,313 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:20:23,313 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:20:23,313 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:20:23,317 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:20:23" (1/1) ... [2025-04-14 01:20:23,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:20:23,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:23,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 01:20:23,347 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-14 01:20:23,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:20:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:20:23,362 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:20:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:20:23,362 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:20:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:20:23,362 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:20:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:20:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:20:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:20:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:20:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:20:23,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:20:23,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:20:23,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:20:23,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:20:23,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:20:23,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:20:23,364 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:20:23,470 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:20:23,471 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:20:23,780 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:20:23,780 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:20:23,780 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:20:24,041 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:20:24,044 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:20:24,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:20:24 BoogieIcfgContainer [2025-04-14 01:20:24,044 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:20:24,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:20:24,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:20:24,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:20:24,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:20:22" (1/3) ... [2025-04-14 01:20:24,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d281b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:20:24, skipping insertion in model container [2025-04-14 01:20:24,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:20:23" (2/3) ... [2025-04-14 01:20:24,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d281b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:20:24, skipping insertion in model container [2025-04-14 01:20:24,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:20:24" (3/3) ... [2025-04-14 01:20:24,054 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2025-04-14 01:20:24,064 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:20:24,065 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-3-nl.wvr.c that has 4 procedures, 30 locations, 34 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-14 01:20:24,065 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:20:24,105 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 01:20:24,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 95 flow [2025-04-14 01:20:24,156 INFO L116 PetriNetUnfolderBase]: 8/34 cut-off events. [2025-04-14 01:20:24,158 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:20:24,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 8/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-14 01:20:24,160 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 37 transitions, 95 flow [2025-04-14 01:20:24,165 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 33 transitions, 84 flow [2025-04-14 01:20:24,172 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:20:24,182 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;@1c6b01aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:20:24,182 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:20:24,190 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:20:24,190 INFO L116 PetriNetUnfolderBase]: 8/32 cut-off events. [2025-04-14 01:20:24,190 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:20:24,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:24,191 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] [2025-04-14 01:20:24,191 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-14 01:20:24,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:24,194 INFO L85 PathProgramCache]: Analyzing trace with hash 224872796, now seen corresponding path program 1 times [2025-04-14 01:20:24,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:24,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035482068] [2025-04-14 01:20:24,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:24,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:24,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:20:24,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:20:24,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:24,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:24,370 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-14 01:20:24,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:24,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035482068] [2025-04-14 01:20:24,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035482068] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:24,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:24,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:20:24,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201721781] [2025-04-14 01:20:24,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:24,379 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 01:20:24,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:24,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 01:20:24,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 01:20:24,398 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:24,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:24,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:24,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:24,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:24,601 INFO L116 PetriNetUnfolderBase]: 831/1172 cut-off events. [2025-04-14 01:20:24,601 INFO L117 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-04-14 01:20:24,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2448 conditions, 1172 events. 831/1172 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3783 event pairs, 595 based on Foata normal form. 0/936 useless extension candidates. Maximal degree in co-relation 2264. Up to 1173 conditions per place. [2025-04-14 01:20:24,612 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 31 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2025-04-14 01:20:24,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 142 flow [2025-04-14 01:20:24,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 01:20:24,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 01:20:24,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2025-04-14 01:20:24,621 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2025-04-14 01:20:24,622 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 84 flow. Second operand 2 states and 39 transitions. [2025-04-14 01:20:24,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 142 flow [2025-04-14 01:20:24,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 01:20:24,633 INFO L231 Difference]: Finished difference. Result has 30 places, 31 transitions, 68 flow [2025-04-14 01:20:24,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=30, PETRI_TRANSITIONS=31} [2025-04-14 01:20:24,639 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2025-04-14 01:20:24,639 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 31 transitions, 68 flow [2025-04-14 01:20:24,640 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:24,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:24,640 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] [2025-04-14 01:20:24,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:20:24,640 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-14 01:20:24,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:24,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1311367192, now seen corresponding path program 1 times [2025-04-14 01:20:24,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:24,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579937780] [2025-04-14 01:20:24,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:24,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:24,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:20:24,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:20:24,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:24,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:24,934 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-14 01:20:24,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:24,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579937780] [2025-04-14 01:20:24,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579937780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:24,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:24,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:20:24,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384439387] [2025-04-14 01:20:24,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:24,935 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:20:24,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:24,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:20:24,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:20:24,936 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:24,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-14 01:20:24,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:24,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:24,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:25,142 INFO L116 PetriNetUnfolderBase]: 932/1343 cut-off events. [2025-04-14 01:20:25,142 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-14 01:20:25,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2736 conditions, 1343 events. 932/1343 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4597 event pairs, 682 based on Foata normal form. 74/1144 useless extension candidates. Maximal degree in co-relation 2733. Up to 1173 conditions per place. [2025-04-14 01:20:25,153 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 30 selfloop transitions, 2 changer transitions 18/50 dead transitions. [2025-04-14 01:20:25,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 50 transitions, 209 flow [2025-04-14 01:20:25,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:20:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:20:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2025-04-14 01:20:25,156 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3675675675675676 [2025-04-14 01:20:25,156 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 68 flow. Second operand 5 states and 68 transitions. [2025-04-14 01:20:25,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 50 transitions, 209 flow [2025-04-14 01:20:25,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 50 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:20:25,158 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 90 flow [2025-04-14 01:20:25,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-04-14 01:20:25,159 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-04-14 01:20:25,159 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 90 flow [2025-04-14 01:20:25,159 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-14 01:20:25,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:25,161 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] [2025-04-14 01:20:25,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:20:25,161 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-14 01:20:25,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:25,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1955967264, now seen corresponding path program 1 times [2025-04-14 01:20:25,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:25,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411956732] [2025-04-14 01:20:25,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:25,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:25,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:20:25,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:20:25,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:25,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:25,351 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-14 01:20:25,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:25,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411956732] [2025-04-14 01:20:25,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411956732] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:25,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:25,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:20:25,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840831771] [2025-04-14 01:20:25,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:25,351 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:20:25,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:25,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:20:25,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:20:25,352 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:25,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-14 01:20:25,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:25,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:25,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:25,533 INFO L116 PetriNetUnfolderBase]: 1051/1521 cut-off events. [2025-04-14 01:20:25,533 INFO L117 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2025-04-14 01:20:25,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3366 conditions, 1521 events. 1051/1521 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5425 event pairs, 775 based on Foata normal form. 77/1321 useless extension candidates. Maximal degree in co-relation 3359. Up to 1174 conditions per place. [2025-04-14 01:20:25,540 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 31 selfloop transitions, 2 changer transitions 18/51 dead transitions. [2025-04-14 01:20:25,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 51 transitions, 244 flow [2025-04-14 01:20:25,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:20:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:20:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-14 01:20:25,542 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2025-04-14 01:20:25,542 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 90 flow. Second operand 4 states and 64 transitions. [2025-04-14 01:20:25,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 51 transitions, 244 flow [2025-04-14 01:20:25,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 51 transitions, 232 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-14 01:20:25,544 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 98 flow [2025-04-14 01:20:25,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-04-14 01:20:25,544 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-04-14 01:20:25,544 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 98 flow [2025-04-14 01:20:25,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-14 01:20:25,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:25,545 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-14 01:20:25,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:20:25,545 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-14 01:20:25,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:25,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2065448931, now seen corresponding path program 1 times [2025-04-14 01:20:25,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:25,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023599352] [2025-04-14 01:20:25,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:25,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:25,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:20:25,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:20:25,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:25,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:26,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:26,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:26,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023599352] [2025-04-14 01:20:26,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023599352] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:26,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:26,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:26,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25641712] [2025-04-14 01:20:26,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:26,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:26,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:26,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:26,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:26,437 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:26,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 98 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:26,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:26,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:26,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:26,996 INFO L116 PetriNetUnfolderBase]: 1668/2317 cut-off events. [2025-04-14 01:20:26,996 INFO L117 PetriNetUnfolderBase]: For 431/431 co-relation queries the response was YES. [2025-04-14 01:20:26,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5338 conditions, 2317 events. 1668/2317 cut-off events. For 431/431 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8971 event pairs, 153 based on Foata normal form. 1/1854 useless extension candidates. Maximal degree in co-relation 5330. Up to 1521 conditions per place. [2025-04-14 01:20:27,008 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 85 selfloop transitions, 35 changer transitions 2/122 dead transitions. [2025-04-14 01:20:27,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 122 transitions, 579 flow [2025-04-14 01:20:27,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:20:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:20:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 151 transitions. [2025-04-14 01:20:27,009 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4081081081081081 [2025-04-14 01:20:27,010 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 98 flow. Second operand 10 states and 151 transitions. [2025-04-14 01:20:27,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 122 transitions, 579 flow [2025-04-14 01:20:27,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 122 transitions, 575 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:20:27,013 INFO L231 Difference]: Finished difference. Result has 49 places, 66 transitions, 276 flow [2025-04-14 01:20:27,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=276, PETRI_PLACES=49, PETRI_TRANSITIONS=66} [2025-04-14 01:20:27,015 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2025-04-14 01:20:27,015 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 66 transitions, 276 flow [2025-04-14 01:20:27,015 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:27,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:27,015 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-14 01:20:27,015 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:20:27,015 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-14 01:20:27,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:27,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1139431645, now seen corresponding path program 2 times [2025-04-14 01:20:27,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:27,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071652044] [2025-04-14 01:20:27,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:20:27,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:27,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:27,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-14 01:20:27,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:20:27,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:27,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:27,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:27,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071652044] [2025-04-14 01:20:27,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071652044] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:27,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:27,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:20:27,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542272103] [2025-04-14 01:20:27,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:27,065 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:20:27,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:27,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:20:27,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:20:27,065 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:27,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 66 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-14 01:20:27,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:27,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:27,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:27,225 INFO L116 PetriNetUnfolderBase]: 1373/1956 cut-off events. [2025-04-14 01:20:27,225 INFO L117 PetriNetUnfolderBase]: For 879/879 co-relation queries the response was YES. [2025-04-14 01:20:27,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5751 conditions, 1956 events. 1373/1956 cut-off events. For 879/879 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7544 event pairs, 305 based on Foata normal form. 46/1684 useless extension candidates. Maximal degree in co-relation 5739. Up to 1689 conditions per place. [2025-04-14 01:20:27,237 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 82 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2025-04-14 01:20:27,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 85 transitions, 519 flow [2025-04-14 01:20:27,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:20:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:20:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-04-14 01:20:27,241 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2025-04-14 01:20:27,241 INFO L175 Difference]: Start difference. First operand has 49 places, 66 transitions, 276 flow. Second operand 3 states and 53 transitions. [2025-04-14 01:20:27,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 85 transitions, 519 flow [2025-04-14 01:20:27,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 85 transitions, 517 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:20:27,246 INFO L231 Difference]: Finished difference. Result has 51 places, 68 transitions, 297 flow [2025-04-14 01:20:27,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=51, PETRI_TRANSITIONS=68} [2025-04-14 01:20:27,247 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2025-04-14 01:20:27,247 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 68 transitions, 297 flow [2025-04-14 01:20:27,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-14 01:20:27,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:27,247 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-14 01:20:27,247 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:20:27,248 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-14 01:20:27,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:27,248 INFO L85 PathProgramCache]: Analyzing trace with hash 747993731, now seen corresponding path program 3 times [2025-04-14 01:20:27,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:27,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71365361] [2025-04-14 01:20:27,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:20:27,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:27,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:27,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-14 01:20:27,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:20:27,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:27,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:27,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71365361] [2025-04-14 01:20:27,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71365361] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:27,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:27,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:20:27,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613447984] [2025-04-14 01:20:27,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:27,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:20:27,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:27,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:20:27,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:20:27,304 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:27,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 68 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-14 01:20:27,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:27,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:27,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:27,464 INFO L116 PetriNetUnfolderBase]: 1129/1666 cut-off events. [2025-04-14 01:20:27,465 INFO L117 PetriNetUnfolderBase]: For 1273/1273 co-relation queries the response was YES. [2025-04-14 01:20:27,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5222 conditions, 1666 events. 1129/1666 cut-off events. For 1273/1273 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6319 event pairs, 383 based on Foata normal form. 85/1506 useless extension candidates. Maximal degree in co-relation 5208. Up to 1068 conditions per place. [2025-04-14 01:20:27,475 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 83 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-04-14 01:20:27,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 85 transitions, 543 flow [2025-04-14 01:20:27,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:20:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:20:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-04-14 01:20:27,476 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2025-04-14 01:20:27,476 INFO L175 Difference]: Start difference. First operand has 51 places, 68 transitions, 297 flow. Second operand 3 states and 53 transitions. [2025-04-14 01:20:27,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 85 transitions, 543 flow [2025-04-14 01:20:27,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 85 transitions, 524 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-04-14 01:20:27,480 INFO L231 Difference]: Finished difference. Result has 52 places, 68 transitions, 294 flow [2025-04-14 01:20:27,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=52, PETRI_TRANSITIONS=68} [2025-04-14 01:20:27,481 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2025-04-14 01:20:27,481 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 68 transitions, 294 flow [2025-04-14 01:20:27,481 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-14 01:20:27,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:27,481 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-14 01:20:27,481 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:20:27,481 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-14 01:20:27,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:27,482 INFO L85 PathProgramCache]: Analyzing trace with hash 92405201, now seen corresponding path program 4 times [2025-04-14 01:20:27,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:27,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252834174] [2025-04-14 01:20:27,482 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:20:27,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:27,491 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:27,522 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:20:27,522 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:20:27,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:28,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:28,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252834174] [2025-04-14 01:20:28,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252834174] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:28,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:28,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:28,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880318995] [2025-04-14 01:20:28,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:28,050 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:28,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:28,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:28,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:28,051 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:28,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 68 transitions, 294 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:28,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:28,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:28,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:28,440 INFO L116 PetriNetUnfolderBase]: 1251/1850 cut-off events. [2025-04-14 01:20:28,441 INFO L117 PetriNetUnfolderBase]: For 1239/1239 co-relation queries the response was YES. [2025-04-14 01:20:28,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5740 conditions, 1850 events. 1251/1850 cut-off events. For 1239/1239 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7367 event pairs, 196 based on Foata normal form. 1/1581 useless extension candidates. Maximal degree in co-relation 5726. Up to 1420 conditions per place. [2025-04-14 01:20:28,452 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 85 selfloop transitions, 44 changer transitions 3/132 dead transitions. [2025-04-14 01:20:28,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 132 transitions, 815 flow [2025-04-14 01:20:28,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:20:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:20:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2025-04-14 01:20:28,453 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3783783783783784 [2025-04-14 01:20:28,453 INFO L175 Difference]: Start difference. First operand has 52 places, 68 transitions, 294 flow. Second operand 10 states and 140 transitions. [2025-04-14 01:20:28,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 132 transitions, 815 flow [2025-04-14 01:20:28,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 132 transitions, 783 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-04-14 01:20:28,459 INFO L231 Difference]: Finished difference. Result has 64 places, 88 transitions, 535 flow [2025-04-14 01:20:28,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=535, PETRI_PLACES=64, PETRI_TRANSITIONS=88} [2025-04-14 01:20:28,460 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2025-04-14 01:20:28,460 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 88 transitions, 535 flow [2025-04-14 01:20:28,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:28,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:28,460 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-14 01:20:28,461 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:20:28,461 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-14 01:20:28,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:28,461 INFO L85 PathProgramCache]: Analyzing trace with hash 837699847, now seen corresponding path program 5 times [2025-04-14 01:20:28,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:28,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099528827] [2025-04-14 01:20:28,461 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:20:28,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:28,472 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:28,497 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:20:28,497 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:20:28,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:29,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:29,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099528827] [2025-04-14 01:20:29,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099528827] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:29,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:29,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:29,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260343493] [2025-04-14 01:20:29,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:29,072 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:29,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:29,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:29,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:29,073 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:29,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 88 transitions, 535 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:29,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:29,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:29,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:29,580 INFO L116 PetriNetUnfolderBase]: 1396/2077 cut-off events. [2025-04-14 01:20:29,581 INFO L117 PetriNetUnfolderBase]: For 2167/2167 co-relation queries the response was YES. [2025-04-14 01:20:29,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7269 conditions, 2077 events. 1396/2077 cut-off events. For 2167/2167 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8691 event pairs, 155 based on Foata normal form. 1/1848 useless extension candidates. Maximal degree in co-relation 7251. Up to 1480 conditions per place. [2025-04-14 01:20:29,593 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 98 selfloop transitions, 53 changer transitions 2/153 dead transitions. [2025-04-14 01:20:29,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 153 transitions, 1084 flow [2025-04-14 01:20:29,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:20:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:20:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions. [2025-04-14 01:20:29,594 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41081081081081083 [2025-04-14 01:20:29,594 INFO L175 Difference]: Start difference. First operand has 64 places, 88 transitions, 535 flow. Second operand 10 states and 152 transitions. [2025-04-14 01:20:29,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 153 transitions, 1084 flow [2025-04-14 01:20:29,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 153 transitions, 1059 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-04-14 01:20:29,602 INFO L231 Difference]: Finished difference. Result has 73 places, 99 transitions, 712 flow [2025-04-14 01:20:29,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=712, PETRI_PLACES=73, PETRI_TRANSITIONS=99} [2025-04-14 01:20:29,602 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 38 predicate places. [2025-04-14 01:20:29,602 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 99 transitions, 712 flow [2025-04-14 01:20:29,603 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:29,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:29,603 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-14 01:20:29,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:20:29,603 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-14 01:20:29,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:29,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2143931263, now seen corresponding path program 6 times [2025-04-14 01:20:29,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:29,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834034951] [2025-04-14 01:20:29,603 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:20:29,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:29,612 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:29,626 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-14 01:20:29,626 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:20:29,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:30,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:30,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:30,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834034951] [2025-04-14 01:20:30,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834034951] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:30,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:30,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:30,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749039172] [2025-04-14 01:20:30,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:30,028 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:30,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:30,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:30,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:30,028 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:30,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 99 transitions, 712 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:30,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:30,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:30,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:30,436 INFO L116 PetriNetUnfolderBase]: 1409/2107 cut-off events. [2025-04-14 01:20:30,437 INFO L117 PetriNetUnfolderBase]: For 3275/3275 co-relation queries the response was YES. [2025-04-14 01:20:30,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8039 conditions, 2107 events. 1409/2107 cut-off events. For 3275/3275 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8991 event pairs, 183 based on Foata normal form. 1/1872 useless extension candidates. Maximal degree in co-relation 8019. Up to 1715 conditions per place. [2025-04-14 01:20:30,452 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 106 selfloop transitions, 42 changer transitions 3/151 dead transitions. [2025-04-14 01:20:30,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 151 transitions, 1200 flow [2025-04-14 01:20:30,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:20:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:20:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2025-04-14 01:20:30,453 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3864864864864865 [2025-04-14 01:20:30,453 INFO L175 Difference]: Start difference. First operand has 73 places, 99 transitions, 712 flow. Second operand 10 states and 143 transitions. [2025-04-14 01:20:30,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 151 transitions, 1200 flow [2025-04-14 01:20:30,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 151 transitions, 1125 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-04-14 01:20:30,463 INFO L231 Difference]: Finished difference. Result has 79 places, 102 transitions, 758 flow [2025-04-14 01:20:30,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=758, PETRI_PLACES=79, PETRI_TRANSITIONS=102} [2025-04-14 01:20:30,463 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 44 predicate places. [2025-04-14 01:20:30,463 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 102 transitions, 758 flow [2025-04-14 01:20:30,463 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:30,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:30,463 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-14 01:20:30,463 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:20:30,464 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-14 01:20:30,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:30,464 INFO L85 PathProgramCache]: Analyzing trace with hash 193662673, now seen corresponding path program 7 times [2025-04-14 01:20:30,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:30,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422261344] [2025-04-14 01:20:30,464 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:20:30,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:30,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:20:30,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:20:30,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:30,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:30,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:30,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422261344] [2025-04-14 01:20:30,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422261344] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:30,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:30,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:30,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820389030] [2025-04-14 01:20:30,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:30,875 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:30,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:30,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:30,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:30,876 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:30,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 102 transitions, 758 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:30,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:30,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:30,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:31,192 INFO L116 PetriNetUnfolderBase]: 1425/2137 cut-off events. [2025-04-14 01:20:31,192 INFO L117 PetriNetUnfolderBase]: For 3961/3961 co-relation queries the response was YES. [2025-04-14 01:20:31,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8399 conditions, 2137 events. 1425/2137 cut-off events. For 3961/3961 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9196 event pairs, 256 based on Foata normal form. 1/1959 useless extension candidates. Maximal degree in co-relation 8376. Up to 1870 conditions per place. [2025-04-14 01:20:31,201 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 105 selfloop transitions, 34 changer transitions 3/142 dead transitions. [2025-04-14 01:20:31,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 142 transitions, 1218 flow [2025-04-14 01:20:31,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:20:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:20:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2025-04-14 01:20:31,202 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35735735735735735 [2025-04-14 01:20:31,202 INFO L175 Difference]: Start difference. First operand has 79 places, 102 transitions, 758 flow. Second operand 9 states and 119 transitions. [2025-04-14 01:20:31,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 142 transitions, 1218 flow [2025-04-14 01:20:31,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 142 transitions, 1151 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-04-14 01:20:31,218 INFO L231 Difference]: Finished difference. Result has 83 places, 108 transitions, 834 flow [2025-04-14 01:20:31,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=834, PETRI_PLACES=83, PETRI_TRANSITIONS=108} [2025-04-14 01:20:31,219 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 48 predicate places. [2025-04-14 01:20:31,219 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 108 transitions, 834 flow [2025-04-14 01:20:31,219 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:31,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:31,219 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-14 01:20:31,219 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 01:20:31,219 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:31,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:31,220 INFO L85 PathProgramCache]: Analyzing trace with hash 63772739, now seen corresponding path program 8 times [2025-04-14 01:20:31,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:31,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477850221] [2025-04-14 01:20:31,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:20:31,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:31,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:31,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-14 01:20:31,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:20:31,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:31,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:31,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477850221] [2025-04-14 01:20:31,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477850221] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:31,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:31,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:31,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998782102] [2025-04-14 01:20:31,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:31,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:31,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:31,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:31,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:31,617 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:31,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 108 transitions, 834 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:31,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:31,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:31,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:32,000 INFO L116 PetriNetUnfolderBase]: 1534/2297 cut-off events. [2025-04-14 01:20:32,000 INFO L117 PetriNetUnfolderBase]: For 5054/5054 co-relation queries the response was YES. [2025-04-14 01:20:32,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9335 conditions, 2297 events. 1534/2297 cut-off events. For 5054/5054 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10039 event pairs, 257 based on Foata normal form. 1/2119 useless extension candidates. Maximal degree in co-relation 9309. Up to 1960 conditions per place. [2025-04-14 01:20:32,011 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 116 selfloop transitions, 41 changer transitions 2/159 dead transitions. [2025-04-14 01:20:32,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 159 transitions, 1403 flow [2025-04-14 01:20:32,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:20:32,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:20:32,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2025-04-14 01:20:32,012 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39039039039039036 [2025-04-14 01:20:32,012 INFO L175 Difference]: Start difference. First operand has 83 places, 108 transitions, 834 flow. Second operand 9 states and 130 transitions. [2025-04-14 01:20:32,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 159 transitions, 1403 flow [2025-04-14 01:20:32,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 159 transitions, 1318 flow, removed 25 selfloop flow, removed 5 redundant places. [2025-04-14 01:20:32,025 INFO L231 Difference]: Finished difference. Result has 89 places, 121 transitions, 992 flow [2025-04-14 01:20:32,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=992, PETRI_PLACES=89, PETRI_TRANSITIONS=121} [2025-04-14 01:20:32,026 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 54 predicate places. [2025-04-14 01:20:32,026 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 121 transitions, 992 flow [2025-04-14 01:20:32,026 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:32,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:32,027 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-14 01:20:32,027 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 01:20:32,027 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:32,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:32,027 INFO L85 PathProgramCache]: Analyzing trace with hash 360491099, now seen corresponding path program 9 times [2025-04-14 01:20:32,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:32,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424735083] [2025-04-14 01:20:32,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:20:32,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:32,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:32,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-14 01:20:32,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:20:32,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:32,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:32,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424735083] [2025-04-14 01:20:32,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424735083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:32,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:32,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:32,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072902477] [2025-04-14 01:20:32,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:32,369 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:32,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:32,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:32,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:32,370 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:32,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 121 transitions, 992 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:32,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:32,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:32,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:32,747 INFO L116 PetriNetUnfolderBase]: 1554/2339 cut-off events. [2025-04-14 01:20:32,747 INFO L117 PetriNetUnfolderBase]: For 6966/6966 co-relation queries the response was YES. [2025-04-14 01:20:32,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10268 conditions, 2339 events. 1554/2339 cut-off events. For 6966/6966 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10320 event pairs, 272 based on Foata normal form. 1/2156 useless extension candidates. Maximal degree in co-relation 10239. Up to 2037 conditions per place. [2025-04-14 01:20:32,761 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 121 selfloop transitions, 39 changer transitions 2/162 dead transitions. [2025-04-14 01:20:32,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 162 transitions, 1515 flow [2025-04-14 01:20:32,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:20:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:20:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2025-04-14 01:20:32,762 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3783783783783784 [2025-04-14 01:20:32,762 INFO L175 Difference]: Start difference. First operand has 89 places, 121 transitions, 992 flow. Second operand 9 states and 126 transitions. [2025-04-14 01:20:32,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 162 transitions, 1515 flow [2025-04-14 01:20:32,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 162 transitions, 1391 flow, removed 46 selfloop flow, removed 4 redundant places. [2025-04-14 01:20:32,781 INFO L231 Difference]: Finished difference. Result has 95 places, 126 transitions, 1031 flow [2025-04-14 01:20:32,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1031, PETRI_PLACES=95, PETRI_TRANSITIONS=126} [2025-04-14 01:20:32,781 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 60 predicate places. [2025-04-14 01:20:32,781 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 126 transitions, 1031 flow [2025-04-14 01:20:32,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:32,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:32,782 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-14 01:20:32,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 01:20:32,782 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:32,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:32,782 INFO L85 PathProgramCache]: Analyzing trace with hash 359896453, now seen corresponding path program 10 times [2025-04-14 01:20:32,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:32,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371781494] [2025-04-14 01:20:32,783 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:20:32,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:32,789 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:32,801 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:20:32,802 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:20:32,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:33,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:33,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371781494] [2025-04-14 01:20:33,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371781494] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:33,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:33,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:33,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673930524] [2025-04-14 01:20:33,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:33,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:33,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:33,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:33,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:33,093 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:33,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 126 transitions, 1031 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:33,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:33,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:33,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:33,503 INFO L116 PetriNetUnfolderBase]: 1574/2381 cut-off events. [2025-04-14 01:20:33,503 INFO L117 PetriNetUnfolderBase]: For 7511/7511 co-relation queries the response was YES. [2025-04-14 01:20:33,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10583 conditions, 2381 events. 1574/2381 cut-off events. For 7511/7511 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10637 event pairs, 290 based on Foata normal form. 1/2185 useless extension candidates. Maximal degree in co-relation 10551. Up to 1924 conditions per place. [2025-04-14 01:20:33,516 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 120 selfloop transitions, 49 changer transitions 3/172 dead transitions. [2025-04-14 01:20:33,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 172 transitions, 1600 flow [2025-04-14 01:20:33,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:20:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:20:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2025-04-14 01:20:33,517 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37027027027027026 [2025-04-14 01:20:33,517 INFO L175 Difference]: Start difference. First operand has 95 places, 126 transitions, 1031 flow. Second operand 10 states and 137 transitions. [2025-04-14 01:20:33,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 172 transitions, 1600 flow [2025-04-14 01:20:33,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 172 transitions, 1500 flow, removed 30 selfloop flow, removed 5 redundant places. [2025-04-14 01:20:33,539 INFO L231 Difference]: Finished difference. Result has 101 places, 130 transitions, 1119 flow [2025-04-14 01:20:33,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1119, PETRI_PLACES=101, PETRI_TRANSITIONS=130} [2025-04-14 01:20:33,539 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 66 predicate places. [2025-04-14 01:20:33,539 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 130 transitions, 1119 flow [2025-04-14 01:20:33,540 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:33,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:33,540 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-14 01:20:33,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 01:20:33,540 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:33,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:33,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1646840569, now seen corresponding path program 11 times [2025-04-14 01:20:33,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:33,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850078748] [2025-04-14 01:20:33,541 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:20:33,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:33,548 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:33,565 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:20:33,565 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:20:33,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:33,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:33,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850078748] [2025-04-14 01:20:33,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850078748] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:33,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:33,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:33,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284533640] [2025-04-14 01:20:33,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:33,936 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:33,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:33,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:33,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:33,937 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:33,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 130 transitions, 1119 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:33,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:33,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:33,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:34,377 INFO L116 PetriNetUnfolderBase]: 1642/2477 cut-off events. [2025-04-14 01:20:34,377 INFO L117 PetriNetUnfolderBase]: For 9451/9451 co-relation queries the response was YES. [2025-04-14 01:20:34,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11580 conditions, 2477 events. 1642/2477 cut-off events. For 9451/9451 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 11117 event pairs, 285 based on Foata normal form. 1/2278 useless extension candidates. Maximal degree in co-relation 11545. Up to 2072 conditions per place. [2025-04-14 01:20:34,393 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 126 selfloop transitions, 51 changer transitions 2/179 dead transitions. [2025-04-14 01:20:34,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 179 transitions, 1782 flow [2025-04-14 01:20:34,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:20:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:20:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2025-04-14 01:20:34,394 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39039039039039036 [2025-04-14 01:20:34,394 INFO L175 Difference]: Start difference. First operand has 101 places, 130 transitions, 1119 flow. Second operand 9 states and 130 transitions. [2025-04-14 01:20:34,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 179 transitions, 1782 flow [2025-04-14 01:20:34,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 179 transitions, 1653 flow, removed 36 selfloop flow, removed 7 redundant places. [2025-04-14 01:20:34,423 INFO L231 Difference]: Finished difference. Result has 104 places, 141 transitions, 1292 flow [2025-04-14 01:20:34,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1292, PETRI_PLACES=104, PETRI_TRANSITIONS=141} [2025-04-14 01:20:34,423 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2025-04-14 01:20:34,423 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 141 transitions, 1292 flow [2025-04-14 01:20:34,424 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:34,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:34,424 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-14 01:20:34,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 01:20:34,424 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:34,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:34,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1350122209, now seen corresponding path program 12 times [2025-04-14 01:20:34,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:34,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676263962] [2025-04-14 01:20:34,424 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:20:34,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:34,431 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:34,442 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-14 01:20:34,442 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:20:34,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:34,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:34,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676263962] [2025-04-14 01:20:34,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676263962] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:34,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:34,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:34,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150286859] [2025-04-14 01:20:34,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:34,730 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:34,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:34,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:34,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:34,731 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:34,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 141 transitions, 1292 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:34,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:34,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:34,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:35,113 INFO L116 PetriNetUnfolderBase]: 1662/2519 cut-off events. [2025-04-14 01:20:35,115 INFO L117 PetriNetUnfolderBase]: For 11477/11477 co-relation queries the response was YES. [2025-04-14 01:20:35,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12223 conditions, 2519 events. 1662/2519 cut-off events. For 11477/11477 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11394 event pairs, 319 based on Foata normal form. 1/2315 useless extension candidates. Maximal degree in co-relation 12186. Up to 2161 conditions per place. [2025-04-14 01:20:35,130 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 132 selfloop transitions, 48 changer transitions 2/182 dead transitions. [2025-04-14 01:20:35,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 182 transitions, 1885 flow [2025-04-14 01:20:35,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:20:35,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:20:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2025-04-14 01:20:35,132 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3783783783783784 [2025-04-14 01:20:35,132 INFO L175 Difference]: Start difference. First operand has 104 places, 141 transitions, 1292 flow. Second operand 9 states and 126 transitions. [2025-04-14 01:20:35,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 182 transitions, 1885 flow [2025-04-14 01:20:35,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 182 transitions, 1720 flow, removed 65 selfloop flow, removed 5 redundant places. [2025-04-14 01:20:35,161 INFO L231 Difference]: Finished difference. Result has 109 places, 146 transitions, 1345 flow [2025-04-14 01:20:35,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1345, PETRI_PLACES=109, PETRI_TRANSITIONS=146} [2025-04-14 01:20:35,162 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 74 predicate places. [2025-04-14 01:20:35,163 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 146 transitions, 1345 flow [2025-04-14 01:20:35,163 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:35,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:35,163 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-14 01:20:35,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 01:20:35,163 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:35,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2032316437, now seen corresponding path program 13 times [2025-04-14 01:20:35,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:35,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066024480] [2025-04-14 01:20:35,164 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:20:35,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:35,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:20:35,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:20:35,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:35,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:35,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:35,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066024480] [2025-04-14 01:20:35,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066024480] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:35,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:35,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:35,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252735314] [2025-04-14 01:20:35,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:35,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:35,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:35,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:35,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:35,584 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:35,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 146 transitions, 1345 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:35,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:35,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:35,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:36,072 INFO L116 PetriNetUnfolderBase]: 1893/2869 cut-off events. [2025-04-14 01:20:36,072 INFO L117 PetriNetUnfolderBase]: For 15110/15110 co-relation queries the response was YES. [2025-04-14 01:20:36,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14235 conditions, 2869 events. 1893/2869 cut-off events. For 15110/15110 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 13538 event pairs, 306 based on Foata normal form. 1/2657 useless extension candidates. Maximal degree in co-relation 14196. Up to 2254 conditions per place. [2025-04-14 01:20:36,093 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 149 selfloop transitions, 62 changer transitions 2/213 dead transitions. [2025-04-14 01:20:36,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 213 transitions, 2228 flow [2025-04-14 01:20:36,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:20:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:20:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2025-04-14 01:20:36,094 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4027027027027027 [2025-04-14 01:20:36,094 INFO L175 Difference]: Start difference. First operand has 109 places, 146 transitions, 1345 flow. Second operand 10 states and 149 transitions. [2025-04-14 01:20:36,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 213 transitions, 2228 flow [2025-04-14 01:20:36,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 213 transitions, 2083 flow, removed 49 selfloop flow, removed 6 redundant places. [2025-04-14 01:20:36,130 INFO L231 Difference]: Finished difference. Result has 115 places, 162 transitions, 1634 flow [2025-04-14 01:20:36,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1634, PETRI_PLACES=115, PETRI_TRANSITIONS=162} [2025-04-14 01:20:36,131 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 80 predicate places. [2025-04-14 01:20:36,131 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 162 transitions, 1634 flow [2025-04-14 01:20:36,131 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:36,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:36,132 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-14 01:20:36,132 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 01:20:36,132 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:36,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2094824707, now seen corresponding path program 14 times [2025-04-14 01:20:36,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:36,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772114913] [2025-04-14 01:20:36,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:20:36,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:36,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:36,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-14 01:20:36,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:20:36,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:36,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:36,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772114913] [2025-04-14 01:20:36,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772114913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:36,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:36,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:36,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883139509] [2025-04-14 01:20:36,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:36,462 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:36,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:36,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:36,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:36,463 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:36,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 162 transitions, 1634 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:36,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:36,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:36,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:36,925 INFO L116 PetriNetUnfolderBase]: 1961/2975 cut-off events. [2025-04-14 01:20:36,925 INFO L117 PetriNetUnfolderBase]: For 18022/18022 co-relation queries the response was YES. [2025-04-14 01:20:36,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15648 conditions, 2975 events. 1961/2975 cut-off events. For 18022/18022 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13919 event pairs, 420 based on Foata normal form. 1/2758 useless extension candidates. Maximal degree in co-relation 15606. Up to 2485 conditions per place. [2025-04-14 01:20:36,943 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 150 selfloop transitions, 64 changer transitions 2/216 dead transitions. [2025-04-14 01:20:36,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 216 transitions, 2434 flow [2025-04-14 01:20:36,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:20:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:20:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2025-04-14 01:20:36,949 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3810810810810811 [2025-04-14 01:20:36,949 INFO L175 Difference]: Start difference. First operand has 115 places, 162 transitions, 1634 flow. Second operand 10 states and 141 transitions. [2025-04-14 01:20:36,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 216 transitions, 2434 flow [2025-04-14 01:20:37,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 216 transitions, 2188 flow, removed 107 selfloop flow, removed 4 redundant places. [2025-04-14 01:20:37,023 INFO L231 Difference]: Finished difference. Result has 123 places, 173 transitions, 1761 flow [2025-04-14 01:20:37,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1761, PETRI_PLACES=123, PETRI_TRANSITIONS=173} [2025-04-14 01:20:37,024 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 88 predicate places. [2025-04-14 01:20:37,024 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 173 transitions, 1761 flow [2025-04-14 01:20:37,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:37,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:37,024 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-14 01:20:37,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 01:20:37,024 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:37,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:37,025 INFO L85 PathProgramCache]: Analyzing trace with hash 404795983, now seen corresponding path program 15 times [2025-04-14 01:20:37,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:37,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199407765] [2025-04-14 01:20:37,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:20:37,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:37,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:37,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-14 01:20:37,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:20:37,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:37,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:37,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199407765] [2025-04-14 01:20:37,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199407765] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:37,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:37,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:37,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011605482] [2025-04-14 01:20:37,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:37,411 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:37,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:37,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:37,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:37,412 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:37,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 173 transitions, 1761 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:37,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:37,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:37,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:37,861 INFO L116 PetriNetUnfolderBase]: 2003/3044 cut-off events. [2025-04-14 01:20:37,861 INFO L117 PetriNetUnfolderBase]: For 15538/15538 co-relation queries the response was YES. [2025-04-14 01:20:37,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15747 conditions, 3044 events. 2003/3044 cut-off events. For 15538/15538 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14614 event pairs, 384 based on Foata normal form. 1/2792 useless extension candidates. Maximal degree in co-relation 15701. Up to 2582 conditions per place. [2025-04-14 01:20:37,886 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 159 selfloop transitions, 56 changer transitions 2/217 dead transitions. [2025-04-14 01:20:37,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 217 transitions, 2408 flow [2025-04-14 01:20:37,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:20:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:20:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2025-04-14 01:20:37,890 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39039039039039036 [2025-04-14 01:20:37,890 INFO L175 Difference]: Start difference. First operand has 123 places, 173 transitions, 1761 flow. Second operand 9 states and 130 transitions. [2025-04-14 01:20:37,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 217 transitions, 2408 flow [2025-04-14 01:20:37,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 217 transitions, 2228 flow, removed 58 selfloop flow, removed 6 redundant places. [2025-04-14 01:20:37,954 INFO L231 Difference]: Finished difference. Result has 127 places, 179 transitions, 1808 flow [2025-04-14 01:20:37,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1585, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1808, PETRI_PLACES=127, PETRI_TRANSITIONS=179} [2025-04-14 01:20:37,955 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 92 predicate places. [2025-04-14 01:20:37,955 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 179 transitions, 1808 flow [2025-04-14 01:20:37,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:37,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:37,955 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-14 01:20:37,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 01:20:37,956 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:37,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:37,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1903654869, now seen corresponding path program 16 times [2025-04-14 01:20:37,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:37,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440809004] [2025-04-14 01:20:37,956 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:20:37,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:37,963 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:37,979 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:20:37,979 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:20:37,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:38,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:38,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440809004] [2025-04-14 01:20:38,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440809004] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:38,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:38,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:38,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309309332] [2025-04-14 01:20:38,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:38,309 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:38,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:38,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:38,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:38,309 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:38,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 179 transitions, 1808 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:38,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:38,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:38,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:38,979 INFO L116 PetriNetUnfolderBase]: 2175/3301 cut-off events. [2025-04-14 01:20:38,979 INFO L117 PetriNetUnfolderBase]: For 17332/17332 co-relation queries the response was YES. [2025-04-14 01:20:38,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17245 conditions, 3301 events. 2175/3301 cut-off events. For 17332/17332 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 15954 event pairs, 400 based on Foata normal form. 1/3030 useless extension candidates. Maximal degree in co-relation 17197. Up to 2305 conditions per place. [2025-04-14 01:20:38,996 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 162 selfloop transitions, 80 changer transitions 2/244 dead transitions. [2025-04-14 01:20:38,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 244 transitions, 2670 flow [2025-04-14 01:20:38,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:20:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:20:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2025-04-14 01:20:38,997 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3955773955773956 [2025-04-14 01:20:38,998 INFO L175 Difference]: Start difference. First operand has 127 places, 179 transitions, 1808 flow. Second operand 11 states and 161 transitions. [2025-04-14 01:20:38,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 244 transitions, 2670 flow [2025-04-14 01:20:39,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 244 transitions, 2539 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-04-14 01:20:39,032 INFO L231 Difference]: Finished difference. Result has 133 places, 187 transitions, 2006 flow [2025-04-14 01:20:39,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1677, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2006, PETRI_PLACES=133, PETRI_TRANSITIONS=187} [2025-04-14 01:20:39,033 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 98 predicate places. [2025-04-14 01:20:39,033 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 187 transitions, 2006 flow [2025-04-14 01:20:39,033 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:39,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:39,033 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-14 01:20:39,033 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 01:20:39,033 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:39,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:39,034 INFO L85 PathProgramCache]: Analyzing trace with hash -672374075, now seen corresponding path program 17 times [2025-04-14 01:20:39,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:39,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137849766] [2025-04-14 01:20:39,034 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:20:39,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:39,039 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:39,050 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:20:39,050 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:20:39,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:39,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:39,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137849766] [2025-04-14 01:20:39,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137849766] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:39,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:39,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:39,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097169805] [2025-04-14 01:20:39,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:39,369 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:39,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:39,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:39,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:39,369 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:39,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 187 transitions, 2006 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:39,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:39,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:39,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:39,946 INFO L116 PetriNetUnfolderBase]: 2217/3370 cut-off events. [2025-04-14 01:20:39,946 INFO L117 PetriNetUnfolderBase]: For 22725/22725 co-relation queries the response was YES. [2025-04-14 01:20:39,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18685 conditions, 3370 events. 2217/3370 cut-off events. For 22725/22725 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 16436 event pairs, 416 based on Foata normal form. 1/3093 useless extension candidates. Maximal degree in co-relation 18635. Up to 2684 conditions per place. [2025-04-14 01:20:39,966 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 157 selfloop transitions, 79 changer transitions 2/238 dead transitions. [2025-04-14 01:20:39,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 238 transitions, 2771 flow [2025-04-14 01:20:39,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:20:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:20:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 145 transitions. [2025-04-14 01:20:39,967 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3918918918918919 [2025-04-14 01:20:39,967 INFO L175 Difference]: Start difference. First operand has 133 places, 187 transitions, 2006 flow. Second operand 10 states and 145 transitions. [2025-04-14 01:20:39,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 238 transitions, 2771 flow [2025-04-14 01:20:40,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 238 transitions, 2671 flow, removed 20 selfloop flow, removed 6 redundant places. [2025-04-14 01:20:40,022 INFO L231 Difference]: Finished difference. Result has 138 places, 193 transitions, 2215 flow [2025-04-14 01:20:40,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1906, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2215, PETRI_PLACES=138, PETRI_TRANSITIONS=193} [2025-04-14 01:20:40,022 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 103 predicate places. [2025-04-14 01:20:40,022 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 193 transitions, 2215 flow [2025-04-14 01:20:40,022 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:40,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:40,022 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-14 01:20:40,023 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-14 01:20:40,023 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:40,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:40,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2092116771, now seen corresponding path program 18 times [2025-04-14 01:20:40,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:40,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879641192] [2025-04-14 01:20:40,023 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:20:40,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:40,030 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:40,041 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-14 01:20:40,041 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:20:40,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:40,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:40,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:40,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879641192] [2025-04-14 01:20:40,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879641192] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:40,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:40,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:40,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020482946] [2025-04-14 01:20:40,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:40,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:40,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:40,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:40,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:40,306 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:40,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 193 transitions, 2215 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:40,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:40,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:40,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:40,730 INFO L116 PetriNetUnfolderBase]: 2235/3407 cut-off events. [2025-04-14 01:20:40,730 INFO L117 PetriNetUnfolderBase]: For 25057/25057 co-relation queries the response was YES. [2025-04-14 01:20:40,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19737 conditions, 3407 events. 2235/3407 cut-off events. For 25057/25057 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 16868 event pairs, 535 based on Foata normal form. 1/3127 useless extension candidates. Maximal degree in co-relation 19684. Up to 3140 conditions per place. [2025-04-14 01:20:40,757 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 194 selfloop transitions, 34 changer transitions 3/231 dead transitions. [2025-04-14 01:20:40,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 231 transitions, 2969 flow [2025-04-14 01:20:40,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:20:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:20:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2025-04-14 01:20:40,758 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35435435435435436 [2025-04-14 01:20:40,758 INFO L175 Difference]: Start difference. First operand has 138 places, 193 transitions, 2215 flow. Second operand 9 states and 118 transitions. [2025-04-14 01:20:40,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 231 transitions, 2969 flow [2025-04-14 01:20:40,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 231 transitions, 2765 flow, removed 42 selfloop flow, removed 7 redundant places. [2025-04-14 01:20:40,838 INFO L231 Difference]: Finished difference. Result has 141 places, 199 transitions, 2252 flow [2025-04-14 01:20:40,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2039, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2252, PETRI_PLACES=141, PETRI_TRANSITIONS=199} [2025-04-14 01:20:40,840 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 106 predicate places. [2025-04-14 01:20:40,840 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 199 transitions, 2252 flow [2025-04-14 01:20:40,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:40,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:40,841 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-14 01:20:40,841 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 01:20:40,841 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:40,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:40,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1503265117, now seen corresponding path program 19 times [2025-04-14 01:20:40,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:40,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216418367] [2025-04-14 01:20:40,842 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:20:40,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:40,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:20:40,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:20:40,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:40,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:41,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:41,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216418367] [2025-04-14 01:20:41,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216418367] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:41,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:41,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:41,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896013052] [2025-04-14 01:20:41,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:41,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:41,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:41,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:41,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:41,121 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:41,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 199 transitions, 2252 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:41,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:41,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:41,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:41,668 INFO L116 PetriNetUnfolderBase]: 2281/3478 cut-off events. [2025-04-14 01:20:41,669 INFO L117 PetriNetUnfolderBase]: For 22830/22830 co-relation queries the response was YES. [2025-04-14 01:20:41,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19629 conditions, 3478 events. 2281/3478 cut-off events. For 22830/22830 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 17255 event pairs, 532 based on Foata normal form. 1/3193 useless extension candidates. Maximal degree in co-relation 19574. Up to 3176 conditions per place. [2025-04-14 01:20:41,695 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 203 selfloop transitions, 39 changer transitions 2/244 dead transitions. [2025-04-14 01:20:41,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 244 transitions, 3043 flow [2025-04-14 01:20:41,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:20:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:20:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2025-04-14 01:20:41,696 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37537537537537535 [2025-04-14 01:20:41,696 INFO L175 Difference]: Start difference. First operand has 141 places, 199 transitions, 2252 flow. Second operand 9 states and 125 transitions. [2025-04-14 01:20:41,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 244 transitions, 3043 flow [2025-04-14 01:20:41,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 244 transitions, 2888 flow, removed 60 selfloop flow, removed 5 redundant places. [2025-04-14 01:20:41,822 INFO L231 Difference]: Finished difference. Result has 147 places, 210 transitions, 2390 flow [2025-04-14 01:20:41,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2097, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2390, PETRI_PLACES=147, PETRI_TRANSITIONS=210} [2025-04-14 01:20:41,823 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 112 predicate places. [2025-04-14 01:20:41,823 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 210 transitions, 2390 flow [2025-04-14 01:20:41,823 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:41,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:41,823 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-14 01:20:41,823 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-14 01:20:41,823 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:41,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:41,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1503859763, now seen corresponding path program 20 times [2025-04-14 01:20:41,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:41,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423784863] [2025-04-14 01:20:41,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:20:41,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:41,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:41,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-14 01:20:41,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:20:41,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:42,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:42,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423784863] [2025-04-14 01:20:42,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423784863] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:42,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:42,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:42,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146184302] [2025-04-14 01:20:42,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:42,078 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:42,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:42,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:42,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:42,079 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:42,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 210 transitions, 2390 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:42,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:42,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:42,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:42,614 INFO L116 PetriNetUnfolderBase]: 2301/3520 cut-off events. [2025-04-14 01:20:42,615 INFO L117 PetriNetUnfolderBase]: For 25950/25950 co-relation queries the response was YES. [2025-04-14 01:20:42,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20426 conditions, 3520 events. 2301/3520 cut-off events. For 25950/25950 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 17630 event pairs, 552 based on Foata normal form. 1/3230 useless extension candidates. Maximal degree in co-relation 20368. Up to 3243 conditions per place. [2025-04-14 01:20:42,642 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 209 selfloop transitions, 35 changer transitions 3/247 dead transitions. [2025-04-14 01:20:42,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 247 transitions, 3131 flow [2025-04-14 01:20:42,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:20:42,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:20:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2025-04-14 01:20:42,644 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36036036036036034 [2025-04-14 01:20:42,644 INFO L175 Difference]: Start difference. First operand has 147 places, 210 transitions, 2390 flow. Second operand 9 states and 120 transitions. [2025-04-14 01:20:42,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 247 transitions, 3131 flow [2025-04-14 01:20:42,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 247 transitions, 2979 flow, removed 60 selfloop flow, removed 4 redundant places. [2025-04-14 01:20:42,739 INFO L231 Difference]: Finished difference. Result has 153 places, 214 transitions, 2446 flow [2025-04-14 01:20:42,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2238, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2446, PETRI_PLACES=153, PETRI_TRANSITIONS=214} [2025-04-14 01:20:42,740 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 118 predicate places. [2025-04-14 01:20:42,740 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 214 transitions, 2446 flow [2025-04-14 01:20:42,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:42,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:42,740 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-14 01:20:42,740 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-14 01:20:42,740 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:42,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:42,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1081088871, now seen corresponding path program 21 times [2025-04-14 01:20:42,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:42,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405584878] [2025-04-14 01:20:42,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:20:42,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:42,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:42,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-14 01:20:42,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:20:42,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:42,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:42,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405584878] [2025-04-14 01:20:42,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405584878] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:42,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:42,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:42,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826978190] [2025-04-14 01:20:42,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:42,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:42,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:42,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:42,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:42,977 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:42,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 214 transitions, 2446 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:42,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:42,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:42,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:43,530 INFO L116 PetriNetUnfolderBase]: 2319/3553 cut-off events. [2025-04-14 01:20:43,530 INFO L117 PetriNetUnfolderBase]: For 28518/28518 co-relation queries the response was YES. [2025-04-14 01:20:43,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20836 conditions, 3553 events. 2319/3553 cut-off events. For 28518/28518 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 17850 event pairs, 548 based on Foata normal form. 1/3260 useless extension candidates. Maximal degree in co-relation 20775. Up to 3195 conditions per place. [2025-04-14 01:20:43,556 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 206 selfloop transitions, 48 changer transitions 2/256 dead transitions. [2025-04-14 01:20:43,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 256 transitions, 3258 flow [2025-04-14 01:20:43,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:20:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:20:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2025-04-14 01:20:43,557 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37537537537537535 [2025-04-14 01:20:43,557 INFO L175 Difference]: Start difference. First operand has 153 places, 214 transitions, 2446 flow. Second operand 9 states and 125 transitions. [2025-04-14 01:20:43,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 256 transitions, 3258 flow [2025-04-14 01:20:43,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 256 transitions, 3092 flow, removed 64 selfloop flow, removed 6 redundant places. [2025-04-14 01:20:43,670 INFO L231 Difference]: Finished difference. Result has 158 places, 222 transitions, 2589 flow [2025-04-14 01:20:43,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2284, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2589, PETRI_PLACES=158, PETRI_TRANSITIONS=222} [2025-04-14 01:20:43,671 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 123 predicate places. [2025-04-14 01:20:43,671 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 222 transitions, 2589 flow [2025-04-14 01:20:43,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:43,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:43,671 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-14 01:20:43,671 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-14 01:20:43,672 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:43,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash -711837385, now seen corresponding path program 22 times [2025-04-14 01:20:43,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:43,672 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916358934] [2025-04-14 01:20:43,672 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:20:43,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:43,677 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:43,688 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:20:43,688 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:20:43,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:43,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:43,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916358934] [2025-04-14 01:20:43,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916358934] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:43,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:43,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:43,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215893441] [2025-04-14 01:20:43,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:43,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:43,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:43,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:43,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:43,935 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:43,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 222 transitions, 2589 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:43,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:43,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:43,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:44,480 INFO L116 PetriNetUnfolderBase]: 2361/3622 cut-off events. [2025-04-14 01:20:44,480 INFO L117 PetriNetUnfolderBase]: For 30460/30460 co-relation queries the response was YES. [2025-04-14 01:20:44,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21539 conditions, 3622 events. 2361/3622 cut-off events. For 30460/30460 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 18355 event pairs, 553 based on Foata normal form. 1/3321 useless extension candidates. Maximal degree in co-relation 21475. Up to 3281 conditions per place. [2025-04-14 01:20:44,506 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 227 selfloop transitions, 39 changer transitions 2/268 dead transitions. [2025-04-14 01:20:44,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 268 transitions, 3388 flow [2025-04-14 01:20:44,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:20:44,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:20:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2025-04-14 01:20:44,508 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39039039039039036 [2025-04-14 01:20:44,508 INFO L175 Difference]: Start difference. First operand has 158 places, 222 transitions, 2589 flow. Second operand 9 states and 130 transitions. [2025-04-14 01:20:44,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 268 transitions, 3388 flow [2025-04-14 01:20:44,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 268 transitions, 3223 flow, removed 65 selfloop flow, removed 5 redundant places. [2025-04-14 01:20:44,628 INFO L231 Difference]: Finished difference. Result has 163 places, 229 transitions, 2639 flow [2025-04-14 01:20:44,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2428, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2639, PETRI_PLACES=163, PETRI_TRANSITIONS=229} [2025-04-14 01:20:44,629 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 128 predicate places. [2025-04-14 01:20:44,629 INFO L485 AbstractCegarLoop]: Abstraction has has 163 places, 229 transitions, 2639 flow [2025-04-14 01:20:44,629 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:44,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:44,629 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-14 01:20:44,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-14 01:20:44,629 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:44,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:44,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1666666875, now seen corresponding path program 23 times [2025-04-14 01:20:44,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:44,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956094591] [2025-04-14 01:20:44,630 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:20:44,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:44,635 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:44,642 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:20:44,642 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:20:44,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:44,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:44,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956094591] [2025-04-14 01:20:44,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956094591] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:44,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:44,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:44,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743198828] [2025-04-14 01:20:44,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:44,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:44,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:44,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:44,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:44,951 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:44,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 229 transitions, 2639 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:44,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:44,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:44,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:45,519 INFO L116 PetriNetUnfolderBase]: 2369/3644 cut-off events. [2025-04-14 01:20:45,519 INFO L117 PetriNetUnfolderBase]: For 30005/30005 co-relation queries the response was YES. [2025-04-14 01:20:45,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21838 conditions, 3644 events. 2369/3644 cut-off events. For 30005/30005 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 18556 event pairs, 558 based on Foata normal form. 1/3338 useless extension candidates. Maximal degree in co-relation 21772. Up to 3246 conditions per place. [2025-04-14 01:20:45,547 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 226 selfloop transitions, 44 changer transitions 2/272 dead transitions. [2025-04-14 01:20:45,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 272 transitions, 3421 flow [2025-04-14 01:20:45,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:20:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:20:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2025-04-14 01:20:45,548 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39039039039039036 [2025-04-14 01:20:45,548 INFO L175 Difference]: Start difference. First operand has 163 places, 229 transitions, 2639 flow. Second operand 9 states and 130 transitions. [2025-04-14 01:20:45,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 272 transitions, 3421 flow [2025-04-14 01:20:45,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 272 transitions, 3281 flow, removed 36 selfloop flow, removed 6 redundant places. [2025-04-14 01:20:45,686 INFO L231 Difference]: Finished difference. Result has 167 places, 233 transitions, 2693 flow [2025-04-14 01:20:45,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2499, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2693, PETRI_PLACES=167, PETRI_TRANSITIONS=233} [2025-04-14 01:20:45,686 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 132 predicate places. [2025-04-14 01:20:45,686 INFO L485 AbstractCegarLoop]: Abstraction has has 167 places, 233 transitions, 2693 flow [2025-04-14 01:20:45,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:45,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:45,687 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-14 01:20:45,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-14 01:20:45,687 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:45,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:45,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1799752837, now seen corresponding path program 24 times [2025-04-14 01:20:45,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:45,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990481473] [2025-04-14 01:20:45,687 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:20:45,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:45,696 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:45,706 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-14 01:20:45,706 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:20:45,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:46,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:46,008 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990481473] [2025-04-14 01:20:46,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990481473] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:46,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:46,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230663753] [2025-04-14 01:20:46,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:46,008 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:46,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:46,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:46,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:46,009 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:46,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 233 transitions, 2693 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:46,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:46,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:46,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:46,493 INFO L116 PetriNetUnfolderBase]: 2411/3713 cut-off events. [2025-04-14 01:20:46,493 INFO L117 PetriNetUnfolderBase]: For 32375/32375 co-relation queries the response was YES. [2025-04-14 01:20:46,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22345 conditions, 3713 events. 2411/3713 cut-off events. For 32375/32375 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 19020 event pairs, 582 based on Foata normal form. 1/3401 useless extension candidates. Maximal degree in co-relation 22277. Up to 3376 conditions per place. [2025-04-14 01:20:46,556 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 233 selfloop transitions, 41 changer transitions 2/276 dead transitions. [2025-04-14 01:20:46,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 276 transitions, 3513 flow [2025-04-14 01:20:46,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:20:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:20:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2025-04-14 01:20:46,557 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38738738738738737 [2025-04-14 01:20:46,557 INFO L175 Difference]: Start difference. First operand has 167 places, 233 transitions, 2693 flow. Second operand 9 states and 129 transitions. [2025-04-14 01:20:46,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 276 transitions, 3513 flow [2025-04-14 01:20:46,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 276 transitions, 3369 flow, removed 36 selfloop flow, removed 6 redundant places. [2025-04-14 01:20:46,708 INFO L231 Difference]: Finished difference. Result has 171 places, 240 transitions, 2787 flow [2025-04-14 01:20:46,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2553, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2787, PETRI_PLACES=171, PETRI_TRANSITIONS=240} [2025-04-14 01:20:46,709 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 136 predicate places. [2025-04-14 01:20:46,709 INFO L485 AbstractCegarLoop]: Abstraction has has 171 places, 240 transitions, 2787 flow [2025-04-14 01:20:46,709 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:46,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:46,709 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-14 01:20:46,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-14 01:20:46,709 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:46,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:46,710 INFO L85 PathProgramCache]: Analyzing trace with hash 784601151, now seen corresponding path program 25 times [2025-04-14 01:20:46,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:46,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296459377] [2025-04-14 01:20:46,710 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:20:46,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:46,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:20:46,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:20:46,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:46,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:46,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:46,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296459377] [2025-04-14 01:20:46,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296459377] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:46,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:46,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:46,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851280478] [2025-04-14 01:20:46,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:46,996 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:46,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:46,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:46,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:46,996 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:46,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 240 transitions, 2787 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:46,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:46,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:46,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:47,663 INFO L116 PetriNetUnfolderBase]: 2453/3782 cut-off events. [2025-04-14 01:20:47,663 INFO L117 PetriNetUnfolderBase]: For 34275/34275 co-relation queries the response was YES. [2025-04-14 01:20:47,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22922 conditions, 3782 events. 2453/3782 cut-off events. For 34275/34275 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 19528 event pairs, 578 based on Foata normal form. 1/3464 useless extension candidates. Maximal degree in co-relation 22852. Up to 3377 conditions per place. [2025-04-14 01:20:47,707 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 229 selfloop transitions, 51 changer transitions 2/282 dead transitions. [2025-04-14 01:20:47,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 282 transitions, 3615 flow [2025-04-14 01:20:47,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:20:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:20:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2025-04-14 01:20:47,708 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38738738738738737 [2025-04-14 01:20:47,708 INFO L175 Difference]: Start difference. First operand has 171 places, 240 transitions, 2787 flow. Second operand 9 states and 129 transitions. [2025-04-14 01:20:47,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 282 transitions, 3615 flow [2025-04-14 01:20:47,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 282 transitions, 3450 flow, removed 46 selfloop flow, removed 6 redundant places. [2025-04-14 01:20:47,864 INFO L231 Difference]: Finished difference. Result has 175 places, 246 transitions, 2878 flow [2025-04-14 01:20:47,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2622, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2878, PETRI_PLACES=175, PETRI_TRANSITIONS=246} [2025-04-14 01:20:47,865 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 140 predicate places. [2025-04-14 01:20:47,865 INFO L485 AbstractCegarLoop]: Abstraction has has 175 places, 246 transitions, 2878 flow [2025-04-14 01:20:47,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:47,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:47,865 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-14 01:20:47,865 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-14 01:20:47,865 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:47,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:47,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1791427793, now seen corresponding path program 26 times [2025-04-14 01:20:47,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:47,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643471674] [2025-04-14 01:20:47,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:20:47,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:47,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:20:47,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-14 01:20:47,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:20:47,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:48,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:48,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643471674] [2025-04-14 01:20:48,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643471674] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:48,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:48,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:48,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479213209] [2025-04-14 01:20:48,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:48,170 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:48,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:48,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:48,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:48,170 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:48,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 246 transitions, 2878 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:48,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:48,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:48,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:48,723 INFO L116 PetriNetUnfolderBase]: 2461/3804 cut-off events. [2025-04-14 01:20:48,723 INFO L117 PetriNetUnfolderBase]: For 36219/36219 co-relation queries the response was YES. [2025-04-14 01:20:48,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23162 conditions, 3804 events. 2461/3804 cut-off events. For 36219/36219 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 19699 event pairs, 587 based on Foata normal form. 1/3483 useless extension candidates. Maximal degree in co-relation 23090. Up to 3342 conditions per place. [2025-04-14 01:20:48,752 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 228 selfloop transitions, 56 changer transitions 2/286 dead transitions. [2025-04-14 01:20:48,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 286 transitions, 3691 flow [2025-04-14 01:20:48,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:20:48,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:20:48,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2025-04-14 01:20:48,753 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38738738738738737 [2025-04-14 01:20:48,753 INFO L175 Difference]: Start difference. First operand has 175 places, 246 transitions, 2878 flow. Second operand 9 states and 129 transitions. [2025-04-14 01:20:48,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 286 transitions, 3691 flow [2025-04-14 01:20:48,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 286 transitions, 3516 flow, removed 45 selfloop flow, removed 6 redundant places. [2025-04-14 01:20:48,912 INFO L231 Difference]: Finished difference. Result has 179 places, 250 transitions, 2948 flow [2025-04-14 01:20:48,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2707, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2948, PETRI_PLACES=179, PETRI_TRANSITIONS=250} [2025-04-14 01:20:48,913 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 144 predicate places. [2025-04-14 01:20:48,913 INFO L485 AbstractCegarLoop]: Abstraction has has 179 places, 250 transitions, 2948 flow [2025-04-14 01:20:48,913 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-14 01:20:48,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:48,913 INFO L206 CegarLoopForPetriNet]: trace histogram [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-14 01:20:48,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-14 01:20:48,914 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:48,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:48,914 INFO L85 PathProgramCache]: Analyzing trace with hash -717881851, now seen corresponding path program 1 times [2025-04-14 01:20:48,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:48,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315889883] [2025-04-14 01:20:48,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:48,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:48,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:20:48,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:20:48,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:48,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:20:48,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:48,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315889883] [2025-04-14 01:20:48,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315889883] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:48,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051815307] [2025-04-14 01:20:48,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:48,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:48,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:48,973 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-14 01:20:48,974 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-14 01:20:49,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:20:49,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:20:49,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:49,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:49,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-14 01:20:49,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:49,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:20:49,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051815307] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:49,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:20:49,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-04-14 01:20:49,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847167125] [2025-04-14 01:20:49,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:49,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:20:49,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:49,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:20:49,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:20:49,100 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:49,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 250 transitions, 2948 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-14 01:20:49,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:49,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:49,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:49,666 INFO L116 PetriNetUnfolderBase]: 3758/5676 cut-off events. [2025-04-14 01:20:49,666 INFO L117 PetriNetUnfolderBase]: For 76259/76259 co-relation queries the response was YES. [2025-04-14 01:20:49,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35263 conditions, 5676 events. 3758/5676 cut-off events. For 76259/76259 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 30235 event pairs, 872 based on Foata normal form. 90/5253 useless extension candidates. Maximal degree in co-relation 35189. Up to 2227 conditions per place. [2025-04-14 01:20:49,708 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 457 selfloop transitions, 13 changer transitions 11/481 dead transitions. [2025-04-14 01:20:49,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 481 transitions, 6873 flow [2025-04-14 01:20:49,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:20:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:20:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-04-14 01:20:49,709 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5608108108108109 [2025-04-14 01:20:49,709 INFO L175 Difference]: Start difference. First operand has 179 places, 250 transitions, 2948 flow. Second operand 4 states and 83 transitions. [2025-04-14 01:20:49,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 481 transitions, 6873 flow [2025-04-14 01:20:49,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 481 transitions, 6523 flow, removed 96 selfloop flow, removed 6 redundant places. [2025-04-14 01:20:49,950 INFO L231 Difference]: Finished difference. Result has 178 places, 255 transitions, 2841 flow [2025-04-14 01:20:49,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2769, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2841, PETRI_PLACES=178, PETRI_TRANSITIONS=255} [2025-04-14 01:20:49,951 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 143 predicate places. [2025-04-14 01:20:49,951 INFO L485 AbstractCegarLoop]: Abstraction has has 178 places, 255 transitions, 2841 flow [2025-04-14 01:20:49,951 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-14 01:20:49,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:49,951 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-14 01:20:49,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 01:20:50,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:50,152 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:50,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:50,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1692465961, now seen corresponding path program 1 times [2025-04-14 01:20:50,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:50,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486524339] [2025-04-14 01:20:50,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:50,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:50,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:20:50,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:20:50,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:50,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:20:50,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:50,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486524339] [2025-04-14 01:20:50,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486524339] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:50,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351324643] [2025-04-14 01:20:50,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:50,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:50,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:50,228 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-14 01:20:50,230 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-14 01:20:50,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:20:50,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:20:50,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:50,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:50,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:20:50,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:20:50,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:20:50,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351324643] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:20:50,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:20:50,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 01:20:50,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996615560] [2025-04-14 01:20:50,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:20:50,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:20:50,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:50,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:20:50,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:20:50,444 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:50,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 255 transitions, 2841 flow. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 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-14 01:20:50,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:50,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:50,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:51,543 INFO L116 PetriNetUnfolderBase]: 6574/9851 cut-off events. [2025-04-14 01:20:51,543 INFO L117 PetriNetUnfolderBase]: For 126549/126549 co-relation queries the response was YES. [2025-04-14 01:20:51,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62971 conditions, 9851 events. 6574/9851 cut-off events. For 126549/126549 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 56121 event pairs, 2468 based on Foata normal form. 328/9227 useless extension candidates. Maximal degree in co-relation 62895. Up to 5291 conditions per place. [2025-04-14 01:20:51,625 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 491 selfloop transitions, 6 changer transitions 17/514 dead transitions. [2025-04-14 01:20:51,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 514 transitions, 6703 flow [2025-04-14 01:20:51,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:20:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:20:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2025-04-14 01:20:51,625 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3552123552123552 [2025-04-14 01:20:51,625 INFO L175 Difference]: Start difference. First operand has 178 places, 255 transitions, 2841 flow. Second operand 7 states and 92 transitions. [2025-04-14 01:20:51,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 514 transitions, 6703 flow [2025-04-14 01:20:51,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 514 transitions, 6583 flow, removed 36 selfloop flow, removed 5 redundant places. [2025-04-14 01:20:52,000 INFO L231 Difference]: Finished difference. Result has 183 places, 259 transitions, 2837 flow [2025-04-14 01:20:52,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2781, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2837, PETRI_PLACES=183, PETRI_TRANSITIONS=259} [2025-04-14 01:20:52,001 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 148 predicate places. [2025-04-14 01:20:52,001 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 259 transitions, 2837 flow [2025-04-14 01:20:52,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 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-14 01:20:52,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:52,001 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1] [2025-04-14 01:20:52,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 01:20:52,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-04-14 01:20:52,202 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:52,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:52,203 INFO L85 PathProgramCache]: Analyzing trace with hash 793825891, now seen corresponding path program 2 times [2025-04-14 01:20:52,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:52,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052363803] [2025-04-14 01:20:52,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:20:52,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:52,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:20:52,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-04-14 01:20:52,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:20:52,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:20:52,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:52,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052363803] [2025-04-14 01:20:52,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052363803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:52,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:52,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:20:52,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506317405] [2025-04-14 01:20:52,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:52,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:20:52,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:52,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:20:52,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:20:52,279 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:52,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 259 transitions, 2837 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-14 01:20:52,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:52,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:52,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:53,469 INFO L116 PetriNetUnfolderBase]: 5600/8395 cut-off events. [2025-04-14 01:20:53,470 INFO L117 PetriNetUnfolderBase]: For 107034/107034 co-relation queries the response was YES. [2025-04-14 01:20:53,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52116 conditions, 8395 events. 5600/8395 cut-off events. For 107034/107034 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 46872 event pairs, 583 based on Foata normal form. 65/7704 useless extension candidates. Maximal degree in co-relation 52040. Up to 5540 conditions per place. [2025-04-14 01:20:53,570 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 293 selfloop transitions, 74 changer transitions 0/367 dead transitions. [2025-04-14 01:20:53,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 367 transitions, 4794 flow [2025-04-14 01:20:53,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:20:53,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:20:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2025-04-14 01:20:53,572 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4009009009009009 [2025-04-14 01:20:53,572 INFO L175 Difference]: Start difference. First operand has 183 places, 259 transitions, 2837 flow. Second operand 6 states and 89 transitions. [2025-04-14 01:20:53,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 367 transitions, 4794 flow [2025-04-14 01:20:53,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 367 transitions, 4771 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-04-14 01:20:53,796 INFO L231 Difference]: Finished difference. Result has 187 places, 261 transitions, 3118 flow [2025-04-14 01:20:53,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2776, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3118, PETRI_PLACES=187, PETRI_TRANSITIONS=261} [2025-04-14 01:20:53,797 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 152 predicate places. [2025-04-14 01:20:53,797 INFO L485 AbstractCegarLoop]: Abstraction has has 187 places, 261 transitions, 3118 flow [2025-04-14 01:20:53,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-14 01:20:53,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:53,797 INFO L206 CegarLoopForPetriNet]: trace histogram [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-14 01:20:53,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-14 01:20:53,797 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:53,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:53,798 INFO L85 PathProgramCache]: Analyzing trace with hash 272736979, now seen corresponding path program 1 times [2025-04-14 01:20:53,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:53,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286203838] [2025-04-14 01:20:53,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:53,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:53,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:20:53,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:20:53,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:53,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:53,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:53,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:53,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286203838] [2025-04-14 01:20:53,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286203838] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:53,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:53,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:20:53,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696168795] [2025-04-14 01:20:53,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:53,836 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:20:53,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:53,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:20:53,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:20:53,837 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:53,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 261 transitions, 3118 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-14 01:20:53,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:53,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:53,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:54,806 INFO L116 PetriNetUnfolderBase]: 6279/9560 cut-off events. [2025-04-14 01:20:54,806 INFO L117 PetriNetUnfolderBase]: For 190462/190462 co-relation queries the response was YES. [2025-04-14 01:20:54,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64560 conditions, 9560 events. 6279/9560 cut-off events. For 190462/190462 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 53636 event pairs, 1675 based on Foata normal form. 544/9624 useless extension candidates. Maximal degree in co-relation 64484. Up to 3452 conditions per place. [2025-04-14 01:20:54,890 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 132 selfloop transitions, 8 changer transitions 97/237 dead transitions. [2025-04-14 01:20:54,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 237 transitions, 3365 flow [2025-04-14 01:20:54,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:20:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:20:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-04-14 01:20:54,891 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2025-04-14 01:20:54,891 INFO L175 Difference]: Start difference. First operand has 187 places, 261 transitions, 3118 flow. Second operand 4 states and 89 transitions. [2025-04-14 01:20:54,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 237 transitions, 3365 flow [2025-04-14 01:20:55,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 237 transitions, 3166 flow, removed 30 selfloop flow, removed 17 redundant places. [2025-04-14 01:20:55,217 INFO L231 Difference]: Finished difference. Result has 175 places, 65 transitions, 690 flow [2025-04-14 01:20:55,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1798, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=690, PETRI_PLACES=175, PETRI_TRANSITIONS=65} [2025-04-14 01:20:55,217 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 140 predicate places. [2025-04-14 01:20:55,217 INFO L485 AbstractCegarLoop]: Abstraction has has 175 places, 65 transitions, 690 flow [2025-04-14 01:20:55,217 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-14 01:20:55,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:55,217 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-14 01:20:55,217 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-14 01:20:55,217 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:55,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:55,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1553691839, now seen corresponding path program 1 times [2025-04-14 01:20:55,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:55,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980611590] [2025-04-14 01:20:55,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:55,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:55,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 01:20:55,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:20:55,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:55,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:20:55,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:55,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980611590] [2025-04-14 01:20:55,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980611590] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:55,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002904216] [2025-04-14 01:20:55,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:55,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:55,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:55,289 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:20:55,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 01:20:55,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 01:20:55,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:20:55,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:55,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:55,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:20:55,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:20:55,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:20:55,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002904216] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:20:55,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:20:55,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-14 01:20:55,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381081055] [2025-04-14 01:20:55,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:20:55,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:20:55,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:55,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:20:55,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:20:55,468 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:55,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 65 transitions, 690 flow. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 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-14 01:20:55,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:55,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:55,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:56,547 INFO L116 PetriNetUnfolderBase]: 7120/10588 cut-off events. [2025-04-14 01:20:56,547 INFO L117 PetriNetUnfolderBase]: For 161082/161082 co-relation queries the response was YES. [2025-04-14 01:20:56,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69812 conditions, 10588 events. 7120/10588 cut-off events. For 161082/161082 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 56319 event pairs, 4050 based on Foata normal form. 228/10166 useless extension candidates. Maximal degree in co-relation 69748. Up to 8256 conditions per place. [2025-04-14 01:20:56,629 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 63 selfloop transitions, 3 changer transitions 62/128 dead transitions. [2025-04-14 01:20:56,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 128 transitions, 1594 flow [2025-04-14 01:20:56,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:20:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:20:56,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-04-14 01:20:56,630 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3783783783783784 [2025-04-14 01:20:56,630 INFO L175 Difference]: Start difference. First operand has 175 places, 65 transitions, 690 flow. Second operand 6 states and 84 transitions. [2025-04-14 01:20:56,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 128 transitions, 1594 flow [2025-04-14 01:20:56,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 128 transitions, 1064 flow, removed 125 selfloop flow, removed 33 redundant places. [2025-04-14 01:20:56,884 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 454 flow [2025-04-14 01:20:56,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=454, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2025-04-14 01:20:56,885 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 48 predicate places. [2025-04-14 01:20:56,885 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 454 flow [2025-04-14 01:20:56,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 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-14 01:20:56,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:56,885 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:56,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 01:20:57,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:57,086 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:57,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:57,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1380006742, now seen corresponding path program 2 times [2025-04-14 01:20:57,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:57,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591865909] [2025-04-14 01:20:57,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:20:57,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:57,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-14 01:20:57,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 32 statements. [2025-04-14 01:20:57,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:20:57,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:20:57,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:57,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591865909] [2025-04-14 01:20:57,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591865909] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:57,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:57,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:20:57,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428085684] [2025-04-14 01:20:57,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:57,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:20:57,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:57,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:20:57,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:20:57,165 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:57,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 454 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-14 01:20:57,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:57,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:57,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:57,821 INFO L116 PetriNetUnfolderBase]: 6408/9366 cut-off events. [2025-04-14 01:20:57,821 INFO L117 PetriNetUnfolderBase]: For 27034/27034 co-relation queries the response was YES. [2025-04-14 01:20:57,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40968 conditions, 9366 events. 6408/9366 cut-off events. For 27034/27034 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 48498 event pairs, 791 based on Foata normal form. 331/9157 useless extension candidates. Maximal degree in co-relation 40932. Up to 3753 conditions per place. [2025-04-14 01:20:57,887 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 143 selfloop transitions, 17 changer transitions 0/160 dead transitions. [2025-04-14 01:20:57,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 160 transitions, 1352 flow [2025-04-14 01:20:57,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:20:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:20:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2025-04-14 01:20:57,888 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44015444015444016 [2025-04-14 01:20:57,888 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 454 flow. Second operand 7 states and 114 transitions. [2025-04-14 01:20:57,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 160 transitions, 1352 flow [2025-04-14 01:20:57,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 160 transitions, 1332 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-04-14 01:20:57,916 INFO L231 Difference]: Finished difference. Result has 87 places, 73 transitions, 581 flow [2025-04-14 01:20:57,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=581, PETRI_PLACES=87, PETRI_TRANSITIONS=73} [2025-04-14 01:20:57,916 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 52 predicate places. [2025-04-14 01:20:57,916 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 73 transitions, 581 flow [2025-04-14 01:20:57,917 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-14 01:20:57,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:57,918 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:57,918 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-14 01:20:57,918 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:57,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:57,918 INFO L85 PathProgramCache]: Analyzing trace with hash 692815094, now seen corresponding path program 3 times [2025-04-14 01:20:57,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:57,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367118195] [2025-04-14 01:20:57,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:20:57,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:57,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-04-14 01:20:58,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 32 statements. [2025-04-14 01:20:58,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:20:58,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 01:20:58,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:58,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367118195] [2025-04-14 01:20:58,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367118195] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:58,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:58,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:20:58,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773553274] [2025-04-14 01:20:58,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:58,105 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:20:58,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:58,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:20:58,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:20:58,105 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:20:58,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 73 transitions, 581 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-14 01:20:58,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:58,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:20:58,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:58,905 INFO L116 PetriNetUnfolderBase]: 7115/10376 cut-off events. [2025-04-14 01:20:58,905 INFO L117 PetriNetUnfolderBase]: For 45384/45384 co-relation queries the response was YES. [2025-04-14 01:20:58,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49432 conditions, 10376 events. 7115/10376 cut-off events. For 45384/45384 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 52601 event pairs, 492 based on Foata normal form. 359/10141 useless extension candidates. Maximal degree in co-relation 49395. Up to 4961 conditions per place. [2025-04-14 01:20:58,993 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 140 selfloop transitions, 15 changer transitions 0/155 dead transitions. [2025-04-14 01:20:58,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 155 transitions, 1371 flow [2025-04-14 01:20:58,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:20:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:20:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2025-04-14 01:20:58,994 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-14 01:20:58,994 INFO L175 Difference]: Start difference. First operand has 87 places, 73 transitions, 581 flow. Second operand 8 states and 111 transitions. [2025-04-14 01:20:58,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 155 transitions, 1371 flow [2025-04-14 01:20:59,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 155 transitions, 1341 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-14 01:20:59,050 INFO L231 Difference]: Finished difference. Result has 93 places, 73 transitions, 607 flow [2025-04-14 01:20:59,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=607, PETRI_PLACES=93, PETRI_TRANSITIONS=73} [2025-04-14 01:20:59,051 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 58 predicate places. [2025-04-14 01:20:59,051 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 73 transitions, 607 flow [2025-04-14 01:20:59,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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-14 01:20:59,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:59,051 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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-14 01:20:59,051 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-14 01:20:59,051 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:59,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:59,052 INFO L85 PathProgramCache]: Analyzing trace with hash -228347592, now seen corresponding path program 1 times [2025-04-14 01:20:59,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:59,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204997338] [2025-04-14 01:20:59,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:59,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:59,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 01:20:59,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:20:59,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:59,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:21:01,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:01,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204997338] [2025-04-14 01:21:01,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204997338] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:01,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509701615] [2025-04-14 01:21:01,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:21:01,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:01,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:01,046 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:21:01,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 01:21:01,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 01:21:01,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:21:01,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:01,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:01,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-14 01:21:01,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:02,043 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:21:02,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:06,925 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~q2_back~0 4)) (.cse5 (select (select |c_#memory_int#1| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (let ((.cse0 (forall ((~q2~0.base Int) (~q2~0.offset Int)) (not (= (select (select |c_#memory_int#1| ~q2~0.base) (+ ~q2~0.offset .cse4)) .cse5)))) (.cse2 (mod c_~x~0 4294967296)) (.cse1 (* c_~C~0 2))) (and (or .cse0 (= (mod (+ .cse1 c_~z~0) 4294967296) .cse2)) (or .cse0 (= .cse2 (mod (+ c_~y~0 .cse1) 4294967296))) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse3 (select |c_#memory_int#1| ~q2~0.base))) (or (not (= (select .cse3 (+ ~q2~0.offset .cse4)) .cse5)) (= c_~N~0 (+ c_~t~0 (select .cse3 (+ ~q2~0.offset (* c_~q2_front~0 4))))))))))) is different from false [2025-04-14 01:21:10,971 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~q2_back~0 4)) (.cse5 (select (select |c_#memory_int#1| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (let ((.cse0 (forall ((~q2~0.base Int) (~q2~0.offset Int)) (not (= (select (select |c_#memory_int#1| ~q2~0.base) (+ ~q2~0.offset .cse4)) .cse5)))) (.cse2 (mod c_~x~0 4294967296)) (.cse1 (* c_~C~0 2))) (and (or .cse0 (= (mod (+ .cse1 c_~z~0) 4294967296) .cse2)) (or .cse0 (= .cse2 (mod (+ c_~y~0 .cse1) 4294967296))) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse3 (select |c_#memory_int#1| ~q2~0.base))) (or (= c_~N~0 (select .cse3 (+ ~q2~0.offset (* c_~q2_front~0 4)))) (not (= (select .cse3 (+ ~q2~0.offset .cse4)) .cse5)))))))) is different from false [2025-04-14 01:21:14,997 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~q2_back~0 4)) (.cse5 (select (select |c_#memory_int#1| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (let ((.cse1 (* c_~C~0 2)) (.cse2 (mod (+ c_~C~0 c_~x~0) 4294967296)) (.cse0 (forall ((~q2~0.base Int) (~q2~0.offset Int)) (not (= (select (select |c_#memory_int#1| ~q2~0.base) (+ ~q2~0.offset .cse4)) .cse5))))) (and (or .cse0 (= (mod (+ c_~y~0 .cse1) 4294967296) .cse2)) (or (= (mod (+ .cse1 c_~z~0) 4294967296) .cse2) .cse0) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse3 (select |c_#memory_int#1| ~q2~0.base))) (or (= c_~N~0 (select .cse3 (+ ~q2~0.offset (* c_~q2_front~0 4)))) (not (= (select .cse3 (+ ~q2~0.offset .cse4)) .cse5)))))))) is different from false [2025-04-14 01:21:15,281 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:21:15,281 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 118 treesize of output 293 [2025-04-14 01:21:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2025-04-14 01:21:17,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509701615] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:21:17,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:21:17,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 13] total 49 [2025-04-14 01:21:17,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178413075] [2025-04-14 01:21:17,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:21:17,354 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-14 01:21:17,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:17,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-14 01:21:17,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2136, Unknown=3, NotChecked=282, Total=2550 [2025-04-14 01:21:17,355 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:21:17,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 73 transitions, 607 flow. Second operand has 51 states, 51 states have (on average 4.9411764705882355) internal successors, (252), 51 states have internal predecessors, (252), 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-14 01:21:17,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:17,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:21:17,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:23:06,147 INFO L116 PetriNetUnfolderBase]: 7571/11117 cut-off events. [2025-04-14 01:23:06,148 INFO L117 PetriNetUnfolderBase]: For 56865/56865 co-relation queries the response was YES. [2025-04-14 01:23:06,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54066 conditions, 11117 events. 7571/11117 cut-off events. For 56865/56865 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 57809 event pairs, 2482 based on Foata normal form. 1/10510 useless extension candidates. Maximal degree in co-relation 54028. Up to 10389 conditions per place. [2025-04-14 01:23:06,208 INFO L140 encePairwiseOnDemand]: 18/37 looper letters, 198 selfloop transitions, 80 changer transitions 2/280 dead transitions. [2025-04-14 01:23:06,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 280 transitions, 2377 flow [2025-04-14 01:23:06,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 01:23:06,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-04-14 01:23:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 334 transitions. [2025-04-14 01:23:06,210 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2579150579150579 [2025-04-14 01:23:06,210 INFO L175 Difference]: Start difference. First operand has 93 places, 73 transitions, 607 flow. Second operand 35 states and 334 transitions. [2025-04-14 01:23:06,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 280 transitions, 2377 flow [2025-04-14 01:23:06,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 280 transitions, 2306 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-04-14 01:23:06,333 INFO L231 Difference]: Finished difference. Result has 128 places, 146 transitions, 1466 flow [2025-04-14 01:23:06,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=1466, PETRI_PLACES=128, PETRI_TRANSITIONS=146} [2025-04-14 01:23:06,333 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 93 predicate places. [2025-04-14 01:23:06,333 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 146 transitions, 1466 flow [2025-04-14 01:23:06,333 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.9411764705882355) internal successors, (252), 51 states have internal predecessors, (252), 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-14 01:23:06,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:23:06,333 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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-14 01:23:06,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 01:23:06,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-14 01:23:06,534 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:23:06,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:23:06,535 INFO L85 PathProgramCache]: Analyzing trace with hash 877258180, now seen corresponding path program 2 times [2025-04-14 01:23:06,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:23:06,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436840687] [2025-04-14 01:23:06,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:23:06,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:23:06,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:23:06,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:23:06,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:23:06,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:23:08,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:23:08,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436840687] [2025-04-14 01:23:08,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436840687] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:23:08,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235739874] [2025-04-14 01:23:08,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:23:08,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:08,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:23:08,282 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:23:08,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 01:23:08,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:23:08,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:23:08,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:23:08,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:08,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-14 01:23:08,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:23:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:23:09,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:23:10,700 INFO L325 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2025-04-14 01:23:10,701 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 118 treesize of output 246 [2025-04-14 01:23:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:23:11,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235739874] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:23:11,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:23:11,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 58 [2025-04-14 01:23:11,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161802849] [2025-04-14 01:23:11,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:23:11,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-04-14 01:23:11,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:23:11,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-04-14 01:23:11,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3314, Unknown=0, NotChecked=0, Total=3540 [2025-04-14 01:23:11,659 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:23:11,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 146 transitions, 1466 flow. Second operand has 60 states, 60 states have (on average 4.666666666666667) internal successors, (280), 60 states have internal predecessors, (280), 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-14 01:23:11,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:23:11,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:23:11,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:23:38,701 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 88 DAG size of output: 73 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:23:57,939 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:24:01,973 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:24:07,816 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:11,969 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:16,829 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:20,467 INFO L116 PetriNetUnfolderBase]: 11774/17117 cut-off events. [2025-04-14 01:24:20,467 INFO L117 PetriNetUnfolderBase]: For 103968/103968 co-relation queries the response was YES. [2025-04-14 01:24:20,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90891 conditions, 17117 events. 11774/17117 cut-off events. For 103968/103968 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 94356 event pairs, 1692 based on Foata normal form. 2/16345 useless extension candidates. Maximal degree in co-relation 90845. Up to 11782 conditions per place. [2025-04-14 01:24:20,562 INFO L140 encePairwiseOnDemand]: 17/37 looper letters, 428 selfloop transitions, 365 changer transitions 4/797 dead transitions. [2025-04-14 01:24:20,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 797 transitions, 7861 flow [2025-04-14 01:24:20,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-04-14 01:24:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2025-04-14 01:24:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 896 transitions. [2025-04-14 01:24:20,565 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26038942167974427 [2025-04-14 01:24:20,565 INFO L175 Difference]: Start difference. First operand has 128 places, 146 transitions, 1466 flow. Second operand 93 states and 896 transitions. [2025-04-14 01:24:20,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 797 transitions, 7861 flow [2025-04-14 01:24:20,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 797 transitions, 7528 flow, removed 113 selfloop flow, removed 5 redundant places. [2025-04-14 01:24:20,829 INFO L231 Difference]: Finished difference. Result has 227 places, 452 transitions, 5779 flow [2025-04-14 01:24:20,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1262, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=93, PETRI_FLOW=5779, PETRI_PLACES=227, PETRI_TRANSITIONS=452} [2025-04-14 01:24:20,830 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 192 predicate places. [2025-04-14 01:24:20,830 INFO L485 AbstractCegarLoop]: Abstraction has has 227 places, 452 transitions, 5779 flow [2025-04-14 01:24:20,830 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 4.666666666666667) internal successors, (280), 60 states have internal predecessors, (280), 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-14 01:24:20,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:24:20,830 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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-14 01:24:20,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-14 01:24:21,031 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-14 01:24:21,031 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:24:21,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:24:21,032 INFO L85 PathProgramCache]: Analyzing trace with hash -550146078, now seen corresponding path program 3 times [2025-04-14 01:24:21,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:24:21,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43897785] [2025-04-14 01:24:21,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:24:21,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:24:21,038 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:24:21,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:24:21,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:24:21,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:24:23,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:24:23,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43897785] [2025-04-14 01:24:23,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43897785] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:24:23,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730282133] [2025-04-14 01:24:23,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:24:23,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:24:23,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:24:23,096 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:24:23,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 01:24:23,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:24:23,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:24:23,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:24:23,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:23,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-04-14 01:24:23,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:24:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:24:24,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:24:25,427 INFO L325 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2025-04-14 01:24:25,428 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 118 treesize of output 246 [2025-04-14 01:24:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:24:26,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730282133] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:24:26,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:24:26,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 18] total 60 [2025-04-14 01:24:26,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126145510] [2025-04-14 01:24:26,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:24:26,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-04-14 01:24:26,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:24:26,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-04-14 01:24:26,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3551, Unknown=0, NotChecked=0, Total=3782 [2025-04-14 01:24:26,618 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:24:26,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 452 transitions, 5779 flow. Second operand has 62 states, 62 states have (on average 4.629032258064516) internal successors, (287), 62 states have internal predecessors, (287), 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-14 01:24:26,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:24:26,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:24:26,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:24:43,108 WARN L286 SmtUtils]: Spent 8.60s on a formula simplification. DAG size of input: 119 DAG size of output: 101 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:24:54,446 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-14 01:24:58,460 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-14 01:25:12,850 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-14 01:25:17,175 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-14 01:25:20,893 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-14 01:25:24,901 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-14 01:25:29,271 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-14 01:25:33,282 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-14 01:25:35,208 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:25:39,850 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:25:44,602 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-14 01:25:52,349 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-14 01:25:53,772 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-14 01:25:59,587 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-14 01:26:03,595 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-14 01:26:13,797 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:21,790 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:27,523 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:35,289 INFO L116 PetriNetUnfolderBase]: 13268/19487 cut-off events. [2025-04-14 01:26:35,290 INFO L117 PetriNetUnfolderBase]: For 154047/154047 co-relation queries the response was YES. [2025-04-14 01:26:35,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125745 conditions, 19487 events. 13268/19487 cut-off events. For 154047/154047 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 112536 event pairs, 1766 based on Foata normal form. 2/18757 useless extension candidates. Maximal degree in co-relation 125688. Up to 12597 conditions per place. [2025-04-14 01:26:35,428 INFO L140 encePairwiseOnDemand]: 17/37 looper letters, 488 selfloop transitions, 599 changer transitions 4/1091 dead transitions. [2025-04-14 01:26:35,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 1091 transitions, 14163 flow [2025-04-14 01:26:35,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-04-14 01:26:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2025-04-14 01:26:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 769 transitions. [2025-04-14 01:26:35,430 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27347083926031296 [2025-04-14 01:26:35,430 INFO L175 Difference]: Start difference. First operand has 227 places, 452 transitions, 5779 flow. Second operand 76 states and 769 transitions. [2025-04-14 01:26:35,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 1091 transitions, 14163 flow [2025-04-14 01:26:36,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 1091 transitions, 12411 flow, removed 840 selfloop flow, removed 18 redundant places. [2025-04-14 01:26:36,055 INFO L231 Difference]: Finished difference. Result has 300 places, 772 transitions, 10983 flow [2025-04-14 01:26:36,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4627, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=335, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=10983, PETRI_PLACES=300, PETRI_TRANSITIONS=772} [2025-04-14 01:26:36,056 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 265 predicate places. [2025-04-14 01:26:36,056 INFO L485 AbstractCegarLoop]: Abstraction has has 300 places, 772 transitions, 10983 flow [2025-04-14 01:26:36,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 4.629032258064516) internal successors, (287), 62 states have internal predecessors, (287), 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-14 01:26:36,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:36,056 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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-14 01:26:36,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 01:26:36,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-14 01:26:36,257 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:26:36,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:36,257 INFO L85 PathProgramCache]: Analyzing trace with hash -727953380, now seen corresponding path program 4 times [2025-04-14 01:26:36,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:36,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980339739] [2025-04-14 01:26:36,258 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:26:36,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:36,264 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:26:36,276 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:26:36,276 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:26:36,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:37,702 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:26:37,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:37,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980339739] [2025-04-14 01:26:37,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980339739] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:26:37,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351876480] [2025-04-14 01:26:37,703 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:26:37,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:26:37,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:26:37,705 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:26:37,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 01:26:37,764 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:26:37,861 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:26:37,862 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:26:37,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:37,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-14 01:26:37,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:26:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:26:38,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:26:40,440 INFO L325 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2025-04-14 01:26:40,440 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 118 treesize of output 246 [2025-04-14 01:26:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:26:41,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351876480] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:26:41,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:26:41,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2025-04-14 01:26:41,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383946075] [2025-04-14 01:26:41,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:26:41,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-04-14 01:26:41,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:41,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-04-14 01:26:41,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2861, Unknown=0, NotChecked=0, Total=3080 [2025-04-14 01:26:41,995 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:26:41,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 772 transitions, 10983 flow. Second operand has 56 states, 56 states have (on average 4.767857142857143) internal successors, (267), 56 states have internal predecessors, (267), 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-14 01:26:41,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:41,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:26:41,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:26,023 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:27:43,973 INFO L116 PetriNetUnfolderBase]: 16957/25398 cut-off events. [2025-04-14 01:27:43,974 INFO L117 PetriNetUnfolderBase]: For 282952/282952 co-relation queries the response was YES. [2025-04-14 01:27:44,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188475 conditions, 25398 events. 16957/25398 cut-off events. For 282952/282952 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 157939 event pairs, 1779 based on Foata normal form. 104/24700 useless extension candidates. Maximal degree in co-relation 188403. Up to 11186 conditions per place. [2025-04-14 01:27:44,201 INFO L140 encePairwiseOnDemand]: 18/37 looper letters, 503 selfloop transitions, 1074 changer transitions 314/1891 dead transitions. [2025-04-14 01:27:44,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 1891 transitions, 28841 flow [2025-04-14 01:27:44,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2025-04-14 01:27:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2025-04-14 01:27:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 1285 transitions. [2025-04-14 01:27:44,204 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26715176715176714 [2025-04-14 01:27:44,204 INFO L175 Difference]: Start difference. First operand has 300 places, 772 transitions, 10983 flow. Second operand 130 states and 1285 transitions. [2025-04-14 01:27:44,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 1891 transitions, 28841 flow [2025-04-14 01:27:46,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 1891 transitions, 27134 flow, removed 788 selfloop flow, removed 29 redundant places. [2025-04-14 01:27:46,221 INFO L231 Difference]: Finished difference. Result has 442 places, 1250 transitions, 20969 flow [2025-04-14 01:27:46,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10047, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=772, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=630, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=130, PETRI_FLOW=20969, PETRI_PLACES=442, PETRI_TRANSITIONS=1250} [2025-04-14 01:27:46,222 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 407 predicate places. [2025-04-14 01:27:46,222 INFO L485 AbstractCegarLoop]: Abstraction has has 442 places, 1250 transitions, 20969 flow [2025-04-14 01:27:46,222 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 4.767857142857143) internal successors, (267), 56 states have internal predecessors, (267), 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-14 01:27:46,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:46,222 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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-14 01:27:46,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 01:27:46,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:27:46,423 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:27:46,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash -514432150, now seen corresponding path program 5 times [2025-04-14 01:27:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:46,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247808658] [2025-04-14 01:27:46,424 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:27:46,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:46,436 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:27:46,458 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:27:46,458 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:27:46,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:27:48,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:48,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247808658] [2025-04-14 01:27:48,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247808658] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:27:48,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107697689] [2025-04-14 01:27:48,210 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:27:48,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:27:48,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:27:48,212 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:27:48,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 01:27:48,268 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:27:48,298 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:27:48,298 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:27:48,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:48,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-04-14 01:27:48,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:27:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:27:49,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:27:51,530 INFO L325 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2025-04-14 01:27:51,531 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 118 treesize of output 246 [2025-04-14 01:27:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:27:53,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107697689] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:27:53,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:27:53,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 21] total 65 [2025-04-14 01:27:53,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334640984] [2025-04-14 01:27:53,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:27:53,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-04-14 01:27:53,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:53,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-04-14 01:27:53,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=4023, Unknown=0, NotChecked=0, Total=4422 [2025-04-14 01:27:53,237 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:27:53,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 1250 transitions, 20969 flow. Second operand has 67 states, 67 states have (on average 4.522388059701493) internal successors, (303), 67 states have internal predecessors, (303), 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-14 01:27:53,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:53,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:27:53,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:28:19,568 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:21,831 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:26,940 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:47,245 WARN L286 SmtUtils]: Spent 11.75s on a formula simplification. DAG size of input: 94 DAG size of output: 88 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:28:49,405 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:16,223 WARN L286 SmtUtils]: Spent 22.60s on a formula simplification. DAG size of input: 96 DAG size of output: 88 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:29:29,806 WARN L286 SmtUtils]: Spent 7.47s on a formula simplification. DAG size of input: 77 DAG size of output: 63 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:29:33,970 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:39,026 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:44,049 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:54,103 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:58,517 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:30:05,776 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:30:09,784 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:30:12,572 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:30:27,516 INFO L116 PetriNetUnfolderBase]: 18038/27134 cut-off events. [2025-04-14 01:30:27,516 INFO L117 PetriNetUnfolderBase]: For 429681/429681 co-relation queries the response was YES. [2025-04-14 01:30:27,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226672 conditions, 27134 events. 18038/27134 cut-off events. For 429681/429681 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 172259 event pairs, 1795 based on Foata normal form. 32/26340 useless extension candidates. Maximal degree in co-relation 226558. Up to 17358 conditions per place. [2025-04-14 01:30:27,901 INFO L140 encePairwiseOnDemand]: 14/37 looper letters, 749 selfloop transitions, 1291 changer transitions 60/2100 dead transitions. [2025-04-14 01:30:27,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 2100 transitions, 36577 flow [2025-04-14 01:30:27,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2025-04-14 01:30:27,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2025-04-14 01:30:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 972 transitions. [2025-04-14 01:30:27,904 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2525987525987526 [2025-04-14 01:30:27,904 INFO L175 Difference]: Start difference. First operand has 442 places, 1250 transitions, 20969 flow. Second operand 104 states and 972 transitions. [2025-04-14 01:30:27,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 2100 transitions, 36577 flow [2025-04-14 01:30:33,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 2100 transitions, 34557 flow, removed 958 selfloop flow, removed 25 redundant places. [2025-04-14 01:30:33,515 INFO L231 Difference]: Finished difference. Result has 525 places, 1725 transitions, 33277 flow [2025-04-14 01:30:33,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=19490, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=879, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=104, PETRI_FLOW=33277, PETRI_PLACES=525, PETRI_TRANSITIONS=1725} [2025-04-14 01:30:33,517 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 490 predicate places. [2025-04-14 01:30:33,517 INFO L485 AbstractCegarLoop]: Abstraction has has 525 places, 1725 transitions, 33277 flow [2025-04-14 01:30:33,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 4.522388059701493) internal successors, (303), 67 states have internal predecessors, (303), 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-14 01:30:33,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:30:33,517 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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-14 01:30:33,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-14 01:30:33,717 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-04-14 01:30:33,718 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:30:33,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:30:33,719 INFO L85 PathProgramCache]: Analyzing trace with hash 440166766, now seen corresponding path program 6 times [2025-04-14 01:30:33,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:30:33,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194344416] [2025-04-14 01:30:33,719 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:30:33,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:30:33,725 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:30:33,740 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:30:33,740 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:30:33,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:30:35,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:30:35,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:30:35,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194344416] [2025-04-14 01:30:35,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194344416] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:30:35,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042949846] [2025-04-14 01:30:35,557 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:30:35,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:30:35,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:30:35,559 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:30:35,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 01:30:35,622 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:30:35,655 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:30:35,655 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:30:35,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:30:35,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-04-14 01:30:35,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:30:35,973 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:30:36,033 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:30:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:30:37,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:30:39,592 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:30:39,592 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 607 treesize of output 593 [2025-04-14 01:30:39,650 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2025-04-14 01:30:39,688 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:30:39,688 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 558 treesize of output 508 [2025-04-14 01:30:40,252 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:30:40,252 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 633 treesize of output 617 [2025-04-14 01:30:40,272 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:30:40,272 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 192 [2025-04-14 01:30:40,442 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:30:40,443 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 764 treesize of output 724 [2025-04-14 01:30:42,634 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:30:42,635 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 607 treesize of output 593 [2025-04-14 01:30:42,709 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 162 [2025-04-14 01:30:42,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:30:42,751 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:30:42,751 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 558 treesize of output 484 [2025-04-14 01:30:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:30:43,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042949846] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:30:43,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:30:43,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 65 [2025-04-14 01:30:43,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912854395] [2025-04-14 01:30:43,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:30:43,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-04-14 01:30:43,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:30:43,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-04-14 01:30:43,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=4080, Unknown=0, NotChecked=0, Total=4422 [2025-04-14 01:30:43,754 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:30:43,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 1725 transitions, 33277 flow. Second operand has 67 states, 67 states have (on average 4.522388059701493) internal successors, (303), 67 states have internal predecessors, (303), 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-14 01:30:43,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:30:43,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:30:43,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:31:04,623 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:31:11,901 WARN L286 SmtUtils]: Spent 5.00s on a formula simplification. DAG size of input: 110 DAG size of output: 106 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:31:37,867 WARN L286 SmtUtils]: Spent 21.98s on a formula simplification. DAG size of input: 119 DAG size of output: 113 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:31:50,037 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:32:01,778 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:32:10,662 WARN L286 SmtUtils]: Spent 8.54s on a formula simplification. DAG size of input: 100 DAG size of output: 97 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:32:17,242 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:32:20,876 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:32:39,403 WARN L286 SmtUtils]: Spent 18.25s on a formula simplification. DAG size of input: 112 DAG size of output: 105 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:32:42,317 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:32:46,335 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:32:47,864 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:33:16,175 WARN L286 SmtUtils]: Spent 17.52s on a formula simplification. DAG size of input: 111 DAG size of output: 112 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:33:58,072 WARN L286 SmtUtils]: Spent 17.38s on a formula simplification. DAG size of input: 81 DAG size of output: 82 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:34:17,041 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:34:18,666 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2025-04-14 01:34:21,363 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:34:21,377 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:34:22,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 01:34:22,577 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-14 01:34:22,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-14 01:34:22,608 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 01:34:22,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-14 01:34:22,609 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-14 01:34:22,610 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 01:34:22,610 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 01:34:22,610 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 01:34:22,610 INFO L422 BasicCegarLoop]: Path program histogram: [26, 6, 3, 2, 1, 1, 1, 1, 1] [2025-04-14 01:34:22,613 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:34:22,613 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:34:22,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:34:22 BasicIcfg [2025-04-14 01:34:22,615 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:34:22,615 INFO L158 Benchmark]: Toolchain (without parser) took 839632.32ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 100.3MB in the beginning and 255.8MB in the end (delta: -155.6MB). Peak memory consumption was 907.0MB. Max. memory is 8.0GB. [2025-04-14 01:34:22,615 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:34:22,615 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.55ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 84.9MB in the end (delta: 15.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 01:34:22,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.20ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 81.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:34:22,616 INFO L158 Benchmark]: Boogie Preprocessor took 48.19ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 79.9MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:34:22,616 INFO L158 Benchmark]: IcfgBuilder took 730.97ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 61.3MB in the end (delta: 18.6MB). Peak memory consumption was 61.3MB. Max. memory is 8.0GB. [2025-04-14 01:34:22,616 INFO L158 Benchmark]: TraceAbstraction took 838569.55ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 60.6MB in the beginning and 255.8MB in the end (delta: -195.3MB). Peak memory consumption was 866.6MB. Max. memory is 8.0GB. [2025-04-14 01:34:22,617 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.55ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 84.9MB in the end (delta: 15.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.20ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 81.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.19ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 79.9MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 730.97ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 61.3MB in the end (delta: 18.6MB). Peak memory consumption was 61.3MB. Max. memory is 8.0GB. * TraceAbstraction took 838569.55ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 60.6MB in the beginning and 255.8MB in the end (delta: -195.3MB). Peak memory consumption was 866.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 135]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 128]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 48 locations, 61 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 838.5s, OverallIterations: 42, TraceHistogramMax: 2, PathProgramHistogramMax: 26, EmptinessCheckTime: 0.0s, AutomataDifference: 774.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 32 mSolverCounterUnknown, 4246 SdHoareTripleChecker+Valid, 272.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4246 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 267.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 674 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2264 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61301 IncrementalHoareTripleChecker+Invalid, 64272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2264 mSolverCounterUnsat, 0 mSDtfsCounter, 61301 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1338 GetRequests, 316 SyntacticMatches, 10 SemanticMatches, 1012 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 29605 ImplicationChecksByTransitivity, 484.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33277occurred in iteration=41, InterpolantAutomatonStates: 723, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 60.5s InterpolantComputationTime, 1415 NumberOfCodeBlocks, 1375 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 1618 ConstructedInterpolants, 162 QuantifiedInterpolants, 37081 SizeOfPredicates, 144 NumberOfNonLiveVariables, 2616 ConjunctsInSsa, 417 ConjunctsInUnsatCore, 59 InterpolantComputations, 34 PerfectInterpolantSequences, 122/288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown