/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:14:41,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:14:41,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:14:41,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:14:41,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:14:41,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:14:41,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:14:41,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:14:41,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:14:41,676 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:14:41,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:14:41,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:14:41,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:14:41,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:14:41,676 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:14:41,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:14:41,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:14:41,676 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:14:41,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:14:41,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:14:41,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:14:41,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:14:41,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:14:41,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:14:41,677 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:14:41,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:14:41,677 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:14:41,677 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:14:41,677 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:14:41,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:14:41,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:14:41,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:14:41,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:14:41,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:14:41,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:14:41,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:14:41,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:14:41,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:14:41,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:14:41,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:14:41,679 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:14:41,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:14:41,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:14:41,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:14:41,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:14:41,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:14:41,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:14:41,679 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:14:41,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:14:41,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:14:41,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:14:41,896 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:14:41,897 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:14:41,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2025-04-13 20:14:43,150 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcb443e1d/f17021a0a0474412b60688295850e97b/FLAGdd13086a2 [2025-04-13 20:14:43,350 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:14:43,351 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2025-04-13 20:14:43,361 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcb443e1d/f17021a0a0474412b60688295850e97b/FLAGdd13086a2 [2025-04-13 20:14:44,200 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcb443e1d/f17021a0a0474412b60688295850e97b [2025-04-13 20:14:44,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:14:44,203 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:14:44,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:14:44,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:14:44,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:14:44,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:14:44" (1/1) ... [2025-04-13 20:14:44,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6b7f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:44, skipping insertion in model container [2025-04-13 20:14:44,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:14:44" (1/1) ... [2025-04-13 20:14:44,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:14:44,389 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/parallel-min-max-1.wvr.c[2642,2655] [2025-04-13 20:14:44,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:14:44,409 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:14:44,439 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/parallel-min-max-1.wvr.c[2642,2655] [2025-04-13 20:14:44,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:14:44,451 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:14:44,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:44 WrapperNode [2025-04-13 20:14:44,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:14:44,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:14:44,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:14:44,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:14:44,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:44" (1/1) ... [2025-04-13 20:14:44,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:44" (1/1) ... [2025-04-13 20:14:44,481 INFO L138 Inliner]: procedures = 22, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-04-13 20:14:44,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:14:44,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:14:44,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:14:44,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:14:44,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:44" (1/1) ... [2025-04-13 20:14:44,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:44" (1/1) ... [2025-04-13 20:14:44,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:44" (1/1) ... [2025-04-13 20:14:44,508 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 20:14:44,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:44" (1/1) ... [2025-04-13 20:14:44,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:44" (1/1) ... [2025-04-13 20:14:44,512 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:44" (1/1) ... [2025-04-13 20:14:44,513 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:44" (1/1) ... [2025-04-13 20:14:44,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:44" (1/1) ... [2025-04-13 20:14:44,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:44" (1/1) ... [2025-04-13 20:14:44,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:44" (1/1) ... [2025-04-13 20:14:44,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:14:44,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:14:44,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:14:44,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:14:44,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:44" (1/1) ... [2025-04-13 20:14:44,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:14:44,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:14:44,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:14:44,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:14:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:14:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:14:44,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:14:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:14:44,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:14:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:14:44,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:14:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:14:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:14:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:14:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:14:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:14:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:14:44,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:14:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:14:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:14:44,563 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:14:44,634 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:14:44,635 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:14:44,808 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:14:44,808 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:14:44,809 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:14:44,980 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:14:44,983 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:14:44,990 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:14:44,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:14:44 BoogieIcfgContainer [2025-04-13 20:14:44,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:14:44,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:14:44,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:14:44,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:14:44,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:14:44" (1/3) ... [2025-04-13 20:14:44,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dad98c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:14:44, skipping insertion in model container [2025-04-13 20:14:44,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:44" (2/3) ... [2025-04-13 20:14:44,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dad98c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:14:44, skipping insertion in model container [2025-04-13 20:14:44,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:14:44" (3/3) ... [2025-04-13 20:14:44,997 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2025-04-13 20:14:45,007 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:14:45,008 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-min-max-1.wvr.c that has 4 procedures, 46 locations, 51 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 20:14:45,008 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:14:45,063 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:14:45,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 129 flow [2025-04-13 20:14:45,122 INFO L116 PetriNetUnfolderBase]: 9/51 cut-off events. [2025-04-13 20:14:45,125 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:14:45,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 9/51 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 64 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 45. Up to 3 conditions per place. [2025-04-13 20:14:45,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 54 transitions, 129 flow [2025-04-13 20:14:45,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 50 transitions, 118 flow [2025-04-13 20:14:45,139 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:14:45,151 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;@2164e82e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:14:45,151 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:14:45,167 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:14:45,167 INFO L116 PetriNetUnfolderBase]: 9/49 cut-off events. [2025-04-13 20:14:45,167 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:14:45,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:45,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:45,170 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:45,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:45,175 INFO L85 PathProgramCache]: Analyzing trace with hash 741203440, now seen corresponding path program 1 times [2025-04-13 20:14:45,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:45,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463980908] [2025-04-13 20:14:45,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:14:45,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:45,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 20:14:45,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 20:14:45,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:45,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:45,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:45,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:45,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463980908] [2025-04-13 20:14:45,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463980908] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:45,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:45,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:14:45,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261207890] [2025-04-13 20:14:45,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:45,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:14:45,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:45,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:14:45,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:14:45,473 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2025-04-13 20:14:45,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:45,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:45,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2025-04-13 20:14:45,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:45,643 INFO L116 PetriNetUnfolderBase]: 402/652 cut-off events. [2025-04-13 20:14:45,643 INFO L117 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-04-13 20:14:45,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1307 conditions, 652 events. 402/652 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2880 event pairs, 263 based on Foata normal form. 0/418 useless extension candidates. Maximal degree in co-relation 1196. Up to 571 conditions per place. [2025-04-13 20:14:45,651 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 32 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2025-04-13 20:14:45,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 180 flow [2025-04-13 20:14:45,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:14:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:14:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-04-13 20:14:45,664 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5493827160493827 [2025-04-13 20:14:45,665 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 118 flow. Second operand 3 states and 89 transitions. [2025-04-13 20:14:45,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 180 flow [2025-04-13 20:14:45,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 48 transitions, 168 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:14:45,673 INFO L231 Difference]: Finished difference. Result has 47 places, 48 transitions, 104 flow [2025-04-13 20:14:45,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=47, PETRI_TRANSITIONS=48} [2025-04-13 20:14:45,680 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2025-04-13 20:14:45,680 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 48 transitions, 104 flow [2025-04-13 20:14:45,680 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:45,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:45,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:45,680 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:14:45,681 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:45,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:45,681 INFO L85 PathProgramCache]: Analyzing trace with hash 419533633, now seen corresponding path program 1 times [2025-04-13 20:14:45,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:45,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651384885] [2025-04-13 20:14:45,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:14:45,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:45,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 20:14:45,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 20:14:45,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:45,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:45,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:45,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651384885] [2025-04-13 20:14:45,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651384885] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:45,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:45,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:14:45,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296793465] [2025-04-13 20:14:45,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:45,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:14:45,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:45,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:14:45,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:14:45,867 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2025-04-13 20:14:45,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 48 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:45,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:45,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2025-04-13 20:14:45,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:46,007 INFO L116 PetriNetUnfolderBase]: 402/653 cut-off events. [2025-04-13 20:14:46,007 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:14:46,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 653 events. 402/653 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2855 event pairs, 263 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 1248. Up to 571 conditions per place. [2025-04-13 20:14:46,015 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 31 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2025-04-13 20:14:46,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 174 flow [2025-04-13 20:14:46,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:14:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:14:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-04-13 20:14:46,017 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49537037037037035 [2025-04-13 20:14:46,017 INFO L175 Difference]: Start difference. First operand has 47 places, 48 transitions, 104 flow. Second operand 4 states and 107 transitions. [2025-04-13 20:14:46,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 174 flow [2025-04-13 20:14:46,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 173 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:14:46,018 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 117 flow [2025-04-13 20:14:46,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2025-04-13 20:14:46,019 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2025-04-13 20:14:46,019 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 117 flow [2025-04-13 20:14:46,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:46,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:46,019 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:46,021 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:14:46,022 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:46,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:46,024 INFO L85 PathProgramCache]: Analyzing trace with hash 155147576, now seen corresponding path program 1 times [2025-04-13 20:14:46,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:46,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442561036] [2025-04-13 20:14:46,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:14:46,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:46,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 20:14:46,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 20:14:46,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:46,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:14:46,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:46,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442561036] [2025-04-13 20:14:46,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442561036] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:46,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:46,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:14:46,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609883831] [2025-04-13 20:14:46,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:46,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:14:46,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:46,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:14:46,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:14:46,371 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 54 [2025-04-13 20:14:46,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 117 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:46,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:46,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 54 [2025-04-13 20:14:46,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:46,899 INFO L116 PetriNetUnfolderBase]: 2001/2878 cut-off events. [2025-04-13 20:14:46,899 INFO L117 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-04-13 20:14:46,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5850 conditions, 2878 events. 2001/2878 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11852 event pairs, 283 based on Foata normal form. 1/2413 useless extension candidates. Maximal degree in co-relation 5831. Up to 867 conditions per place. [2025-04-13 20:14:46,907 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 87 selfloop transitions, 18 changer transitions 73/180 dead transitions. [2025-04-13 20:14:46,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 180 transitions, 746 flow [2025-04-13 20:14:46,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:14:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:14:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 268 transitions. [2025-04-13 20:14:46,909 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3101851851851852 [2025-04-13 20:14:46,909 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 117 flow. Second operand 16 states and 268 transitions. [2025-04-13 20:14:46,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 180 transitions, 746 flow [2025-04-13 20:14:46,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 180 transitions, 740 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 20:14:46,911 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 224 flow [2025-04-13 20:14:46,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=224, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2025-04-13 20:14:46,912 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2025-04-13 20:14:46,912 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 224 flow [2025-04-13 20:14:46,912 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:46,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:46,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:46,912 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:14:46,912 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:46,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:46,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1463665361, now seen corresponding path program 1 times [2025-04-13 20:14:46,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:46,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437162506] [2025-04-13 20:14:46,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:14:46,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:46,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 20:14:46,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 20:14:46,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:46,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:47,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:14:47,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:47,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437162506] [2025-04-13 20:14:47,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437162506] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:47,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:47,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:14:47,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261884418] [2025-04-13 20:14:47,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:47,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:14:47,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:47,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:14:47,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:14:47,172 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-04-13 20:14:47,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 224 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:47,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:47,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-04-13 20:14:47,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:48,132 INFO L116 PetriNetUnfolderBase]: 2635/3709 cut-off events. [2025-04-13 20:14:48,132 INFO L117 PetriNetUnfolderBase]: For 4732/4747 co-relation queries the response was YES. [2025-04-13 20:14:48,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10077 conditions, 3709 events. 2635/3709 cut-off events. For 4732/4747 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 15507 event pairs, 140 based on Foata normal form. 49/2848 useless extension candidates. Maximal degree in co-relation 10060. Up to 610 conditions per place. [2025-04-13 20:14:48,147 INFO L140 encePairwiseOnDemand]: 37/54 looper letters, 144 selfloop transitions, 52 changer transitions 128/330 dead transitions. [2025-04-13 20:14:48,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 330 transitions, 1798 flow [2025-04-13 20:14:48,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 20:14:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-13 20:14:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 568 transitions. [2025-04-13 20:14:48,150 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3895747599451303 [2025-04-13 20:14:48,150 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 224 flow. Second operand 27 states and 568 transitions. [2025-04-13 20:14:48,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 330 transitions, 1798 flow [2025-04-13 20:14:48,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 330 transitions, 1692 flow, removed 52 selfloop flow, removed 4 redundant places. [2025-04-13 20:14:48,168 INFO L231 Difference]: Finished difference. Result has 105 places, 100 transitions, 637 flow [2025-04-13 20:14:48,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=637, PETRI_PLACES=105, PETRI_TRANSITIONS=100} [2025-04-13 20:14:48,168 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 54 predicate places. [2025-04-13 20:14:48,168 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 100 transitions, 637 flow [2025-04-13 20:14:48,168 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:48,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:48,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:48,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:14:48,169 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:48,169 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:48,169 INFO L85 PathProgramCache]: Analyzing trace with hash 263262879, now seen corresponding path program 1 times [2025-04-13 20:14:48,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:48,169 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432215637] [2025-04-13 20:14:48,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:14:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:48,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 20:14:48,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 20:14:48,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:48,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:48,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:14:48,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:48,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432215637] [2025-04-13 20:14:48,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432215637] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:48,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:48,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 20:14:48,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060974009] [2025-04-13 20:14:48,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:48,471 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:14:48,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:48,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:14:48,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:14:48,502 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 54 [2025-04-13 20:14:48,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 637 flow. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:48,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:48,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 54 [2025-04-13 20:14:48,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:49,659 INFO L116 PetriNetUnfolderBase]: 4249/5913 cut-off events. [2025-04-13 20:14:49,659 INFO L117 PetriNetUnfolderBase]: For 32231/32245 co-relation queries the response was YES. [2025-04-13 20:14:49,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22966 conditions, 5913 events. 4249/5913 cut-off events. For 32231/32245 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 25696 event pairs, 263 based on Foata normal form. 58/4639 useless extension candidates. Maximal degree in co-relation 22922. Up to 1367 conditions per place. [2025-04-13 20:14:49,694 INFO L140 encePairwiseOnDemand]: 35/54 looper letters, 221 selfloop transitions, 87 changer transitions 133/443 dead transitions. [2025-04-13 20:14:49,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 443 transitions, 3341 flow [2025-04-13 20:14:49,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 20:14:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-04-13 20:14:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 517 transitions. [2025-04-13 20:14:49,697 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2991898148148148 [2025-04-13 20:14:49,697 INFO L175 Difference]: Start difference. First operand has 105 places, 100 transitions, 637 flow. Second operand 32 states and 517 transitions. [2025-04-13 20:14:49,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 443 transitions, 3341 flow [2025-04-13 20:14:49,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 443 transitions, 3033 flow, removed 139 selfloop flow, removed 15 redundant places. [2025-04-13 20:14:49,770 INFO L231 Difference]: Finished difference. Result has 127 places, 157 transitions, 1146 flow [2025-04-13 20:14:49,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1146, PETRI_PLACES=127, PETRI_TRANSITIONS=157} [2025-04-13 20:14:49,770 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 76 predicate places. [2025-04-13 20:14:49,770 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 157 transitions, 1146 flow [2025-04-13 20:14:49,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:49,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:49,771 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:49,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:14:49,771 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:49,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:49,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1557096015, now seen corresponding path program 2 times [2025-04-13 20:14:49,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:49,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446347121] [2025-04-13 20:14:49,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:14:49,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:49,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 20:14:49,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 41 of 42 statements. [2025-04-13 20:14:49,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:14:49,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:14:50,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:50,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446347121] [2025-04-13 20:14:50,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446347121] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:50,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:50,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 20:14:50,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372141469] [2025-04-13 20:14:50,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:50,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:14:50,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:50,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:14:50,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:14:50,049 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 54 [2025-04-13 20:14:50,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 157 transitions, 1146 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:50,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:50,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 54 [2025-04-13 20:14:50,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:51,407 INFO L116 PetriNetUnfolderBase]: 5492/7519 cut-off events. [2025-04-13 20:14:51,408 INFO L117 PetriNetUnfolderBase]: For 75793/75807 co-relation queries the response was YES. [2025-04-13 20:14:51,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41011 conditions, 7519 events. 5492/7519 cut-off events. For 75793/75807 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 32217 event pairs, 212 based on Foata normal form. 17/6228 useless extension candidates. Maximal degree in co-relation 40965. Up to 1642 conditions per place. [2025-04-13 20:14:51,445 INFO L140 encePairwiseOnDemand]: 36/54 looper letters, 255 selfloop transitions, 128 changer transitions 202/587 dead transitions. [2025-04-13 20:14:51,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 587 transitions, 5579 flow [2025-04-13 20:14:51,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 20:14:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-13 20:14:51,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 576 transitions. [2025-04-13 20:14:51,449 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2962962962962963 [2025-04-13 20:14:51,449 INFO L175 Difference]: Start difference. First operand has 127 places, 157 transitions, 1146 flow. Second operand 36 states and 576 transitions. [2025-04-13 20:14:51,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 587 transitions, 5579 flow [2025-04-13 20:14:51,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 587 transitions, 4944 flow, removed 300 selfloop flow, removed 14 redundant places. [2025-04-13 20:14:51,715 INFO L231 Difference]: Finished difference. Result has 158 places, 214 transitions, 1974 flow [2025-04-13 20:14:51,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=1974, PETRI_PLACES=158, PETRI_TRANSITIONS=214} [2025-04-13 20:14:51,716 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 107 predicate places. [2025-04-13 20:14:51,716 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 214 transitions, 1974 flow [2025-04-13 20:14:51,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:51,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:51,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:51,717 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:14:51,717 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:51,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:51,717 INFO L85 PathProgramCache]: Analyzing trace with hash -345570042, now seen corresponding path program 1 times [2025-04-13 20:14:51,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:51,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464843468] [2025-04-13 20:14:51,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:14:51,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:51,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 20:14:51,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 20:14:51,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:51,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:51,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:51,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464843468] [2025-04-13 20:14:51,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464843468] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:14:51,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723138115] [2025-04-13 20:14:51,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:14:51,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:14:51,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:14:51,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:14:51,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:14:51,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 20:14:51,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 20:14:51,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:51,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:51,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:14:51,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:14:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:51,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:14:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:52,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723138115] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:14:52,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:14:52,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 20:14:52,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278474127] [2025-04-13 20:14:52,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:14:52,052 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:14:52,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:52,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:14:52,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:14:52,055 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2025-04-13 20:14:52,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 214 transitions, 1974 flow. Second operand has 11 states, 11 states have (on average 21.272727272727273) internal successors, (234), 11 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:52,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:52,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2025-04-13 20:14:52,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:52,557 INFO L116 PetriNetUnfolderBase]: 3529/5288 cut-off events. [2025-04-13 20:14:52,558 INFO L117 PetriNetUnfolderBase]: For 50700/51159 co-relation queries the response was YES. [2025-04-13 20:14:52,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29862 conditions, 5288 events. 3529/5288 cut-off events. For 50700/51159 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 26717 event pairs, 1090 based on Foata normal form. 230/4700 useless extension candidates. Maximal degree in co-relation 29802. Up to 3500 conditions per place. [2025-04-13 20:14:52,591 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 105 selfloop transitions, 5 changer transitions 56/271 dead transitions. [2025-04-13 20:14:52,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 271 transitions, 2730 flow [2025-04-13 20:14:52,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:14:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:14:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2025-04-13 20:14:52,592 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2025-04-13 20:14:52,592 INFO L175 Difference]: Start difference. First operand has 158 places, 214 transitions, 1974 flow. Second operand 6 states and 167 transitions. [2025-04-13 20:14:52,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 271 transitions, 2730 flow [2025-04-13 20:14:52,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 271 transitions, 2455 flow, removed 79 selfloop flow, removed 22 redundant places. [2025-04-13 20:14:52,780 INFO L231 Difference]: Finished difference. Result has 133 places, 215 transitions, 1811 flow [2025-04-13 20:14:52,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1753, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1811, PETRI_PLACES=133, PETRI_TRANSITIONS=215} [2025-04-13 20:14:52,780 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 82 predicate places. [2025-04-13 20:14:52,780 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 215 transitions, 1811 flow [2025-04-13 20:14:52,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.272727272727273) internal successors, (234), 11 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:52,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:52,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:52,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 20:14:52,985 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:14:52,985 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:52,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:52,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1511465805, now seen corresponding path program 2 times [2025-04-13 20:14:52,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:52,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065194087] [2025-04-13 20:14:52,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:14:52,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:52,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 20:14:53,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 20:14:53,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:14:53,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:14:53,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:53,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065194087] [2025-04-13 20:14:53,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065194087] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:14:53,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967383913] [2025-04-13 20:14:53,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:14:53,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:14:53,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:14:53,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:14:53,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:14:53,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 20:14:53,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 20:14:53,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:14:53,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:53,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 20:14:53,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:14:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:14:53,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:14:53,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:14:53,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967383913] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:14:53,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:14:53,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-04-13 20:14:53,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271782367] [2025-04-13 20:14:53,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:14:53,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:14:53,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:53,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:14:53,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:14:53,189 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2025-04-13 20:14:53,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 215 transitions, 1811 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:53,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:53,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2025-04-13 20:14:53,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:53,644 INFO L116 PetriNetUnfolderBase]: 3239/4724 cut-off events. [2025-04-13 20:14:53,644 INFO L117 PetriNetUnfolderBase]: For 32192/32350 co-relation queries the response was YES. [2025-04-13 20:14:53,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24730 conditions, 4724 events. 3239/4724 cut-off events. For 32192/32350 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 22247 event pairs, 207 based on Foata normal form. 25/4115 useless extension candidates. Maximal degree in co-relation 24669. Up to 1916 conditions per place. [2025-04-13 20:14:53,669 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 151 selfloop transitions, 38 changer transitions 9/303 dead transitions. [2025-04-13 20:14:53,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 303 transitions, 2787 flow [2025-04-13 20:14:53,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:14:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:14:53,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 208 transitions. [2025-04-13 20:14:53,671 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5502645502645502 [2025-04-13 20:14:53,671 INFO L175 Difference]: Start difference. First operand has 133 places, 215 transitions, 1811 flow. Second operand 7 states and 208 transitions. [2025-04-13 20:14:53,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 303 transitions, 2787 flow [2025-04-13 20:14:53,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 303 transitions, 2737 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-04-13 20:14:53,756 INFO L231 Difference]: Finished difference. Result has 135 places, 226 transitions, 1976 flow [2025-04-13 20:14:53,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1761, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1976, PETRI_PLACES=135, PETRI_TRANSITIONS=226} [2025-04-13 20:14:53,760 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 84 predicate places. [2025-04-13 20:14:53,760 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 226 transitions, 1976 flow [2025-04-13 20:14:53,760 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:53,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:53,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:53,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 20:14:53,961 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,SelfDestructingSolverStorable7 [2025-04-13 20:14:53,961 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:53,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:53,962 INFO L85 PathProgramCache]: Analyzing trace with hash -431000408, now seen corresponding path program 1 times [2025-04-13 20:14:53,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:53,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913283112] [2025-04-13 20:14:53,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:14:53,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:53,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-13 20:14:53,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 20:14:53,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:53,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:14:54,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:54,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913283112] [2025-04-13 20:14:54,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913283112] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:14:54,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803056740] [2025-04-13 20:14:54,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:14:54,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:14:54,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:14:54,227 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:14:54,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:14:54,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-13 20:14:54,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 20:14:54,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:54,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:54,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 20:14:54,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:14:54,355 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 20:14:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:54,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:14:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:14:54,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803056740] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:14:54,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:14:54,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 7] total 27 [2025-04-13 20:14:54,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405779874] [2025-04-13 20:14:54,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:14:54,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 20:14:54,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:54,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 20:14:54,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2025-04-13 20:14:54,792 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-04-13 20:14:54,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 226 transitions, 1976 flow. Second operand has 28 states, 28 states have (on average 12.392857142857142) internal successors, (347), 28 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:54,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:54,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-04-13 20:14:54,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:57,778 INFO L116 PetriNetUnfolderBase]: 5916/8313 cut-off events. [2025-04-13 20:14:57,779 INFO L117 PetriNetUnfolderBase]: For 82749/82770 co-relation queries the response was YES. [2025-04-13 20:14:57,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49071 conditions, 8313 events. 5916/8313 cut-off events. For 82749/82770 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 38957 event pairs, 340 based on Foata normal form. 12/7917 useless extension candidates. Maximal degree in co-relation 49012. Up to 3667 conditions per place. [2025-04-13 20:14:57,817 INFO L140 encePairwiseOnDemand]: 33/54 looper letters, 443 selfloop transitions, 207 changer transitions 155/814 dead transitions. [2025-04-13 20:14:57,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 814 transitions, 8922 flow [2025-04-13 20:14:57,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 20:14:57,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-04-13 20:14:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 1015 transitions. [2025-04-13 20:14:57,822 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32975958414554907 [2025-04-13 20:14:57,822 INFO L175 Difference]: Start difference. First operand has 135 places, 226 transitions, 1976 flow. Second operand 57 states and 1015 transitions. [2025-04-13 20:14:57,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 814 transitions, 8922 flow [2025-04-13 20:14:58,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 814 transitions, 8797 flow, removed 40 selfloop flow, removed 2 redundant places. [2025-04-13 20:14:58,114 INFO L231 Difference]: Finished difference. Result has 230 places, 384 transitions, 4447 flow [2025-04-13 20:14:58,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1941, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=4447, PETRI_PLACES=230, PETRI_TRANSITIONS=384} [2025-04-13 20:14:58,114 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 179 predicate places. [2025-04-13 20:14:58,114 INFO L485 AbstractCegarLoop]: Abstraction has has 230 places, 384 transitions, 4447 flow [2025-04-13 20:14:58,115 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 12.392857142857142) internal successors, (347), 28 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:58,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:58,115 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:14:58,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 20:14:58,316 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:14:58,316 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:14:58,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:58,317 INFO L85 PathProgramCache]: Analyzing trace with hash -656858030, now seen corresponding path program 2 times [2025-04-13 20:14:58,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:58,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982640161] [2025-04-13 20:14:58,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:14:58,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:58,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-13 20:14:58,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 20:14:58,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:14:58,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:14:58,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:58,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982640161] [2025-04-13 20:14:58,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982640161] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:14:58,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303039183] [2025-04-13 20:14:58,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:14:58,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:14:58,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:14:58,622 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:14:58,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:14:58,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-13 20:14:58,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 20:14:58,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:14:58,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:58,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 20:14:58,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:14:58,881 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:14:58,881 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 34 treesize of output 18 [2025-04-13 20:14:58,920 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-13 20:14:58,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:14:58,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303039183] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:58,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:14:58,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2025-04-13 20:14:58,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907253965] [2025-04-13 20:14:58,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:58,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:14:58,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:58,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:14:58,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-04-13 20:14:58,941 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-04-13 20:14:58,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 384 transitions, 4447 flow. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:14:58,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:58,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-04-13 20:14:58,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:00,405 INFO L116 PetriNetUnfolderBase]: 6623/9360 cut-off events. [2025-04-13 20:15:00,405 INFO L117 PetriNetUnfolderBase]: For 250716/250737 co-relation queries the response was YES. [2025-04-13 20:15:00,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73852 conditions, 9360 events. 6623/9360 cut-off events. For 250716/250737 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 45263 event pairs, 459 based on Foata normal form. 13/8920 useless extension candidates. Maximal degree in co-relation 73764. Up to 5261 conditions per place. [2025-04-13 20:15:00,467 INFO L140 encePairwiseOnDemand]: 40/54 looper letters, 406 selfloop transitions, 126 changer transitions 119/660 dead transitions. [2025-04-13 20:15:00,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 660 transitions, 9267 flow [2025-04-13 20:15:00,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 20:15:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 20:15:00,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 375 transitions. [2025-04-13 20:15:00,469 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3654970760233918 [2025-04-13 20:15:00,469 INFO L175 Difference]: Start difference. First operand has 230 places, 384 transitions, 4447 flow. Second operand 19 states and 375 transitions. [2025-04-13 20:15:00,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 660 transitions, 9267 flow [2025-04-13 20:15:01,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 660 transitions, 8374 flow, removed 436 selfloop flow, removed 18 redundant places. [2025-04-13 20:15:01,489 INFO L231 Difference]: Finished difference. Result has 229 places, 423 transitions, 4923 flow [2025-04-13 20:15:01,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3954, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4923, PETRI_PLACES=229, PETRI_TRANSITIONS=423} [2025-04-13 20:15:01,489 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 178 predicate places. [2025-04-13 20:15:01,489 INFO L485 AbstractCegarLoop]: Abstraction has has 229 places, 423 transitions, 4923 flow [2025-04-13 20:15:01,490 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:01,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:01,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:01,495 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-13 20:15:01,690 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:01,691 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-13 20:15:01,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:01,691 INFO L85 PathProgramCache]: Analyzing trace with hash 638568950, now seen corresponding path program 3 times [2025-04-13 20:15:01,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:01,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361713086] [2025-04-13 20:15:01,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:15:01,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:01,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 2 equivalence classes. [2025-04-13 20:15:01,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 20:15:01,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:15:01,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:15:02,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:02,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361713086] [2025-04-13 20:15:02,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361713086] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:02,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407585206] [2025-04-13 20:15:02,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:15:02,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:02,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:02,013 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:15:02,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:15:02,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 2 equivalence classes. [2025-04-13 20:15:02,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 20:15:02,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:15:02,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:02,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 20:15:02,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:02,244 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:15:02,245 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 34 treesize of output 18 [2025-04-13 20:15:02,284 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-13 20:15:02,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:15:02,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407585206] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:15:02,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:15:02,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 17 [2025-04-13 20:15:02,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265250743] [2025-04-13 20:15:02,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:15:02,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:15:02,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:02,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:15:02,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:15:02,303 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-04-13 20:15:02,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 423 transitions, 4923 flow. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:02,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:02,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-04-13 20:15:02,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:04,178 INFO L116 PetriNetUnfolderBase]: 7804/11006 cut-off events. [2025-04-13 20:15:04,178 INFO L117 PetriNetUnfolderBase]: For 194997/195019 co-relation queries the response was YES. [2025-04-13 20:15:04,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79959 conditions, 11006 events. 7804/11006 cut-off events. For 194997/195019 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 54515 event pairs, 255 based on Foata normal form. 13/10428 useless extension candidates. Maximal degree in co-relation 79870. Up to 4047 conditions per place. [2025-04-13 20:15:04,267 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 402 selfloop transitions, 208 changer transitions 104/723 dead transitions. [2025-04-13 20:15:04,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 723 transitions, 9872 flow [2025-04-13 20:15:04,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 20:15:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-13 20:15:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 426 transitions. [2025-04-13 20:15:04,269 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34299516908212563 [2025-04-13 20:15:04,269 INFO L175 Difference]: Start difference. First operand has 229 places, 423 transitions, 4923 flow. Second operand 23 states and 426 transitions. [2025-04-13 20:15:04,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 723 transitions, 9872 flow [2025-04-13 20:15:05,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 723 transitions, 9755 flow, removed 51 selfloop flow, removed 8 redundant places. [2025-04-13 20:15:05,255 INFO L231 Difference]: Finished difference. Result has 245 places, 467 transitions, 6186 flow [2025-04-13 20:15:05,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4828, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=6186, PETRI_PLACES=245, PETRI_TRANSITIONS=467} [2025-04-13 20:15:05,256 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 194 predicate places. [2025-04-13 20:15:05,256 INFO L485 AbstractCegarLoop]: Abstraction has has 245 places, 467 transitions, 6186 flow [2025-04-13 20:15:05,256 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:05,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:05,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:05,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:15:05,456 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,SelfDestructingSolverStorable10 [2025-04-13 20:15:05,457 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-13 20:15:05,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:05,457 INFO L85 PathProgramCache]: Analyzing trace with hash -132935454, now seen corresponding path program 1 times [2025-04-13 20:15:05,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:05,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387583370] [2025-04-13 20:15:05,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:15:05,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:05,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 20:15:05,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 20:15:05,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:15:05,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:15:05,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:05,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387583370] [2025-04-13 20:15:05,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387583370] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:05,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668346299] [2025-04-13 20:15:05,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:15:05,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:05,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:05,720 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:15:05,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:15:05,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-13 20:15:05,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 20:15:05,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:15:05,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:05,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 20:15:05,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:05,837 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-13 20:15:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:15:05,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:05,972 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 20:15:05,972 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 20 treesize of output 9 [2025-04-13 20:15:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:15:05,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668346299] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:05,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:05,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2025-04-13 20:15:05,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682405110] [2025-04-13 20:15:05,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:05,975 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 20:15:05,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:05,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 20:15:05,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2025-04-13 20:15:06,019 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 54 [2025-04-13 20:15:06,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 467 transitions, 6186 flow. Second operand has 21 states, 21 states have (on average 8.714285714285714) internal successors, (183), 21 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:06,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:06,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 54 [2025-04-13 20:15:06,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:11,772 INFO L116 PetriNetUnfolderBase]: 17595/24287 cut-off events. [2025-04-13 20:15:11,772 INFO L117 PetriNetUnfolderBase]: For 571679/571694 co-relation queries the response was YES. [2025-04-13 20:15:11,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195881 conditions, 24287 events. 17595/24287 cut-off events. For 571679/571694 co-relation queries the response was YES. Maximal size of possible extension queue 909. Compared 127619 event pairs, 368 based on Foata normal form. 15/22803 useless extension candidates. Maximal degree in co-relation 195776. Up to 6819 conditions per place. [2025-04-13 20:15:11,938 INFO L140 encePairwiseOnDemand]: 34/54 looper letters, 346 selfloop transitions, 118 changer transitions 1448/1914 dead transitions. [2025-04-13 20:15:11,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 1914 transitions, 29129 flow [2025-04-13 20:15:11,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-04-13 20:15:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2025-04-13 20:15:11,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 1451 transitions. [2025-04-13 20:15:11,941 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26604327099376607 [2025-04-13 20:15:11,941 INFO L175 Difference]: Start difference. First operand has 245 places, 467 transitions, 6186 flow. Second operand 101 states and 1451 transitions. [2025-04-13 20:15:11,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 1914 transitions, 29129 flow [2025-04-13 20:15:14,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 1914 transitions, 28669 flow, removed 173 selfloop flow, removed 13 redundant places. [2025-04-13 20:15:14,859 INFO L231 Difference]: Finished difference. Result has 385 places, 216 transitions, 3432 flow [2025-04-13 20:15:14,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=6034, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=101, PETRI_FLOW=3432, PETRI_PLACES=385, PETRI_TRANSITIONS=216} [2025-04-13 20:15:14,860 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 334 predicate places. [2025-04-13 20:15:14,860 INFO L485 AbstractCegarLoop]: Abstraction has has 385 places, 216 transitions, 3432 flow [2025-04-13 20:15:14,861 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.714285714285714) internal successors, (183), 21 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:14,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:14,861 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:14,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 20:15:15,064 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:15,064 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-13 20:15:15,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:15,065 INFO L85 PathProgramCache]: Analyzing trace with hash -199444037, now seen corresponding path program 4 times [2025-04-13 20:15:15,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:15,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259189050] [2025-04-13 20:15:15,065 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:15:15,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:15,071 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 48 statements into 2 equivalence classes. [2025-04-13 20:15:15,074 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 39 of 48 statements. [2025-04-13 20:15:15,074 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:15:15,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:15,108 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-13 20:15:15,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:15,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259189050] [2025-04-13 20:15:15,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259189050] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:15,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185945972] [2025-04-13 20:15:15,108 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:15:15,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:15,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:15,110 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:15:15,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:15:15,156 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 48 statements into 2 equivalence classes. [2025-04-13 20:15:15,168 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 39 of 48 statements. [2025-04-13 20:15:15,168 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:15:15,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:15,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:15:15,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:15,201 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-13 20:15:15,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:15,234 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-13 20:15:15,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185945972] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:15,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:15,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-04-13 20:15:15,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527866747] [2025-04-13 20:15:15,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:15,234 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:15:15,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:15,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:15:15,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:15:15,237 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2025-04-13 20:15:15,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 216 transitions, 3432 flow. Second operand has 9 states, 9 states have (on average 21.88888888888889) internal successors, (197), 9 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:15,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:15,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2025-04-13 20:15:15,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:16,619 INFO L116 PetriNetUnfolderBase]: 4847/6998 cut-off events. [2025-04-13 20:15:16,619 INFO L117 PetriNetUnfolderBase]: For 658414/659126 co-relation queries the response was YES. [2025-04-13 20:15:16,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99607 conditions, 6998 events. 4847/6998 cut-off events. For 658414/659126 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 33377 event pairs, 275 based on Foata normal form. 93/6574 useless extension candidates. Maximal degree in co-relation 99468. Up to 2750 conditions per place. [2025-04-13 20:15:16,695 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 212 selfloop transitions, 86 changer transitions 12/376 dead transitions. [2025-04-13 20:15:16,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 376 transitions, 6578 flow [2025-04-13 20:15:16,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:15:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:15:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 287 transitions. [2025-04-13 20:15:16,696 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5314814814814814 [2025-04-13 20:15:16,696 INFO L175 Difference]: Start difference. First operand has 385 places, 216 transitions, 3432 flow. Second operand 10 states and 287 transitions. [2025-04-13 20:15:16,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 376 transitions, 6578 flow [2025-04-13 20:15:18,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 376 transitions, 4557 flow, removed 833 selfloop flow, removed 90 redundant places. [2025-04-13 20:15:18,032 INFO L231 Difference]: Finished difference. Result has 198 places, 279 transitions, 3488 flow [2025-04-13 20:15:18,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2213, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3488, PETRI_PLACES=198, PETRI_TRANSITIONS=279} [2025-04-13 20:15:18,033 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 147 predicate places. [2025-04-13 20:15:18,034 INFO L485 AbstractCegarLoop]: Abstraction has has 198 places, 279 transitions, 3488 flow [2025-04-13 20:15:18,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.88888888888889) internal successors, (197), 9 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:18,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:18,034 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:18,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 20:15:18,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:18,235 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-13 20:15:18,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:18,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1186301679, now seen corresponding path program 5 times [2025-04-13 20:15:18,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:18,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468538795] [2025-04-13 20:15:18,236 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:15:18,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:18,243 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-04-13 20:15:18,250 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-04-13 20:15:18,250 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:15:18,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:15:18,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:18,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468538795] [2025-04-13 20:15:18,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468538795] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:18,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280764862] [2025-04-13 20:15:18,296 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:15:18,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:18,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:18,297 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:15:18,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 20:15:18,345 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-04-13 20:15:18,364 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-04-13 20:15:18,364 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:15:18,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:18,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:15:18,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:15:18,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:15:18,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280764862] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:18,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:18,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-04-13 20:15:18,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166479471] [2025-04-13 20:15:18,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:18,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:15:18,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:18,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:15:18,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:15:18,425 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2025-04-13 20:15:18,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 279 transitions, 3488 flow. Second operand has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:18,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:18,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2025-04-13 20:15:18,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:20,031 INFO L116 PetriNetUnfolderBase]: 8134/11229 cut-off events. [2025-04-13 20:15:20,031 INFO L117 PetriNetUnfolderBase]: For 343649/344626 co-relation queries the response was YES. [2025-04-13 20:15:20,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109452 conditions, 11229 events. 8134/11229 cut-off events. For 343649/344626 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 52383 event pairs, 715 based on Foata normal form. 535/10938 useless extension candidates. Maximal degree in co-relation 109376. Up to 4398 conditions per place. [2025-04-13 20:15:20,162 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 232 selfloop transitions, 166 changer transitions 1/465 dead transitions. [2025-04-13 20:15:20,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 465 transitions, 6674 flow [2025-04-13 20:15:20,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:15:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:15:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 310 transitions. [2025-04-13 20:15:20,163 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5218855218855218 [2025-04-13 20:15:20,163 INFO L175 Difference]: Start difference. First operand has 198 places, 279 transitions, 3488 flow. Second operand 11 states and 310 transitions. [2025-04-13 20:15:20,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 465 transitions, 6674 flow [2025-04-13 20:15:20,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 465 transitions, 6520 flow, removed 72 selfloop flow, removed 3 redundant places. [2025-04-13 20:15:20,779 INFO L231 Difference]: Finished difference. Result has 210 places, 390 transitions, 5832 flow [2025-04-13 20:15:20,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3384, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5832, PETRI_PLACES=210, PETRI_TRANSITIONS=390} [2025-04-13 20:15:20,779 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 159 predicate places. [2025-04-13 20:15:20,779 INFO L485 AbstractCegarLoop]: Abstraction has has 210 places, 390 transitions, 5832 flow [2025-04-13 20:15:20,780 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:20,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:20,780 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:20,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 20:15:20,980 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,SelfDestructingSolverStorable13 [2025-04-13 20:15:20,980 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-13 20:15:20,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1423533451, now seen corresponding path program 6 times [2025-04-13 20:15:20,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:20,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407347575] [2025-04-13 20:15:20,981 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:15:20,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:20,988 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 2 equivalence classes. [2025-04-13 20:15:21,000 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-04-13 20:15:21,001 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:15:21,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:15:21,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:21,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407347575] [2025-04-13 20:15:21,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407347575] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:21,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520907340] [2025-04-13 20:15:21,060 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:15:21,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:21,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:21,062 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-13 20:15:21,063 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-13 20:15:21,109 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 2 equivalence classes. [2025-04-13 20:15:21,128 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-04-13 20:15:21,128 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:15:21,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:21,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:15:21,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:15:21,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:15:21,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520907340] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:21,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:21,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-04-13 20:15:21,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304699977] [2025-04-13 20:15:21,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:21,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:15:21,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:21,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:15:21,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:15:21,194 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2025-04-13 20:15:21,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 390 transitions, 5832 flow. Second operand has 10 states, 10 states have (on average 21.6) internal successors, (216), 10 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:21,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:21,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2025-04-13 20:15:21,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:23,349 INFO L116 PetriNetUnfolderBase]: 11738/16035 cut-off events. [2025-04-13 20:15:23,350 INFO L117 PetriNetUnfolderBase]: For 569290/571361 co-relation queries the response was YES. [2025-04-13 20:15:23,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175010 conditions, 16035 events. 11738/16035 cut-off events. For 569290/571361 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 78832 event pairs, 1114 based on Foata normal form. 733/16204 useless extension candidates. Maximal degree in co-relation 174930. Up to 6903 conditions per place. [2025-04-13 20:15:23,533 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 328 selfloop transitions, 153 changer transitions 5/552 dead transitions. [2025-04-13 20:15:23,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 552 transitions, 9427 flow [2025-04-13 20:15:23,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:15:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:15:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 390 transitions. [2025-04-13 20:15:23,534 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2025-04-13 20:15:23,534 INFO L175 Difference]: Start difference. First operand has 210 places, 390 transitions, 5832 flow. Second operand 14 states and 390 transitions. [2025-04-13 20:15:23,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 552 transitions, 9427 flow [2025-04-13 20:15:25,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 552 transitions, 8827 flow, removed 245 selfloop flow, removed 4 redundant places. [2025-04-13 20:15:25,317 INFO L231 Difference]: Finished difference. Result has 228 places, 472 transitions, 7721 flow [2025-04-13 20:15:25,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=5424, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7721, PETRI_PLACES=228, PETRI_TRANSITIONS=472} [2025-04-13 20:15:25,317 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 177 predicate places. [2025-04-13 20:15:25,318 INFO L485 AbstractCegarLoop]: Abstraction has has 228 places, 472 transitions, 7721 flow [2025-04-13 20:15:25,318 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.6) internal successors, (216), 10 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:25,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:25,318 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:25,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 20:15:25,518 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 20:15:25,518 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-13 20:15:25,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:25,519 INFO L85 PathProgramCache]: Analyzing trace with hash 103812115, now seen corresponding path program 7 times [2025-04-13 20:15:25,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:25,519 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637732326] [2025-04-13 20:15:25,519 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:15:25,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:25,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-13 20:15:25,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-13 20:15:25,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:15:25,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:15:25,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:25,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637732326] [2025-04-13 20:15:25,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637732326] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:25,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908359335] [2025-04-13 20:15:25,595 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:15:25,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:25,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:25,597 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:15:25,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 20:15:25,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-13 20:15:25,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-13 20:15:25,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:15:25,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:25,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:15:25,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:15:25,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:15:25,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908359335] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:25,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:25,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-04-13 20:15:25,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771179976] [2025-04-13 20:15:25,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:25,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 20:15:25,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:25,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 20:15:25,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-04-13 20:15:25,835 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2025-04-13 20:15:25,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 472 transitions, 7721 flow. Second operand has 16 states, 16 states have (on average 20.75) internal successors, (332), 16 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:25,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:25,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2025-04-13 20:15:25,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:28,419 INFO L116 PetriNetUnfolderBase]: 11846/16328 cut-off events. [2025-04-13 20:15:28,420 INFO L117 PetriNetUnfolderBase]: For 602879/605045 co-relation queries the response was YES. [2025-04-13 20:15:28,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178322 conditions, 16328 events. 11846/16328 cut-off events. For 602879/605045 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 81370 event pairs, 3176 based on Foata normal form. 526/16379 useless extension candidates. Maximal degree in co-relation 178233. Up to 13420 conditions per place. [2025-04-13 20:15:28,595 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 401 selfloop transitions, 6 changer transitions 55/528 dead transitions. [2025-04-13 20:15:28,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 528 transitions, 9286 flow [2025-04-13 20:15:28,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:15:28,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:15:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions. [2025-04-13 20:15:28,597 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-04-13 20:15:28,597 INFO L175 Difference]: Start difference. First operand has 228 places, 472 transitions, 7721 flow. Second operand 8 states and 208 transitions. [2025-04-13 20:15:28,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 528 transitions, 9286 flow [2025-04-13 20:15:30,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 528 transitions, 9002 flow, removed 104 selfloop flow, removed 3 redundant places. [2025-04-13 20:15:30,221 INFO L231 Difference]: Finished difference. Result has 236 places, 473 transitions, 7561 flow [2025-04-13 20:15:30,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=7451, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7561, PETRI_PLACES=236, PETRI_TRANSITIONS=473} [2025-04-13 20:15:30,222 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 185 predicate places. [2025-04-13 20:15:30,222 INFO L485 AbstractCegarLoop]: Abstraction has has 236 places, 473 transitions, 7561 flow [2025-04-13 20:15:30,222 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 20.75) internal successors, (332), 16 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:30,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:30,222 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:30,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 20:15:30,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 20:15:30,423 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-13 20:15:30,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:30,423 INFO L85 PathProgramCache]: Analyzing trace with hash -677683556, now seen corresponding path program 8 times [2025-04-13 20:15:30,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:30,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606846963] [2025-04-13 20:15:30,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:15:30,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:30,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-13 20:15:30,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-13 20:15:30,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:15:30,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 20:15:30,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:30,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606846963] [2025-04-13 20:15:30,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606846963] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:30,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220571930] [2025-04-13 20:15:30,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:15:30,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:30,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:30,479 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:15:30,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 20:15:30,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-13 20:15:30,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-13 20:15:30,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:15:30,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:30,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:15:30,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:30,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 20:15:30,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 20:15:30,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220571930] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:30,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:30,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-04-13 20:15:30,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368886351] [2025-04-13 20:15:30,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:30,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:15:30,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:30,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:15:30,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:15:30,615 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2025-04-13 20:15:30,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 473 transitions, 7561 flow. Second operand has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:30,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:30,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2025-04-13 20:15:30,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:33,016 INFO L116 PetriNetUnfolderBase]: 12152/16991 cut-off events. [2025-04-13 20:15:33,017 INFO L117 PetriNetUnfolderBase]: For 623875/625667 co-relation queries the response was YES. [2025-04-13 20:15:33,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181993 conditions, 16991 events. 12152/16991 cut-off events. For 623875/625667 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 89728 event pairs, 1101 based on Foata normal form. 988/17561 useless extension candidates. Maximal degree in co-relation 181899. Up to 7117 conditions per place. [2025-04-13 20:15:33,231 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 240 selfloop transitions, 273 changer transitions 2/581 dead transitions. [2025-04-13 20:15:33,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 581 transitions, 9970 flow [2025-04-13 20:15:33,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:15:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:15:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 365 transitions. [2025-04-13 20:15:33,233 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.51994301994302 [2025-04-13 20:15:33,233 INFO L175 Difference]: Start difference. First operand has 236 places, 473 transitions, 7561 flow. Second operand 13 states and 365 transitions. [2025-04-13 20:15:33,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 581 transitions, 9970 flow [2025-04-13 20:15:34,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 581 transitions, 9828 flow, removed 58 selfloop flow, removed 9 redundant places. [2025-04-13 20:15:35,003 INFO L231 Difference]: Finished difference. Result has 238 places, 496 transitions, 8657 flow [2025-04-13 20:15:35,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=7355, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8657, PETRI_PLACES=238, PETRI_TRANSITIONS=496} [2025-04-13 20:15:35,004 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 187 predicate places. [2025-04-13 20:15:35,004 INFO L485 AbstractCegarLoop]: Abstraction has has 238 places, 496 transitions, 8657 flow [2025-04-13 20:15:35,004 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.4) internal successors, (214), 10 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:35,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:15:35,004 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:35,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 20:15:35,204 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 20:15:35,205 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-13 20:15:35,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:15:35,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1117973565, now seen corresponding path program 9 times [2025-04-13 20:15:35,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:15:35,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67620313] [2025-04-13 20:15:35,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:15:35,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:15:35,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 3 equivalence classes. [2025-04-13 20:15:35,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 47 of 50 statements. [2025-04-13 20:15:35,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:15:35,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 20:15:35,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:15:35,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67620313] [2025-04-13 20:15:35,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67620313] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:15:35,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021658308] [2025-04-13 20:15:35,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:15:35,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:15:35,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:15:35,358 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:15:35,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 20:15:35,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 3 equivalence classes. [2025-04-13 20:15:35,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 47 of 50 statements. [2025-04-13 20:15:35,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:15:35,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:15:35,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 20:15:35,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:15:35,554 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:15:35,555 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 19 treesize of output 17 [2025-04-13 20:15:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 20:15:35,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:15:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 20:15:35,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021658308] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:15:35,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:15:35,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 23 [2025-04-13 20:15:35,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245834197] [2025-04-13 20:15:35,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:35,758 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:15:35,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:35,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:15:35,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:15:35,785 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2025-04-13 20:15:35,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 496 transitions, 8657 flow. Second operand has 24 states, 24 states have (on average 13.5) internal successors, (324), 24 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:15:35,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:35,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2025-04-13 20:15:35,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:47,659 INFO L116 PetriNetUnfolderBase]: 44630/61075 cut-off events. [2025-04-13 20:15:47,660 INFO L117 PetriNetUnfolderBase]: For 2515010/2515030 co-relation queries the response was YES. [2025-04-13 20:15:48,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717473 conditions, 61075 events. 44630/61075 cut-off events. For 2515010/2515030 co-relation queries the response was YES. Maximal size of possible extension queue 2056. Compared 367668 event pairs, 610 based on Foata normal form. 37/59628 useless extension candidates. Maximal degree in co-relation 717382. Up to 26330 conditions per place. [2025-04-13 20:15:48,753 INFO L140 encePairwiseOnDemand]: 36/54 looper letters, 616 selfloop transitions, 1358 changer transitions 97/2083 dead transitions. [2025-04-13 20:15:48,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 2083 transitions, 44970 flow [2025-04-13 20:15:48,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 20:15:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2025-04-13 20:15:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 1277 transitions. [2025-04-13 20:15:48,755 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3814217443249701 [2025-04-13 20:15:48,755 INFO L175 Difference]: Start difference. First operand has 238 places, 496 transitions, 8657 flow. Second operand 62 states and 1277 transitions. [2025-04-13 20:15:48,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 2083 transitions, 44970 flow [2025-04-13 20:16:01,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 2083 transitions, 43307 flow, removed 136 selfloop flow, removed 9 redundant places. [2025-04-13 20:16:01,088 INFO L231 Difference]: Finished difference. Result has 311 places, 1600 transitions, 36840 flow [2025-04-13 20:16:01,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=8101, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=397, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=36840, PETRI_PLACES=311, PETRI_TRANSITIONS=1600} [2025-04-13 20:16:01,088 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 260 predicate places. [2025-04-13 20:16:01,089 INFO L485 AbstractCegarLoop]: Abstraction has has 311 places, 1600 transitions, 36840 flow [2025-04-13 20:16:01,089 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 13.5) internal successors, (324), 24 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:01,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:01,089 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:01,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 20:16:01,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 20:16:01,290 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-13 20:16:01,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:01,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1280447485, now seen corresponding path program 10 times [2025-04-13 20:16:01,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:01,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575492665] [2025-04-13 20:16:01,290 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:16:01,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:01,298 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-04-13 20:16:01,306 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 20:16:01,306 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:16:01,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 20:16:01,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:01,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575492665] [2025-04-13 20:16:01,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575492665] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:16:01,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036451181] [2025-04-13 20:16:01,548 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:16:01,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:01,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:01,549 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:16:01,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 20:16:01,602 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-04-13 20:16:01,625 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 20:16:01,625 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:16:01,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:01,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 20:16:01,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:16:02,066 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-04-13 20:16:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 20:16:02,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:16:02,320 INFO L325 Elim1Store]: treesize reduction 10, result has 63.0 percent of original size [2025-04-13 20:16:02,321 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 25 [2025-04-13 20:16:02,343 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 20:16:02,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036451181] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:16:02,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:16:02,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2025-04-13 20:16:02,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44670864] [2025-04-13 20:16:02,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:16:02,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 20:16:02,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:02,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 20:16:02,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2025-04-13 20:16:02,409 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 54 [2025-04-13 20:16:02,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 1600 transitions, 36840 flow. Second operand has 29 states, 29 states have (on average 9.03448275862069) internal successors, (262), 29 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:02,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:02,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 54 [2025-04-13 20:16:02,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:30,374 INFO L116 PetriNetUnfolderBase]: 70085/95060 cut-off events. [2025-04-13 20:16:30,375 INFO L117 PetriNetUnfolderBase]: For 4959694/4959708 co-relation queries the response was YES. [2025-04-13 20:16:31,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200272 conditions, 95060 events. 70085/95060 cut-off events. For 4959694/4959708 co-relation queries the response was YES. Maximal size of possible extension queue 3305. Compared 591595 event pairs, 2271 based on Foata normal form. 72/93048 useless extension candidates. Maximal degree in co-relation 1200160. Up to 41157 conditions per place. [2025-04-13 20:16:32,186 INFO L140 encePairwiseOnDemand]: 33/54 looper letters, 1632 selfloop transitions, 1225 changer transitions 1331/4196 dead transitions. [2025-04-13 20:16:32,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 4196 transitions, 107363 flow [2025-04-13 20:16:32,187 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-13 20:16:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2025-04-13 20:16:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 848 transitions. [2025-04-13 20:16:32,192 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2707535121328225 [2025-04-13 20:16:32,192 INFO L175 Difference]: Start difference. First operand has 311 places, 1600 transitions, 36840 flow. Second operand 58 states and 848 transitions. [2025-04-13 20:16:32,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 4196 transitions, 107363 flow [2025-04-13 20:18:25,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 4196 transitions, 92957 flow, removed 6748 selfloop flow, removed 14 redundant places. [2025-04-13 20:18:25,280 INFO L231 Difference]: Finished difference. Result has 369 places, 2164 transitions, 46171 flow [2025-04-13 20:18:25,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=31187, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=662, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=839, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=46171, PETRI_PLACES=369, PETRI_TRANSITIONS=2164} [2025-04-13 20:18:25,282 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 318 predicate places. [2025-04-13 20:18:25,282 INFO L485 AbstractCegarLoop]: Abstraction has has 369 places, 2164 transitions, 46171 flow [2025-04-13 20:18:25,282 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.03448275862069) internal successors, (262), 29 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:18:25,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:25,282 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:18:25,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-13 20:18:25,483 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:18:25,483 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-13 20:18:25,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:25,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1680735573, now seen corresponding path program 1 times [2025-04-13 20:18:25,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:25,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406433895] [2025-04-13 20:18:25,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:25,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:25,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-13 20:18:25,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 20:18:25,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:25,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 20:18:25,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:25,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406433895] [2025-04-13 20:18:25,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406433895] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:18:25,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881988465] [2025-04-13 20:18:25,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:25,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:18:25,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:18:25,789 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:18:25,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 20:18:25,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-13 20:18:25,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 20:18:25,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:25,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:25,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 20:18:25,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:18:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 20:18:25,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:18:26,144 INFO L325 Elim1Store]: treesize reduction 13, result has 62.9 percent of original size [2025-04-13 20:18:26,144 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 39 treesize of output 30 [2025-04-13 20:18:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 20:18:26,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881988465] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:18:26,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:18:26,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 8] total 26 [2025-04-13 20:18:26,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023850552] [2025-04-13 20:18:26,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:18:26,156 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:18:26,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:26,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:18:26,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:18:26,186 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 54 [2025-04-13 20:18:26,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 2164 transitions, 46171 flow. Second operand has 26 states, 26 states have (on average 12.115384615384615) internal successors, (315), 26 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:18:26,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:26,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 54 [2025-04-13 20:18:26,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand