/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:11:57,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:11:57,153 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:11:57,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:11:57,159 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:11:57,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:11:57,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:11:57,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:11:57,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:11:57,182 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:11:57,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:11:57,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:11:57,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:11:57,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:11:57,183 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:11:57,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:11:57,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:11:57,184 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:11:57,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:11:57,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:11:57,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:11:57,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:11:57,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:11:57,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:11:57,184 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:11:57,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:11:57,184 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:11:57,184 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:11:57,184 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:11:57,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:11:57,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:11:57,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:11:57,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:11:57,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:11:57,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:11:57,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:11:57,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:11:57,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:11:57,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:11:57,185 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:11:57,185 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:11:57,185 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:11:57,185 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:11:57,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:11:57,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:11:57,185 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:11:57,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:11:57,186 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:11:57,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:11:57,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:11:57,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:11:57,435 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:11:57,435 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:11:57,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2025-04-14 01:11:58,742 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d8eab42/bc577838a414460997f879c8ccd42981/FLAG95b84e6bc [2025-04-14 01:11:58,954 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:11:58,955 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2025-04-14 01:11:58,962 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d8eab42/bc577838a414460997f879c8ccd42981/FLAG95b84e6bc [2025-04-14 01:11:59,793 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d8eab42/bc577838a414460997f879c8ccd42981 [2025-04-14 01:11:59,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:11:59,797 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:11:59,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:11:59,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:11:59,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:11:59,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:11:59" (1/1) ... [2025-04-14 01:11:59,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77ed77da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:11:59, skipping insertion in model container [2025-04-14 01:11:59,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:11:59" (1/1) ... [2025-04-14 01:11:59,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:12:00,033 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2423,2436] [2025-04-14 01:12:00,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:12:00,064 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:12:00,110 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2423,2436] [2025-04-14 01:12:00,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:12:00,126 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:12:00,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:12:00 WrapperNode [2025-04-14 01:12:00,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:12:00,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:12:00,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:12:00,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:12:00,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:12:00" (1/1) ... [2025-04-14 01:12:00,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:12:00" (1/1) ... [2025-04-14 01:12:00,179 INFO L138 Inliner]: procedures = 22, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 249 [2025-04-14 01:12:00,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:12:00,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:12:00,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:12:00,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:12:00,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:12:00" (1/1) ... [2025-04-14 01:12:00,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:12:00" (1/1) ... [2025-04-14 01:12:00,192 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:12:00" (1/1) ... [2025-04-14 01:12:00,216 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 2 writes are split as follows [0, 2]. [2025-04-14 01:12:00,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:12:00" (1/1) ... [2025-04-14 01:12:00,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:12:00" (1/1) ... [2025-04-14 01:12:00,227 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:12:00" (1/1) ... [2025-04-14 01:12:00,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:12:00" (1/1) ... [2025-04-14 01:12:00,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:12:00" (1/1) ... [2025-04-14 01:12:00,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:12:00" (1/1) ... [2025-04-14 01:12:00,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:12:00,245 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:12:00,245 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:12:00,245 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:12:00,246 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:12:00" (1/1) ... [2025-04-14 01:12:00,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:12:00,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:12:00,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 01:12:00,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 01:12:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:12:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:12:00,311 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:12:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:12:00,311 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:12:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:12:00,311 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:12:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:12:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:12:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:12:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:12:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:12:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:12:00,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:12:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:12:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:12:00,312 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:12:00,389 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:12:00,391 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:12:00,746 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:12:00,746 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:12:00,746 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:12:01,098 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:12:01,103 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:12:01,108 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:12:01,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:12:01 BoogieIcfgContainer [2025-04-14 01:12:01,109 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:12:01,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:12:01,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:12:01,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:12:01,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:11:59" (1/3) ... [2025-04-14 01:12:01,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d00dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:12:01, skipping insertion in model container [2025-04-14 01:12:01,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:12:00" (2/3) ... [2025-04-14 01:12:01,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d00dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:12:01, skipping insertion in model container [2025-04-14 01:12:01,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:12:01" (3/3) ... [2025-04-14 01:12:01,116 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2025-04-14 01:12:01,127 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:12:01,128 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum.wvr.c that has 4 procedures, 26 locations, 29 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-14 01:12:01,128 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:12:01,190 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 01:12:01,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 85 flow [2025-04-14 01:12:01,255 INFO L116 PetriNetUnfolderBase]: 7/29 cut-off events. [2025-04-14 01:12:01,258 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:12:01,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 7/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-04-14 01:12:01,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 85 flow [2025-04-14 01:12:01,265 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 74 flow [2025-04-14 01:12:01,275 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:12:01,288 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;@495028df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:12:01,288 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:12:01,334 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:12:01,334 INFO L116 PetriNetUnfolderBase]: 7/27 cut-off events. [2025-04-14 01:12:01,335 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:12:01,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:01,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:12:01,335 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:01,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:01,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1537036933, now seen corresponding path program 1 times [2025-04-14 01:12:01,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:01,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547674513] [2025-04-14 01:12:01,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:12:01,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:01,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:12:01,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:12:01,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:12:01,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:01,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:01,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547674513] [2025-04-14 01:12:01,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547674513] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:12:01,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:12:01,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:12:01,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657129856] [2025-04-14 01:12:01,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:12:01,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:12:01,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:01,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:12:01,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:12:01,641 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:01,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:01,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:01,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:01,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:01,790 INFO L116 PetriNetUnfolderBase]: 367/518 cut-off events. [2025-04-14 01:12:01,790 INFO L117 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-04-14 01:12:01,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1094 conditions, 518 events. 367/518 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1371 event pairs, 226 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 930. Up to 514 conditions per place. [2025-04-14 01:12:01,795 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2025-04-14 01:12:01,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 126 flow [2025-04-14 01:12:01,798 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:12:01,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:12:01,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-14 01:12:01,808 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-14 01:12:01,809 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 74 flow. Second operand 3 states and 37 transitions. [2025-04-14 01:12:01,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 126 flow [2025-04-14 01:12:01,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 01:12:01,815 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 62 flow [2025-04-14 01:12:01,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2025-04-14 01:12:01,818 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2025-04-14 01:12:01,819 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 62 flow [2025-04-14 01:12:01,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:01,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:01,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:12:01,820 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:12:01,820 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:01,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:01,821 INFO L85 PathProgramCache]: Analyzing trace with hash 715198675, now seen corresponding path program 1 times [2025-04-14 01:12:01,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:01,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888265639] [2025-04-14 01:12:01,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:12:01,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:01,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 01:12:01,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:12:01,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:12:01,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:02,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:02,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888265639] [2025-04-14 01:12:02,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888265639] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:12:02,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:12:02,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:12:02,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019250719] [2025-04-14 01:12:02,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:12:02,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:12:02,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:02,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:12:02,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:12:02,037 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:02,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:02,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:02,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:02,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:02,170 INFO L116 PetriNetUnfolderBase]: 367/521 cut-off events. [2025-04-14 01:12:02,170 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-14 01:12:02,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 521 events. 367/521 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1373 event pairs, 226 based on Foata normal form. 3/383 useless extension candidates. Maximal degree in co-relation 1042. Up to 519 conditions per place. [2025-04-14 01:12:02,173 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 25 selfloop transitions, 4 changer transitions 1/30 dead transitions. [2025-04-14 01:12:02,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 30 transitions, 128 flow [2025-04-14 01:12:02,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:12:02,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:12:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-04-14 01:12:02,175 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3515625 [2025-04-14 01:12:02,175 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 62 flow. Second operand 4 states and 45 transitions. [2025-04-14 01:12:02,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 30 transitions, 128 flow [2025-04-14 01:12:02,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 127 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:12:02,176 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 87 flow [2025-04-14 01:12:02,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-04-14 01:12:02,177 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2025-04-14 01:12:02,177 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 87 flow [2025-04-14 01:12:02,178 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:02,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:02,178 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:12:02,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:12:02,179 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:02,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:02,180 INFO L85 PathProgramCache]: Analyzing trace with hash 441641631, now seen corresponding path program 1 times [2025-04-14 01:12:02,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:02,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300076136] [2025-04-14 01:12:02,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:12:02,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:02,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:12:02,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:12:02,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:12:02,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:12:02,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:02,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300076136] [2025-04-14 01:12:02,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300076136] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:12:02,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461612217] [2025-04-14 01:12:02,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:12:02,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:02,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:12:02,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:12:02,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 01:12:02,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:12:02,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:12:02,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:12:02,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:02,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:12:02,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:12:02,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:12:02,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:12:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:12:02,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461612217] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:12:02,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:12:02,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-14 01:12:02,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809376952] [2025-04-14 01:12:02,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:12:02,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:12:02,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:02,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:12:02,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:12:02,575 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:02,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:02,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:02,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:02,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:02,721 INFO L116 PetriNetUnfolderBase]: 475/670 cut-off events. [2025-04-14 01:12:02,721 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-14 01:12:02,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 670 events. 475/670 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1969 event pairs, 226 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 1356. Up to 519 conditions per place. [2025-04-14 01:12:02,725 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 40 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2025-04-14 01:12:02,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 207 flow [2025-04-14 01:12:02,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:12:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:12:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2025-04-14 01:12:02,728 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36875 [2025-04-14 01:12:02,728 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 87 flow. Second operand 5 states and 59 transitions. [2025-04-14 01:12:02,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 207 flow [2025-04-14 01:12:02,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 199 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 01:12:02,729 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 95 flow [2025-04-14 01:12:02,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2025-04-14 01:12:02,730 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2025-04-14 01:12:02,730 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 95 flow [2025-04-14 01:12:02,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:02,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:02,730 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] [2025-04-14 01:12:02,739 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-14 01:12:02,936 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:02,936 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:02,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:02,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1453448770, now seen corresponding path program 1 times [2025-04-14 01:12:02,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:02,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987500022] [2025-04-14 01:12:02,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:12:02,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:02,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:12:02,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:02,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:12:02,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:12:03,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:03,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987500022] [2025-04-14 01:12:03,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987500022] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:12:03,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689170751] [2025-04-14 01:12:03,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:12:03,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:03,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:12:03,800 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:12:03,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 01:12:03,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:12:03,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:03,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:12:03,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:03,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-14 01:12:03,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:12:03,922 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-14 01:12:03,947 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:12:03,983 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:12:03,984 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 01:12:04,012 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:12:04,244 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-14 01:12:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:04,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:12:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:04,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689170751] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:12:04,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:12:04,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 22 [2025-04-14 01:12:04,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102936991] [2025-04-14 01:12:04,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:12:04,412 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 01:12:04,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:04,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 01:12:04,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2025-04-14 01:12:04,414 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:04,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 95 flow. Second operand has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:04,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:04,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:04,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:05,384 INFO L116 PetriNetUnfolderBase]: 861/1247 cut-off events. [2025-04-14 01:12:05,384 INFO L117 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2025-04-14 01:12:05,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2940 conditions, 1247 events. 861/1247 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4769 event pairs, 7 based on Foata normal form. 1/981 useless extension candidates. Maximal degree in co-relation 2911. Up to 788 conditions per place. [2025-04-14 01:12:05,390 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 100 selfloop transitions, 47 changer transitions 1/148 dead transitions. [2025-04-14 01:12:05,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 148 transitions, 709 flow [2025-04-14 01:12:05,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 01:12:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 01:12:05,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 198 transitions. [2025-04-14 01:12:05,392 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3639705882352941 [2025-04-14 01:12:05,392 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 95 flow. Second operand 17 states and 198 transitions. [2025-04-14 01:12:05,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 148 transitions, 709 flow [2025-04-14 01:12:05,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 148 transitions, 689 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-14 01:12:05,395 INFO L231 Difference]: Finished difference. Result has 55 places, 71 transitions, 351 flow [2025-04-14 01:12:05,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=351, PETRI_PLACES=55, PETRI_TRANSITIONS=71} [2025-04-14 01:12:05,396 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2025-04-14 01:12:05,396 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 71 transitions, 351 flow [2025-04-14 01:12:05,396 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:05,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:05,396 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] [2025-04-14 01:12:05,403 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-14 01:12:05,600 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,SelfDestructingSolverStorable3 [2025-04-14 01:12:05,600 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:05,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:05,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1533315070, now seen corresponding path program 2 times [2025-04-14 01:12:05,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:05,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821685955] [2025-04-14 01:12:05,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:12:05,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:05,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:05,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:05,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:12:05,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:12:06,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:06,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821685955] [2025-04-14 01:12:06,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821685955] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:12:06,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880281182] [2025-04-14 01:12:06,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:12:06,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:06,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:12:06,175 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:12:06,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 01:12:06,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:06,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:06,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:12:06,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:06,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:12:06,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:12:06,419 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:12:06,420 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 27 treesize of output 19 [2025-04-14 01:12:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:06,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:12:06,512 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:12:06,512 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 33 treesize of output 78 [2025-04-14 01:12:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:06,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880281182] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:12:06,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:12:06,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 15 [2025-04-14 01:12:06,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307032981] [2025-04-14 01:12:06,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:12:06,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:12:06,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:06,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:12:06,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:12:06,721 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:06,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 71 transitions, 351 flow. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:06,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:06,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:06,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:07,244 INFO L116 PetriNetUnfolderBase]: 965/1416 cut-off events. [2025-04-14 01:12:07,245 INFO L117 PetriNetUnfolderBase]: For 1244/1244 co-relation queries the response was YES. [2025-04-14 01:12:07,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4599 conditions, 1416 events. 965/1416 cut-off events. For 1244/1244 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5633 event pairs, 92 based on Foata normal form. 1/1279 useless extension candidates. Maximal degree in co-relation 4559. Up to 1096 conditions per place. [2025-04-14 01:12:07,253 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 83 selfloop transitions, 54 changer transitions 1/138 dead transitions. [2025-04-14 01:12:07,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 138 transitions, 896 flow [2025-04-14 01:12:07,254 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 01:12:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 01:12:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 141 transitions. [2025-04-14 01:12:07,258 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31473214285714285 [2025-04-14 01:12:07,258 INFO L175 Difference]: Start difference. First operand has 55 places, 71 transitions, 351 flow. Second operand 14 states and 141 transitions. [2025-04-14 01:12:07,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 138 transitions, 896 flow [2025-04-14 01:12:07,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 138 transitions, 888 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-14 01:12:07,264 INFO L231 Difference]: Finished difference. Result has 74 places, 105 transitions, 695 flow [2025-04-14 01:12:07,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=695, PETRI_PLACES=74, PETRI_TRANSITIONS=105} [2025-04-14 01:12:07,265 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 43 predicate places. [2025-04-14 01:12:07,265 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 105 transitions, 695 flow [2025-04-14 01:12:07,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:07,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:07,265 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] [2025-04-14 01:12:07,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 01:12:07,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:07,469 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:07,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:07,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1411486086, now seen corresponding path program 3 times [2025-04-14 01:12:07,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:07,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481330712] [2025-04-14 01:12:07,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:12:07,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:07,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:07,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:07,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:12:07,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:08,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:08,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481330712] [2025-04-14 01:12:08,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481330712] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:12:08,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129906537] [2025-04-14 01:12:08,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:12:08,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:08,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:12:08,189 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:12:08,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 01:12:08,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:08,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:08,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:12:08,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:08,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:12:08,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:12:08,421 INFO L325 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2025-04-14 01:12:08,421 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 31 treesize of output 43 [2025-04-14 01:12:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:08,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:12:08,517 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:12:08,517 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 41 treesize of output 86 [2025-04-14 01:12:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:08,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129906537] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:12:08,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:12:08,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 6] total 16 [2025-04-14 01:12:08,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593091980] [2025-04-14 01:12:08,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:12:08,655 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:12:08,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:08,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:12:08,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:12:08,656 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:08,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 105 transitions, 695 flow. Second operand has 18 states, 18 states have (on average 5.5) internal successors, (99), 18 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:08,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:08,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:08,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:10,095 INFO L116 PetriNetUnfolderBase]: 2663/3810 cut-off events. [2025-04-14 01:12:10,096 INFO L117 PetriNetUnfolderBase]: For 6049/6049 co-relation queries the response was YES. [2025-04-14 01:12:10,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14246 conditions, 3810 events. 2663/3810 cut-off events. For 6049/6049 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 17788 event pairs, 90 based on Foata normal form. 1/3334 useless extension candidates. Maximal degree in co-relation 14195. Up to 1649 conditions per place. [2025-04-14 01:12:10,184 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 186 selfloop transitions, 203 changer transitions 1/390 dead transitions. [2025-04-14 01:12:10,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 390 transitions, 2962 flow [2025-04-14 01:12:10,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 01:12:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-14 01:12:10,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 359 transitions. [2025-04-14 01:12:10,192 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37395833333333334 [2025-04-14 01:12:10,192 INFO L175 Difference]: Start difference. First operand has 74 places, 105 transitions, 695 flow. Second operand 30 states and 359 transitions. [2025-04-14 01:12:10,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 390 transitions, 2962 flow [2025-04-14 01:12:10,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 390 transitions, 2898 flow, removed 28 selfloop flow, removed 2 redundant places. [2025-04-14 01:12:10,224 INFO L231 Difference]: Finished difference. Result has 116 places, 280 transitions, 2559 flow [2025-04-14 01:12:10,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2559, PETRI_PLACES=116, PETRI_TRANSITIONS=280} [2025-04-14 01:12:10,225 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 85 predicate places. [2025-04-14 01:12:10,225 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 280 transitions, 2559 flow [2025-04-14 01:12:10,225 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.5) internal successors, (99), 18 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:10,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:10,225 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] [2025-04-14 01:12:10,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 01:12:10,426 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:10,426 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:10,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:10,427 INFO L85 PathProgramCache]: Analyzing trace with hash 85852576, now seen corresponding path program 4 times [2025-04-14 01:12:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:10,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429055346] [2025-04-14 01:12:10,427 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:12:10,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:10,438 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:10,461 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:10,462 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:12:10,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:12:10,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:10,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429055346] [2025-04-14 01:12:10,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429055346] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:12:10,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528914904] [2025-04-14 01:12:10,871 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:12:10,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:10,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:12:10,873 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:12:10,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 01:12:10,922 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:10,942 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:10,943 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:12:10,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:10,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-14 01:12:10,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:12:10,953 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-14 01:12:10,973 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:12:10,996 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:12:10,996 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 01:12:11,018 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:12:11,181 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:12:11,181 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 27 [2025-04-14 01:12:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:11,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:12:11,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:11,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528914904] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:12:11,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:12:11,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 23 [2025-04-14 01:12:11,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201032272] [2025-04-14 01:12:11,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:12:11,427 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 01:12:11,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:11,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 01:12:11,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2025-04-14 01:12:11,428 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:11,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 280 transitions, 2559 flow. Second operand has 25 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:11,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:11,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:11,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:14,954 INFO L116 PetriNetUnfolderBase]: 6701/9331 cut-off events. [2025-04-14 01:12:14,955 INFO L117 PetriNetUnfolderBase]: For 50219/50219 co-relation queries the response was YES. [2025-04-14 01:12:14,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48383 conditions, 9331 events. 6701/9331 cut-off events. For 50219/50219 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 47048 event pairs, 306 based on Foata normal form. 3/7748 useless extension candidates. Maximal degree in co-relation 48154. Up to 3399 conditions per place. [2025-04-14 01:12:15,032 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 386 selfloop transitions, 684 changer transitions 3/1073 dead transitions. [2025-04-14 01:12:15,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 1073 transitions, 11093 flow [2025-04-14 01:12:15,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-14 01:12:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2025-04-14 01:12:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 759 transitions. [2025-04-14 01:12:15,038 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37060546875 [2025-04-14 01:12:15,038 INFO L175 Difference]: Start difference. First operand has 116 places, 280 transitions, 2559 flow. Second operand 64 states and 759 transitions. [2025-04-14 01:12:15,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 1073 transitions, 11093 flow [2025-04-14 01:12:15,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 1073 transitions, 10032 flow, removed 444 selfloop flow, removed 7 redundant places. [2025-04-14 01:12:15,671 INFO L231 Difference]: Finished difference. Result has 191 places, 802 transitions, 8515 flow [2025-04-14 01:12:15,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2225, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=8515, PETRI_PLACES=191, PETRI_TRANSITIONS=802} [2025-04-14 01:12:15,674 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 160 predicate places. [2025-04-14 01:12:15,674 INFO L485 AbstractCegarLoop]: Abstraction has has 191 places, 802 transitions, 8515 flow [2025-04-14 01:12:15,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:15,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:15,675 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] [2025-04-14 01:12:15,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-14 01:12:15,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:15,875 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:15,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:15,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1396116350, now seen corresponding path program 5 times [2025-04-14 01:12:15,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:15,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153205404] [2025-04-14 01:12:15,876 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:12:15,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:15,885 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:15,906 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:15,906 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:12:15,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:16,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:16,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153205404] [2025-04-14 01:12:16,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153205404] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:12:16,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558560677] [2025-04-14 01:12:16,734 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:12:16,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:16,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:12:16,736 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:12:16,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 01:12:16,785 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:16,808 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:16,808 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:12:16,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:16,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 01:12:16,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:12:16,842 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:12:17,007 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:12:17,007 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 33 treesize of output 81 [2025-04-14 01:12:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:12:17,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:12:17,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:17,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558560677] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:12:17,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:12:17,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 6] total 19 [2025-04-14 01:12:17,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607196538] [2025-04-14 01:12:17,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:12:17,179 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 01:12:17,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:17,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 01:12:17,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-04-14 01:12:17,181 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:17,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 802 transitions, 8515 flow. Second operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 21 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:17,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:17,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:17,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:20,295 INFO L116 PetriNetUnfolderBase]: 10101/14037 cut-off events. [2025-04-14 01:12:20,295 INFO L117 PetriNetUnfolderBase]: For 159052/159052 co-relation queries the response was YES. [2025-04-14 01:12:20,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84926 conditions, 14037 events. 10101/14037 cut-off events. For 159052/159052 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 75647 event pairs, 395 based on Foata normal form. 1/11698 useless extension candidates. Maximal degree in co-relation 84642. Up to 6894 conditions per place. [2025-04-14 01:12:20,399 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 418 selfloop transitions, 886 changer transitions 1/1305 dead transitions. [2025-04-14 01:12:20,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 1305 transitions, 16126 flow [2025-04-14 01:12:20,401 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-14 01:12:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-14 01:12:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 415 transitions. [2025-04-14 01:12:20,402 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3602430555555556 [2025-04-14 01:12:20,402 INFO L175 Difference]: Start difference. First operand has 191 places, 802 transitions, 8515 flow. Second operand 36 states and 415 transitions. [2025-04-14 01:12:20,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 1305 transitions, 16126 flow [2025-04-14 01:12:21,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 1305 transitions, 15417 flow, removed 349 selfloop flow, removed 2 redundant places. [2025-04-14 01:12:21,911 INFO L231 Difference]: Finished difference. Result has 237 places, 1157 transitions, 14892 flow [2025-04-14 01:12:21,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=8078, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=597, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=14892, PETRI_PLACES=237, PETRI_TRANSITIONS=1157} [2025-04-14 01:12:21,912 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 206 predicate places. [2025-04-14 01:12:21,912 INFO L485 AbstractCegarLoop]: Abstraction has has 237 places, 1157 transitions, 14892 flow [2025-04-14 01:12:21,912 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 21 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:21,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:21,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] [2025-04-14 01:12:21,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-14 01:12:22,112 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:22,113 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:22,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:22,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1724321700, now seen corresponding path program 6 times [2025-04-14 01:12:22,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:22,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590818968] [2025-04-14 01:12:22,113 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:12:22,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:22,120 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:22,137 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:22,137 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:12:22,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:22,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:22,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590818968] [2025-04-14 01:12:22,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590818968] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:12:22,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526437283] [2025-04-14 01:12:22,577 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:12:22,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:22,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:12:22,579 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:12:22,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 01:12:22,625 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:22,646 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:22,646 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:12:22,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:22,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:12:22,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:12:22,811 INFO L325 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2025-04-14 01:12:22,812 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 31 treesize of output 43 [2025-04-14 01:12:22,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:22,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:12:22,924 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:12:22,925 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 41 treesize of output 86 [2025-04-14 01:12:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:23,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526437283] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:12:23,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:12:23,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 6] total 17 [2025-04-14 01:12:23,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754002369] [2025-04-14 01:12:23,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:12:23,045 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 01:12:23,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:23,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 01:12:23,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-04-14 01:12:23,045 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:23,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 1157 transitions, 14892 flow. Second operand has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:23,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:23,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:23,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:26,283 INFO L116 PetriNetUnfolderBase]: 10605/14760 cut-off events. [2025-04-14 01:12:26,284 INFO L117 PetriNetUnfolderBase]: For 199476/199476 co-relation queries the response was YES. [2025-04-14 01:12:26,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99593 conditions, 14760 events. 10605/14760 cut-off events. For 199476/199476 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 80244 event pairs, 456 based on Foata normal form. 1/12292 useless extension candidates. Maximal degree in co-relation 99244. Up to 7077 conditions per place. [2025-04-14 01:12:26,401 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 384 selfloop transitions, 944 changer transitions 1/1329 dead transitions. [2025-04-14 01:12:26,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 1329 transitions, 19082 flow [2025-04-14 01:12:26,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-14 01:12:26,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-14 01:12:26,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 329 transitions. [2025-04-14 01:12:26,403 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2025-04-14 01:12:26,403 INFO L175 Difference]: Start difference. First operand has 237 places, 1157 transitions, 14892 flow. Second operand 28 states and 329 transitions. [2025-04-14 01:12:26,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 1329 transitions, 19082 flow [2025-04-14 01:12:29,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 1329 transitions, 17768 flow, removed 544 selfloop flow, removed 9 redundant places. [2025-04-14 01:12:29,309 INFO L231 Difference]: Finished difference. Result has 260 places, 1219 transitions, 17080 flow [2025-04-14 01:12:29,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=13710, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=894, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=17080, PETRI_PLACES=260, PETRI_TRANSITIONS=1219} [2025-04-14 01:12:29,310 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 229 predicate places. [2025-04-14 01:12:29,310 INFO L485 AbstractCegarLoop]: Abstraction has has 260 places, 1219 transitions, 17080 flow [2025-04-14 01:12:29,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:29,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:29,310 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] [2025-04-14 01:12:29,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 01:12:29,514 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:29,514 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:29,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:29,514 INFO L85 PathProgramCache]: Analyzing trace with hash -725690634, now seen corresponding path program 7 times [2025-04-14 01:12:29,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:29,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904444770] [2025-04-14 01:12:29,515 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:12:29,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:29,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:12:29,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:29,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:12:29,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:12:29,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:29,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904444770] [2025-04-14 01:12:29,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904444770] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:12:29,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234137464] [2025-04-14 01:12:29,909 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:12:29,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:29,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:12:29,911 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:12:29,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 01:12:29,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:12:29,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:29,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:12:29,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:29,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-14 01:12:29,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:12:29,993 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-14 01:12:30,009 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:12:30,028 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:12:30,029 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 01:12:30,046 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:12:30,182 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-14 01:12:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:30,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:12:30,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:30,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234137464] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:12:30,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:12:30,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 22 [2025-04-14 01:12:30,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054558929] [2025-04-14 01:12:30,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:12:30,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 01:12:30,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:30,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 01:12:30,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-04-14 01:12:30,291 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:30,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 1219 transitions, 17080 flow. Second operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:30,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:30,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:30,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:33,079 INFO L116 PetriNetUnfolderBase]: 10695/14919 cut-off events. [2025-04-14 01:12:33,079 INFO L117 PetriNetUnfolderBase]: For 150264/150264 co-relation queries the response was YES. [2025-04-14 01:12:33,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102812 conditions, 14919 events. 10695/14919 cut-off events. For 150264/150264 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 81543 event pairs, 2292 based on Foata normal form. 1/12443 useless extension candidates. Maximal degree in co-relation 102431. Up to 14131 conditions per place. [2025-04-14 01:12:33,211 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 1078 selfloop transitions, 212 changer transitions 1/1291 dead transitions. [2025-04-14 01:12:33,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 1291 transitions, 20387 flow [2025-04-14 01:12:33,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:12:33,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:12:33,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2025-04-14 01:12:33,213 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34375 [2025-04-14 01:12:33,213 INFO L175 Difference]: Start difference. First operand has 260 places, 1219 transitions, 17080 flow. Second operand 12 states and 132 transitions. [2025-04-14 01:12:33,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 1291 transitions, 20387 flow [2025-04-14 01:12:35,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 1291 transitions, 19796 flow, removed 93 selfloop flow, removed 17 redundant places. [2025-04-14 01:12:35,992 INFO L231 Difference]: Finished difference. Result has 259 places, 1247 transitions, 17453 flow [2025-04-14 01:12:35,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=16536, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1017, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=17453, PETRI_PLACES=259, PETRI_TRANSITIONS=1247} [2025-04-14 01:12:35,993 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 228 predicate places. [2025-04-14 01:12:35,993 INFO L485 AbstractCegarLoop]: Abstraction has has 259 places, 1247 transitions, 17453 flow [2025-04-14 01:12:35,993 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:35,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:35,993 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] [2025-04-14 01:12:35,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 01:12:36,194 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,SelfDestructingSolverStorable9 [2025-04-14 01:12:36,194 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:36,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:36,195 INFO L85 PathProgramCache]: Analyzing trace with hash -940139550, now seen corresponding path program 8 times [2025-04-14 01:12:36,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:36,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975942553] [2025-04-14 01:12:36,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:12:36,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:36,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:36,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:36,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:12:36,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:36,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:36,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975942553] [2025-04-14 01:12:36,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975942553] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:12:36,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635946465] [2025-04-14 01:12:36,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:12:36,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:36,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:12:36,787 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:12:36,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 01:12:36,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:36,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:36,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:12:36,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:36,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:12:36,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:12:37,019 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:12:37,019 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 27 treesize of output 19 [2025-04-14 01:12:37,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:37,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:12:37,081 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:12:37,082 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 41 treesize of output 86 [2025-04-14 01:12:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:37,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635946465] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:12:37,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:12:37,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 6] total 16 [2025-04-14 01:12:37,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828832777] [2025-04-14 01:12:37,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:12:37,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:12:37,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:37,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:12:37,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:12:37,217 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:37,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 1247 transitions, 17453 flow. Second operand has 18 states, 18 states have (on average 5.5) internal successors, (99), 18 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:37,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:37,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:37,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:40,056 INFO L116 PetriNetUnfolderBase]: 10719/14962 cut-off events. [2025-04-14 01:12:40,056 INFO L117 PetriNetUnfolderBase]: For 136200/136200 co-relation queries the response was YES. [2025-04-14 01:12:40,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101903 conditions, 14962 events. 10719/14962 cut-off events. For 136200/136200 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 82256 event pairs, 2299 based on Foata normal form. 1/12480 useless extension candidates. Maximal degree in co-relation 101566. Up to 14186 conditions per place. [2025-04-14 01:12:40,298 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1078 selfloop transitions, 233 changer transitions 1/1312 dead transitions. [2025-04-14 01:12:40,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 1312 transitions, 20611 flow [2025-04-14 01:12:40,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 01:12:40,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 01:12:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 156 transitions. [2025-04-14 01:12:40,300 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2025-04-14 01:12:40,300 INFO L175 Difference]: Start difference. First operand has 259 places, 1247 transitions, 17453 flow. Second operand 14 states and 156 transitions. [2025-04-14 01:12:40,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 1312 transitions, 20611 flow [2025-04-14 01:12:42,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 1312 transitions, 20416 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-04-14 01:12:42,628 INFO L231 Difference]: Finished difference. Result has 273 places, 1263 transitions, 18114 flow [2025-04-14 01:12:42,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=17259, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=217, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1014, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=18114, PETRI_PLACES=273, PETRI_TRANSITIONS=1263} [2025-04-14 01:12:42,630 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 242 predicate places. [2025-04-14 01:12:42,630 INFO L485 AbstractCegarLoop]: Abstraction has has 273 places, 1263 transitions, 18114 flow [2025-04-14 01:12:42,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.5) internal successors, (99), 18 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:42,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:42,630 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] [2025-04-14 01:12:42,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 01:12:42,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:42,834 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:42,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:42,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1421340112, now seen corresponding path program 9 times [2025-04-14 01:12:42,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:42,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467086655] [2025-04-14 01:12:42,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:12:42,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:42,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:42,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:42,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:12:42,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:43,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:43,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467086655] [2025-04-14 01:12:43,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467086655] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:12:43,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718273809] [2025-04-14 01:12:43,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:12:43,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:43,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:12:43,146 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-14 01:12:43,146 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-14 01:12:43,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:43,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:43,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:12:43,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:43,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:12:43,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:12:43,357 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:12:43,357 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 27 treesize of output 19 [2025-04-14 01:12:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:43,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:12:43,444 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:12:43,445 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 41 treesize of output 86 [2025-04-14 01:12:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:43,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718273809] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:12:43,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:12:43,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 16 [2025-04-14 01:12:43,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845910594] [2025-04-14 01:12:43,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:12:43,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:12:43,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:43,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:12:43,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:12:43,582 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:43,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 1263 transitions, 18114 flow. Second operand has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:43,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:43,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:43,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:46,792 INFO L116 PetriNetUnfolderBase]: 10879/15194 cut-off events. [2025-04-14 01:12:46,793 INFO L117 PetriNetUnfolderBase]: For 144332/144332 co-relation queries the response was YES. [2025-04-14 01:12:46,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104532 conditions, 15194 events. 10879/15194 cut-off events. For 144332/144332 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 83594 event pairs, 1471 based on Foata normal form. 2/12663 useless extension candidates. Maximal degree in co-relation 104186. Up to 13090 conditions per place. [2025-04-14 01:12:46,977 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 900 selfloop transitions, 476 changer transitions 2/1378 dead transitions. [2025-04-14 01:12:46,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 1378 transitions, 21962 flow [2025-04-14 01:12:46,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 01:12:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 01:12:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 228 transitions. [2025-04-14 01:12:46,979 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3392857142857143 [2025-04-14 01:12:46,979 INFO L175 Difference]: Start difference. First operand has 273 places, 1263 transitions, 18114 flow. Second operand 21 states and 228 transitions. [2025-04-14 01:12:46,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 1378 transitions, 21962 flow [2025-04-14 01:12:49,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 1378 transitions, 21762 flow, removed 35 selfloop flow, removed 5 redundant places. [2025-04-14 01:12:49,139 INFO L231 Difference]: Finished difference. Result has 293 places, 1310 transitions, 19803 flow [2025-04-14 01:12:49,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=17914, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=431, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=802, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=19803, PETRI_PLACES=293, PETRI_TRANSITIONS=1310} [2025-04-14 01:12:49,140 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 262 predicate places. [2025-04-14 01:12:49,140 INFO L485 AbstractCegarLoop]: Abstraction has has 293 places, 1310 transitions, 19803 flow [2025-04-14 01:12:49,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:49,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:49,140 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] [2025-04-14 01:12:49,146 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-14 01:12:49,345 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,SelfDestructingSolverStorable11 [2025-04-14 01:12:49,345 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:49,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:49,345 INFO L85 PathProgramCache]: Analyzing trace with hash -445086406, now seen corresponding path program 10 times [2025-04-14 01:12:49,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:49,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957582424] [2025-04-14 01:12:49,346 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:12:49,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:49,350 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:49,357 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:49,357 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:12:49,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:49,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:49,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957582424] [2025-04-14 01:12:49,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957582424] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:12:49,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970311332] [2025-04-14 01:12:49,726 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:12:49,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:49,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:12:49,728 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-14 01:12:49,730 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-14 01:12:49,780 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:49,801 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:49,801 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:12:49,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:49,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-14 01:12:49,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:12:49,806 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-14 01:12:49,827 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:12:49,849 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:12:49,850 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 01:12:49,868 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:12:49,993 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-14 01:12:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:50,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:12:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:50,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970311332] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:12:50,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:12:50,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 24 [2025-04-14 01:12:50,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864939199] [2025-04-14 01:12:50,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:12:50,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 01:12:50,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:50,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 01:12:50,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2025-04-14 01:12:50,141 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:50,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 1310 transitions, 19803 flow. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:50,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:50,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:50,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:54,229 INFO L116 PetriNetUnfolderBase]: 12302/17191 cut-off events. [2025-04-14 01:12:54,229 INFO L117 PetriNetUnfolderBase]: For 167906/167906 co-relation queries the response was YES. [2025-04-14 01:12:54,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122785 conditions, 17191 events. 12302/17191 cut-off events. For 167906/167906 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 97017 event pairs, 2428 based on Foata normal form. 6/14302 useless extension candidates. Maximal degree in co-relation 122433. Up to 14877 conditions per place. [2025-04-14 01:12:54,420 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1130 selfloop transitions, 429 changer transitions 1/1560 dead transitions. [2025-04-14 01:12:54,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 1560 transitions, 25935 flow [2025-04-14 01:12:54,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-14 01:12:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-14 01:12:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 330 transitions. [2025-04-14 01:12:54,421 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3326612903225806 [2025-04-14 01:12:54,421 INFO L175 Difference]: Start difference. First operand has 293 places, 1310 transitions, 19803 flow. Second operand 31 states and 330 transitions. [2025-04-14 01:12:54,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 1560 transitions, 25935 flow [2025-04-14 01:12:57,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 1560 transitions, 25583 flow, removed 81 selfloop flow, removed 7 redundant places. [2025-04-14 01:12:57,185 INFO L231 Difference]: Finished difference. Result has 322 places, 1451 transitions, 23046 flow [2025-04-14 01:12:57,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=19256, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=285, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=913, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=23046, PETRI_PLACES=322, PETRI_TRANSITIONS=1451} [2025-04-14 01:12:57,186 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 291 predicate places. [2025-04-14 01:12:57,187 INFO L485 AbstractCegarLoop]: Abstraction has has 322 places, 1451 transitions, 23046 flow [2025-04-14 01:12:57,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:57,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:57,187 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] [2025-04-14 01:12:57,193 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-14 01:12:57,391 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,SelfDestructingSolverStorable12 [2025-04-14 01:12:57,391 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:57,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:57,391 INFO L85 PathProgramCache]: Analyzing trace with hash 345628956, now seen corresponding path program 11 times [2025-04-14 01:12:57,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:57,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176044823] [2025-04-14 01:12:57,392 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:12:57,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:57,401 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:57,411 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:57,411 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:12:57,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:57,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:57,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176044823] [2025-04-14 01:12:57,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176044823] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:12:57,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103953071] [2025-04-14 01:12:57,669 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:12:57,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:57,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:12:57,676 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-14 01:12:57,682 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-14 01:12:57,739 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:57,768 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:57,768 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:12:57,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:57,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 01:12:57,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:12:57,802 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:12:57,906 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:12:57,907 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 27 treesize of output 23 [2025-04-14 01:12:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:12:57,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:12:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:12:58,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103953071] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:12:58,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:12:58,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 18 [2025-04-14 01:12:58,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934185111] [2025-04-14 01:12:58,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:12:58,037 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 01:12:58,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:58,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 01:12:58,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-04-14 01:12:58,037 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:58,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 1451 transitions, 23046 flow. Second operand has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:58,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:58,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:58,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:13:02,017 INFO L116 PetriNetUnfolderBase]: 12335/17249 cut-off events. [2025-04-14 01:13:02,017 INFO L117 PetriNetUnfolderBase]: For 175303/175303 co-relation queries the response was YES. [2025-04-14 01:13:02,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127245 conditions, 17249 events. 12335/17249 cut-off events. For 175303/175303 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 97283 event pairs, 2750 based on Foata normal form. 1/14350 useless extension candidates. Maximal degree in co-relation 126998. Up to 16414 conditions per place. [2025-04-14 01:13:02,190 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1229 selfloop transitions, 264 changer transitions 1/1494 dead transitions. [2025-04-14 01:13:02,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 1494 transitions, 26329 flow [2025-04-14 01:13:02,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 01:13:02,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 01:13:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 146 transitions. [2025-04-14 01:13:02,191 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32589285714285715 [2025-04-14 01:13:02,191 INFO L175 Difference]: Start difference. First operand has 322 places, 1451 transitions, 23046 flow. Second operand 14 states and 146 transitions. [2025-04-14 01:13:02,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 1494 transitions, 26329 flow [2025-04-14 01:13:05,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 1494 transitions, 26140 flow, removed 65 selfloop flow, removed 4 redundant places. [2025-04-14 01:13:05,181 INFO L231 Difference]: Finished difference. Result has 334 places, 1459 transitions, 23543 flow [2025-04-14 01:13:05,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=22857, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=257, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=23543, PETRI_PLACES=334, PETRI_TRANSITIONS=1459} [2025-04-14 01:13:05,184 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 303 predicate places. [2025-04-14 01:13:05,184 INFO L485 AbstractCegarLoop]: Abstraction has has 334 places, 1459 transitions, 23543 flow [2025-04-14 01:13:05,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:13:05,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:13:05,184 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] [2025-04-14 01:13:05,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-14 01:13:05,385 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,SelfDestructingSolverStorable13 [2025-04-14 01:13:05,385 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:13:05,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:13:05,386 INFO L85 PathProgramCache]: Analyzing trace with hash 591808942, now seen corresponding path program 12 times [2025-04-14 01:13:05,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:13:05,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168819228] [2025-04-14 01:13:05,386 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:13:05,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:13:05,391 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:13:05,403 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:13:05,403 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:13:05,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:13:05,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:13:05,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168819228] [2025-04-14 01:13:05,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168819228] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:13:05,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115215647] [2025-04-14 01:13:05,781 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:13:05,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:13:05,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:13:05,784 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-14 01:13:05,785 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-14 01:13:05,832 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:13:05,852 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:13:05,852 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:13:05,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:05,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:13:05,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:13:06,013 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:13:06,013 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 27 treesize of output 19 [2025-04-14 01:13:06,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:13:06,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:13:06,097 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:13:06,098 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 41 treesize of output 86 [2025-04-14 01:13:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:13:06,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115215647] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:13:06,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:13:06,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 16 [2025-04-14 01:13:06,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590284505] [2025-04-14 01:13:06,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:13:06,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:13:06,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:13:06,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:13:06,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:13:06,240 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:13:06,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 1459 transitions, 23543 flow. Second operand has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:13:06,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:13:06,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:13:06,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:13:11,203 INFO L116 PetriNetUnfolderBase]: 13332/18734 cut-off events. [2025-04-14 01:13:11,203 INFO L117 PetriNetUnfolderBase]: For 198929/198929 co-relation queries the response was YES. [2025-04-14 01:13:11,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139138 conditions, 18734 events. 13332/18734 cut-off events. For 198929/198929 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 107843 event pairs, 1699 based on Foata normal form. 1/15643 useless extension candidates. Maximal degree in co-relation 138796. Up to 13917 conditions per place. [2025-04-14 01:13:11,964 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 844 selfloop transitions, 838 changer transitions 1/1683 dead transitions. [2025-04-14 01:13:11,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 1683 transitions, 29734 flow [2025-04-14 01:13:11,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-14 01:13:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-14 01:13:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 311 transitions. [2025-04-14 01:13:11,966 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33512931034482757 [2025-04-14 01:13:11,966 INFO L175 Difference]: Start difference. First operand has 334 places, 1459 transitions, 23543 flow. Second operand 29 states and 311 transitions. [2025-04-14 01:13:11,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 1683 transitions, 29734 flow [2025-04-14 01:13:15,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 1683 transitions, 29366 flow, removed 21 selfloop flow, removed 9 redundant places. [2025-04-14 01:13:15,185 INFO L231 Difference]: Finished difference. Result has 359 places, 1585 transitions, 27770 flow [2025-04-14 01:13:15,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=23186, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=722, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=27770, PETRI_PLACES=359, PETRI_TRANSITIONS=1585} [2025-04-14 01:13:15,186 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 328 predicate places. [2025-04-14 01:13:15,186 INFO L485 AbstractCegarLoop]: Abstraction has has 359 places, 1585 transitions, 27770 flow [2025-04-14 01:13:15,186 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:13:15,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:13:15,187 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] [2025-04-14 01:13:15,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-14 01:13:15,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-14 01:13:15,387 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:13:15,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:13:15,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1011848082, now seen corresponding path program 13 times [2025-04-14 01:13:15,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:13:15,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967377067] [2025-04-14 01:13:15,388 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:13:15,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:13:15,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:13:15,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:13:15,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:13:15,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:13:15,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:13:15,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967377067] [2025-04-14 01:13:15,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967377067] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:13:15,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098734310] [2025-04-14 01:13:15,710 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:13:15,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:13:15,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:13:15,713 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-14 01:13:15,714 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-14 01:13:15,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:13:15,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:13:15,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:13:15,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:15,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-14 01:13:15,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:13:15,793 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-14 01:13:15,814 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:13:15,835 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:13:15,835 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 01:13:15,860 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:13:15,998 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-14 01:13:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:13:16,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:13:16,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:13:16,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098734310] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:13:16,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:13:16,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 25 [2025-04-14 01:13:16,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335829418] [2025-04-14 01:13:16,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:13:16,169 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 01:13:16,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:13:16,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 01:13:16,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2025-04-14 01:13:16,170 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:13:16,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 1585 transitions, 27770 flow. Second operand has 27 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:13:16,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:13:16,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:13:16,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:13:21,086 INFO L116 PetriNetUnfolderBase]: 13946/19651 cut-off events. [2025-04-14 01:13:21,086 INFO L117 PetriNetUnfolderBase]: For 250502/250502 co-relation queries the response was YES. [2025-04-14 01:13:21,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154360 conditions, 19651 events. 13946/19651 cut-off events. For 250502/250502 co-relation queries the response was YES. Maximal size of possible extension queue 1194. Compared 114906 event pairs, 2537 based on Foata normal form. 2/16338 useless extension candidates. Maximal degree in co-relation 153966. Up to 16027 conditions per place. [2025-04-14 01:13:21,296 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1063 selfloop transitions, 688 changer transitions 2/1753 dead transitions. [2025-04-14 01:13:21,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 1753 transitions, 33394 flow [2025-04-14 01:13:21,296 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 01:13:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 01:13:21,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 211 transitions. [2025-04-14 01:13:21,297 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3296875 [2025-04-14 01:13:21,297 INFO L175 Difference]: Start difference. First operand has 359 places, 1585 transitions, 27770 flow. Second operand 20 states and 211 transitions. [2025-04-14 01:13:21,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 1753 transitions, 33394 flow [2025-04-14 01:13:25,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 1753 transitions, 32576 flow, removed 193 selfloop flow, removed 11 redundant places. [2025-04-14 01:13:25,801 INFO L231 Difference]: Finished difference. Result has 376 places, 1674 transitions, 30450 flow [2025-04-14 01:13:25,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=27011, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=602, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=928, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=30450, PETRI_PLACES=376, PETRI_TRANSITIONS=1674} [2025-04-14 01:13:25,803 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 345 predicate places. [2025-04-14 01:13:25,803 INFO L485 AbstractCegarLoop]: Abstraction has has 376 places, 1674 transitions, 30450 flow [2025-04-14 01:13:25,803 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:13:25,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:13:25,803 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] [2025-04-14 01:13:25,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-14 01:13:26,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:13:26,004 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:13:26,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:13:26,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1958882920, now seen corresponding path program 14 times [2025-04-14 01:13:26,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:13:26,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407885084] [2025-04-14 01:13:26,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:13:26,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:13:26,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:13:26,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:13:26,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:13:26,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:13:26,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:13:26,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407885084] [2025-04-14 01:13:26,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407885084] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:13:26,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365611329] [2025-04-14 01:13:26,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:13:26,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:13:26,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:13:26,515 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:13:26,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-14 01:13:26,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:13:26,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:13:26,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:13:26,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:26,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:13:26,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:13:26,755 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:13:26,756 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 27 treesize of output 19 [2025-04-14 01:13:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:13:26,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:13:26,821 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:13:26,821 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 41 treesize of output 86 [2025-04-14 01:13:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:13:26,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365611329] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:13:26,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:13:26,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 6] total 23 [2025-04-14 01:13:26,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335067316] [2025-04-14 01:13:26,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:13:26,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 01:13:26,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:13:26,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 01:13:26,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2025-04-14 01:13:26,947 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:13:26,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 1674 transitions, 30450 flow. Second operand has 25 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:13:26,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:13:26,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:13:26,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:13:32,092 INFO L116 PetriNetUnfolderBase]: 13984/19714 cut-off events. [2025-04-14 01:13:32,093 INFO L117 PetriNetUnfolderBase]: For 239323/239323 co-relation queries the response was YES. [2025-04-14 01:13:32,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159495 conditions, 19714 events. 13984/19714 cut-off events. For 239323/239323 co-relation queries the response was YES. Maximal size of possible extension queue 1191. Compared 115446 event pairs, 3274 based on Foata normal form. 1/16388 useless extension candidates. Maximal degree in co-relation 159210. Up to 18842 conditions per place. [2025-04-14 01:13:32,448 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 1459 selfloop transitions, 248 changer transitions 1/1708 dead transitions. [2025-04-14 01:13:32,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 1708 transitions, 34118 flow [2025-04-14 01:13:32,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:13:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:13:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2025-04-14 01:13:32,449 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3177083333333333 [2025-04-14 01:13:32,449 INFO L175 Difference]: Start difference. First operand has 376 places, 1674 transitions, 30450 flow. Second operand 12 states and 122 transitions. [2025-04-14 01:13:32,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 1708 transitions, 34118 flow [2025-04-14 01:13:37,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 1708 transitions, 33714 flow, removed 129 selfloop flow, removed 4 redundant places. [2025-04-14 01:13:37,516 INFO L231 Difference]: Finished difference. Result has 385 places, 1680 transitions, 30683 flow [2025-04-14 01:13:37,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=30046, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=242, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=30683, PETRI_PLACES=385, PETRI_TRANSITIONS=1680} [2025-04-14 01:13:37,517 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 354 predicate places. [2025-04-14 01:13:37,517 INFO L485 AbstractCegarLoop]: Abstraction has has 385 places, 1680 transitions, 30683 flow [2025-04-14 01:13:37,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:13:37,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:13:37,517 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] [2025-04-14 01:13:37,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-14 01:13:37,718 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-14 01:13:37,718 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:13:37,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:13:37,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1452849424, now seen corresponding path program 15 times [2025-04-14 01:13:37,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:13:37,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101807152] [2025-04-14 01:13:37,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:13:37,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:13:37,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:13:37,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:13:37,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:13:37,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:13:38,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:13:38,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101807152] [2025-04-14 01:13:38,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101807152] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:13:38,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093105031] [2025-04-14 01:13:38,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:13:38,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:13:38,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:13:38,027 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:13:38,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-14 01:13:38,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:13:38,091 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:13:38,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:13:38,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:38,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:13:38,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:13:38,189 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:13:38,190 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 27 treesize of output 19 [2025-04-14 01:13:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:13:38,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:13:38,250 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:13:38,251 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 33 treesize of output 78 [2025-04-14 01:13:38,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:13:38,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093105031] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:13:38,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:13:38,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 16 [2025-04-14 01:13:38,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917949176] [2025-04-14 01:13:38,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:13:38,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:13:38,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:13:38,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:13:38,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:13:38,348 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:13:38,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 1680 transitions, 30683 flow. Second operand has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:13:38,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:13:38,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:13:38,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:13:43,376 INFO L116 PetriNetUnfolderBase]: 14036/19799 cut-off events. [2025-04-14 01:13:43,377 INFO L117 PetriNetUnfolderBase]: For 243350/243350 co-relation queries the response was YES. [2025-04-14 01:13:43,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160416 conditions, 19799 events. 14036/19799 cut-off events. For 243350/243350 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 116156 event pairs, 3270 based on Foata normal form. 1/16457 useless extension candidates. Maximal degree in co-relation 160127. Up to 18903 conditions per place. [2025-04-14 01:13:43,624 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 1451 selfloop transitions, 268 changer transitions 1/1720 dead transitions. [2025-04-14 01:13:43,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 1720 transitions, 34396 flow [2025-04-14 01:13:43,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:13:43,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:13:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 130 transitions. [2025-04-14 01:13:43,625 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-04-14 01:13:43,625 INFO L175 Difference]: Start difference. First operand has 385 places, 1680 transitions, 30683 flow. Second operand 13 states and 130 transitions. [2025-04-14 01:13:43,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 1720 transitions, 34396 flow [2025-04-14 01:13:48,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 1720 transitions, 34059 flow, removed 31 selfloop flow, removed 9 redundant places. [2025-04-14 01:13:48,322 INFO L231 Difference]: Finished difference. Result has 390 places, 1692 transitions, 31059 flow [2025-04-14 01:13:48,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=30346, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=257, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=31059, PETRI_PLACES=390, PETRI_TRANSITIONS=1692} [2025-04-14 01:13:48,323 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 359 predicate places. [2025-04-14 01:13:48,324 INFO L485 AbstractCegarLoop]: Abstraction has has 390 places, 1692 transitions, 31059 flow [2025-04-14 01:13:48,324 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:13:48,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:13:48,324 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] [2025-04-14 01:13:48,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-14 01:13:48,524 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-14 01:13:48,525 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:13:48,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:13:48,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1128378414, now seen corresponding path program 16 times [2025-04-14 01:13:48,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:13:48,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651460840] [2025-04-14 01:13:48,525 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:13:48,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:13:48,534 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:13:48,547 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:13:48,547 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:13:48,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:13:48,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:13:48,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651460840] [2025-04-14 01:13:48,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651460840] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:13:48,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553896729] [2025-04-14 01:13:48,845 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:13:48,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:13:48,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:13:48,846 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:13:48,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-14 01:13:48,894 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:13:48,914 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:13:48,914 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:13:48,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:48,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-14 01:13:48,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:13:48,919 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-14 01:13:48,938 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:13:48,956 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:13:48,956 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 01:13:48,973 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:13:49,163 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-14 01:13:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:13:49,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:13:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:13:49,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553896729] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:13:49,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:13:49,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 24 [2025-04-14 01:13:49,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999451002] [2025-04-14 01:13:49,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:13:49,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 01:13:49,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:13:49,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 01:13:49,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2025-04-14 01:13:49,294 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:13:49,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 1692 transitions, 31059 flow. Second operand has 26 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 26 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:13:49,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:13:49,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:13:49,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:13:55,436 INFO L116 PetriNetUnfolderBase]: 14234/20148 cut-off events. [2025-04-14 01:13:55,436 INFO L117 PetriNetUnfolderBase]: For 262193/262193 co-relation queries the response was YES. [2025-04-14 01:13:55,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164030 conditions, 20148 events. 14234/20148 cut-off events. For 262193/262193 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 119599 event pairs, 2951 based on Foata normal form. 2/16788 useless extension candidates. Maximal degree in co-relation 163741. Up to 17640 conditions per place. [2025-04-14 01:13:55,890 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1160 selfloop transitions, 700 changer transitions 3/1863 dead transitions. [2025-04-14 01:13:55,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 1863 transitions, 37212 flow [2025-04-14 01:13:55,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 01:13:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-14 01:13:55,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 247 transitions. [2025-04-14 01:13:55,892 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.296875 [2025-04-14 01:13:55,892 INFO L175 Difference]: Start difference. First operand has 390 places, 1692 transitions, 31059 flow. Second operand 26 states and 247 transitions. [2025-04-14 01:13:55,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 1863 transitions, 37212 flow [2025-04-14 01:14:00,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 1863 transitions, 36879 flow, removed 30 selfloop flow, removed 6 redundant places. [2025-04-14 01:14:00,886 INFO L231 Difference]: Finished difference. Result has 416 places, 1804 transitions, 34972 flow [2025-04-14 01:14:00,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=30747, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=607, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1039, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=34972, PETRI_PLACES=416, PETRI_TRANSITIONS=1804} [2025-04-14 01:14:00,888 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 385 predicate places. [2025-04-14 01:14:00,888 INFO L485 AbstractCegarLoop]: Abstraction has has 416 places, 1804 transitions, 34972 flow [2025-04-14 01:14:00,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 26 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:14:00,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:14:00,889 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] [2025-04-14 01:14:00,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-14 01:14:01,092 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:14:01,093 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:14:01,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:14:01,094 INFO L85 PathProgramCache]: Analyzing trace with hash -655008208, now seen corresponding path program 17 times [2025-04-14 01:14:01,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:14:01,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822894867] [2025-04-14 01:14:01,094 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:14:01,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:14:01,102 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:14:01,112 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:14:01,112 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:14:01,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:14:01,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:14:01,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:14:01,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822894867] [2025-04-14 01:14:01,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822894867] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:14:01,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564709166] [2025-04-14 01:14:01,470 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:14:01,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:14:01,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:14:01,472 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:14:01,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-14 01:14:01,523 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:14:01,539 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:14:01,540 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:14:01,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:14:01,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 01:14:01,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:14:01,566 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:14:01,697 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:14:01,698 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 33 treesize of output 81 [2025-04-14 01:14:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:14:01,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:14:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:14:01,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564709166] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:14:01,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:14:01,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 6] total 19 [2025-04-14 01:14:01,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469527307] [2025-04-14 01:14:01,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:14:01,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 01:14:01,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:14:01,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 01:14:01,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-04-14 01:14:01,828 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:14:01,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 1804 transitions, 34972 flow. Second operand has 21 states, 21 states have (on average 5.571428571428571) internal successors, (117), 21 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:14:01,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:14:01,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:14:01,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:14:09,570 INFO L116 PetriNetUnfolderBase]: 16325/23110 cut-off events. [2025-04-14 01:14:09,570 INFO L117 PetriNetUnfolderBase]: For 339567/339567 co-relation queries the response was YES. [2025-04-14 01:14:09,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193524 conditions, 23110 events. 16325/23110 cut-off events. For 339567/339567 co-relation queries the response was YES. Maximal size of possible extension queue 1347. Compared 139934 event pairs, 1665 based on Foata normal form. 1/19493 useless extension candidates. Maximal degree in co-relation 193207. Up to 13981 conditions per place. [2025-04-14 01:14:09,883 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 848 selfloop transitions, 1342 changer transitions 1/2191 dead transitions. [2025-04-14 01:14:09,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 2191 transitions, 45217 flow [2025-04-14 01:14:09,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-14 01:14:09,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-04-14 01:14:09,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 466 transitions. [2025-04-14 01:14:09,885 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34672619047619047 [2025-04-14 01:14:09,885 INFO L175 Difference]: Start difference. First operand has 416 places, 1804 transitions, 34972 flow. Second operand 42 states and 466 transitions. [2025-04-14 01:14:09,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 2191 transitions, 45217 flow [2025-04-14 01:14:16,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 2191 transitions, 44346 flow, removed 193 selfloop flow, removed 13 redundant places. [2025-04-14 01:14:16,360 INFO L231 Difference]: Finished difference. Result has 455 places, 2033 transitions, 42677 flow [2025-04-14 01:14:16,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=34185, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=42677, PETRI_PLACES=455, PETRI_TRANSITIONS=2033} [2025-04-14 01:14:16,362 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 424 predicate places. [2025-04-14 01:14:16,362 INFO L485 AbstractCegarLoop]: Abstraction has has 455 places, 2033 transitions, 42677 flow [2025-04-14 01:14:16,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.571428571428571) internal successors, (117), 21 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:14:16,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:14:16,362 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] [2025-04-14 01:14:16,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-14 01:14:16,563 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:14:16,563 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:14:16,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:14:16,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1997689460, now seen corresponding path program 18 times [2025-04-14 01:14:16,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:14:16,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670695011] [2025-04-14 01:14:16,564 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:14:16,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:14:16,568 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:14:16,576 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:14:16,576 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:14:16,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:14:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:14:16,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:14:16,847 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670695011] [2025-04-14 01:14:16,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670695011] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:14:16,847 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785518879] [2025-04-14 01:14:16,847 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:14:16,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:14:16,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:14:16,849 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:14:16,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-14 01:14:16,908 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:14:16,928 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:14:16,928 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:14:16,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:14:16,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:14:16,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:14:17,089 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:14:17,090 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 27 treesize of output 19 [2025-04-14 01:14:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:14:17,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:14:17,195 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:14:17,195 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 33 treesize of output 78 [2025-04-14 01:14:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:14:17,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785518879] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:14:17,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:14:17,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 18 [2025-04-14 01:14:17,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774221040] [2025-04-14 01:14:17,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:14:17,300 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 01:14:17,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:14:17,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 01:14:17,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-04-14 01:14:17,301 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:14:17,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 2033 transitions, 42677 flow. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:14:17,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:14:17,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:14:17,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:14:25,744 INFO L116 PetriNetUnfolderBase]: 16799/23825 cut-off events. [2025-04-14 01:14:25,744 INFO L117 PetriNetUnfolderBase]: For 384982/384982 co-relation queries the response was YES. [2025-04-14 01:14:25,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212573 conditions, 23825 events. 16799/23825 cut-off events. For 384982/384982 co-relation queries the response was YES. Maximal size of possible extension queue 1377. Compared 145329 event pairs, 1577 based on Foata normal form. 1/20156 useless extension candidates. Maximal degree in co-relation 212244. Up to 12494 conditions per place. [2025-04-14 01:14:26,045 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 600 selfloop transitions, 1712 changer transitions 2/2314 dead transitions. [2025-04-14 01:14:26,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 2314 transitions, 52038 flow [2025-04-14 01:14:26,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 01:14:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-04-14 01:14:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 391 transitions. [2025-04-14 01:14:26,047 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3302364864864865 [2025-04-14 01:14:26,047 INFO L175 Difference]: Start difference. First operand has 455 places, 2033 transitions, 42677 flow. Second operand 37 states and 391 transitions. [2025-04-14 01:14:26,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 2314 transitions, 52038 flow [2025-04-14 01:14:34,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 2314 transitions, 51032 flow, removed 263 selfloop flow, removed 10 redundant places. [2025-04-14 01:14:34,297 INFO L231 Difference]: Finished difference. Result has 489 places, 2199 transitions, 49774 flow [2025-04-14 01:14:34,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=41784, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2033, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1553, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=49774, PETRI_PLACES=489, PETRI_TRANSITIONS=2199} [2025-04-14 01:14:34,299 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 458 predicate places. [2025-04-14 01:14:34,299 INFO L485 AbstractCegarLoop]: Abstraction has has 489 places, 2199 transitions, 49774 flow [2025-04-14 01:14:34,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:14:34,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:14:34,299 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] [2025-04-14 01:14:34,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-14 01:14:34,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:14:34,500 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:14:34,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:14:34,501 INFO L85 PathProgramCache]: Analyzing trace with hash 440156892, now seen corresponding path program 19 times [2025-04-14 01:14:34,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:14:34,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576464274] [2025-04-14 01:14:34,501 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:14:34,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:14:34,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:14:34,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:14:34,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:14:34,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:14:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:14:34,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:14:34,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576464274] [2025-04-14 01:14:34,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576464274] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:14:34,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45353214] [2025-04-14 01:14:34,779 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:14:34,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:14:34,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:14:34,781 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:14:34,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-14 01:14:34,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:14:34,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:14:34,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:14:34,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:14:34,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-14 01:14:34,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:14:34,851 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-14 01:14:34,867 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:14:34,883 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:14:34,883 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 01:14:34,895 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:14:35,020 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-14 01:14:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:14:35,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:14:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:14:35,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45353214] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:14:35,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:14:35,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 25 [2025-04-14 01:14:35,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839485812] [2025-04-14 01:14:35,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:14:35,151 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 01:14:35,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:14:35,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 01:14:35,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2025-04-14 01:14:35,152 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:14:35,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 2199 transitions, 49774 flow. Second operand has 27 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:14:35,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:14:35,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:14:35,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:14:43,283 INFO L116 PetriNetUnfolderBase]: 16861/23933 cut-off events. [2025-04-14 01:14:43,283 INFO L117 PetriNetUnfolderBase]: For 419110/419110 co-relation queries the response was YES. [2025-04-14 01:14:43,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223341 conditions, 23933 events. 16861/23933 cut-off events. For 419110/419110 co-relation queries the response was YES. Maximal size of possible extension queue 1411. Compared 146486 event pairs, 3102 based on Foata normal form. 2/20253 useless extension candidates. Maximal degree in co-relation 223012. Up to 20111 conditions per place. [2025-04-14 01:14:44,172 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1426 selfloop transitions, 860 changer transitions 2/2288 dead transitions. [2025-04-14 01:14:44,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 2288 transitions, 55526 flow [2025-04-14 01:14:44,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 01:14:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 01:14:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 209 transitions. [2025-04-14 01:14:44,173 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3265625 [2025-04-14 01:14:44,173 INFO L175 Difference]: Start difference. First operand has 489 places, 2199 transitions, 49774 flow. Second operand 20 states and 209 transitions. [2025-04-14 01:14:44,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 2288 transitions, 55526 flow [2025-04-14 01:14:51,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 2288 transitions, 53749 flow, removed 252 selfloop flow, removed 7 redundant places. [2025-04-14 01:14:51,995 INFO L231 Difference]: Finished difference. Result has 505 places, 2216 transitions, 50157 flow [2025-04-14 01:14:51,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=48028, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=845, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=50157, PETRI_PLACES=505, PETRI_TRANSITIONS=2216} [2025-04-14 01:14:51,997 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 474 predicate places. [2025-04-14 01:14:51,997 INFO L485 AbstractCegarLoop]: Abstraction has has 505 places, 2216 transitions, 50157 flow [2025-04-14 01:14:51,997 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:14:51,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:14:51,997 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] [2025-04-14 01:14:52,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-14 01:14:52,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-14 01:14:52,198 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:14:52,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:14:52,199 INFO L85 PathProgramCache]: Analyzing trace with hash -927229856, now seen corresponding path program 20 times [2025-04-14 01:14:52,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:14:52,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166471839] [2025-04-14 01:14:52,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:14:52,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:14:52,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:14:52,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:14:52,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:14:52,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:14:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:14:52,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:14:52,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166471839] [2025-04-14 01:14:52,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166471839] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:14:52,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410309300] [2025-04-14 01:14:52,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:14:52,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:14:52,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:14:52,534 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:14:52,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-14 01:14:52,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:14:52,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:14:52,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:14:52,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:14:52,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:14:52,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:14:52,750 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:14:52,750 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 27 treesize of output 19 [2025-04-14 01:14:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:14:52,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:14:52,845 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:14:52,845 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 33 treesize of output 78 [2025-04-14 01:14:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:14:52,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410309300] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:14:52,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:14:52,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 17 [2025-04-14 01:14:52,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629913098] [2025-04-14 01:14:52,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:14:52,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 01:14:52,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:14:52,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 01:14:52,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-04-14 01:14:52,952 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:14:52,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 2216 transitions, 50157 flow. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:14:52,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:14:52,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:14:52,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:03,225 INFO L116 PetriNetUnfolderBase]: 18302/25908 cut-off events. [2025-04-14 01:15:03,225 INFO L117 PetriNetUnfolderBase]: For 443759/443759 co-relation queries the response was YES. [2025-04-14 01:15:04,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242791 conditions, 25908 events. 18302/25908 cut-off events. For 443759/443759 co-relation queries the response was YES. Maximal size of possible extension queue 1504. Compared 159921 event pairs, 1801 based on Foata normal form. 1/21831 useless extension candidates. Maximal degree in co-relation 242448. Up to 15893 conditions per place. [2025-04-14 01:15:04,330 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 945 selfloop transitions, 1586 changer transitions 1/2532 dead transitions. [2025-04-14 01:15:04,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 2532 transitions, 60074 flow [2025-04-14 01:15:04,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-14 01:15:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-04-14 01:15:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 464 transitions. [2025-04-14 01:15:04,333 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3372093023255814 [2025-04-14 01:15:04,333 INFO L175 Difference]: Start difference. First operand has 505 places, 2216 transitions, 50157 flow. Second operand 43 states and 464 transitions. [2025-04-14 01:15:04,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 2532 transitions, 60074 flow [2025-04-14 01:15:13,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 2532 transitions, 59080 flow, removed 55 selfloop flow, removed 12 redundant places. [2025-04-14 01:15:13,380 INFO L231 Difference]: Finished difference. Result has 543 places, 2361 transitions, 57115 flow [2025-04-14 01:15:13,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=49194, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1441, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=57115, PETRI_PLACES=543, PETRI_TRANSITIONS=2361} [2025-04-14 01:15:13,383 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 512 predicate places. [2025-04-14 01:15:13,383 INFO L485 AbstractCegarLoop]: Abstraction has has 543 places, 2361 transitions, 57115 flow [2025-04-14 01:15:13,383 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:13,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:13,383 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] [2025-04-14 01:15:13,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-14 01:15:13,583 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-14 01:15:13,584 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:15:13,584 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:13,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1983899394, now seen corresponding path program 21 times [2025-04-14 01:15:13,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:13,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343568564] [2025-04-14 01:15:13,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:15:13,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:13,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:15:13,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:15:13,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:15:13,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:13,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:15:13,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:13,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343568564] [2025-04-14 01:15:13,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343568564] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:15:13,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146308463] [2025-04-14 01:15:13,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:15:13,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:15:13,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:15:13,852 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:15:13,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-14 01:15:13,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:15:13,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:15:13,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:15:13,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:13,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:15:13,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:15:14,055 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:15:14,055 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 27 treesize of output 19 [2025-04-14 01:15:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:15:14,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:15:14,149 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:15:14,150 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 33 treesize of output 78 [2025-04-14 01:15:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:15:14,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146308463] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:15:14,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:15:14,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 18 [2025-04-14 01:15:14,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195447213] [2025-04-14 01:15:14,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:15:14,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 01:15:14,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:14,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 01:15:14,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-04-14 01:15:14,248 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:15:14,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 2361 transitions, 57115 flow. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:14,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:14,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:15:14,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:24,031 INFO L116 PetriNetUnfolderBase]: 18506/26309 cut-off events. [2025-04-14 01:15:24,031 INFO L117 PetriNetUnfolderBase]: For 476695/476695 co-relation queries the response was YES. [2025-04-14 01:15:24,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258351 conditions, 26309 events. 18506/26309 cut-off events. For 476695/476695 co-relation queries the response was YES. Maximal size of possible extension queue 1592. Compared 163603 event pairs, 3209 based on Foata normal form. 1/22199 useless extension candidates. Maximal degree in co-relation 257996. Up to 20205 conditions per place. [2025-04-14 01:15:24,478 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1185 selfloop transitions, 1316 changer transitions 2/2503 dead transitions. [2025-04-14 01:15:24,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 2503 transitions, 64140 flow [2025-04-14 01:15:24,478 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 01:15:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 01:15:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 270 transitions. [2025-04-14 01:15:24,479 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3375 [2025-04-14 01:15:24,479 INFO L175 Difference]: Start difference. First operand has 543 places, 2361 transitions, 57115 flow. Second operand 25 states and 270 transitions. [2025-04-14 01:15:24,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 2503 transitions, 64140 flow [2025-04-14 01:15:34,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 2503 transitions, 63630 flow, removed 92 selfloop flow, removed 14 redundant places. [2025-04-14 01:15:34,790 INFO L231 Difference]: Finished difference. Result has 561 places, 2436 transitions, 61928 flow [2025-04-14 01:15:34,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=56612, PETRI_DIFFERENCE_MINUEND_PLACES=529, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1241, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1055, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=61928, PETRI_PLACES=561, PETRI_TRANSITIONS=2436} [2025-04-14 01:15:34,793 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 530 predicate places. [2025-04-14 01:15:34,793 INFO L485 AbstractCegarLoop]: Abstraction has has 561 places, 2436 transitions, 61928 flow [2025-04-14 01:15:34,793 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:34,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:34,793 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] [2025-04-14 01:15:34,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-14 01:15:34,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:15:34,994 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:15:34,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:34,995 INFO L85 PathProgramCache]: Analyzing trace with hash 494246136, now seen corresponding path program 22 times [2025-04-14 01:15:34,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:34,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873211023] [2025-04-14 01:15:34,995 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:15:34,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:35,000 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:15:35,009 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:15:35,009 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:15:35,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:15:35,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:35,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873211023] [2025-04-14 01:15:35,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873211023] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:15:35,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351625050] [2025-04-14 01:15:35,432 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:15:35,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:15:35,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:15:35,434 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:15:35,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-14 01:15:35,494 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:15:35,515 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:15:35,515 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:15:35,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:35,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-14 01:15:35,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:15:35,529 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-14 01:15:35,551 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:15:35,572 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:15:35,573 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 01:15:35,593 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:15:35,724 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-14 01:15:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:15:35,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:15:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:15:35,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351625050] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:15:35,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:15:35,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 25 [2025-04-14 01:15:35,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161048204] [2025-04-14 01:15:35,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:15:35,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 01:15:35,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:35,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 01:15:35,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2025-04-14 01:15:35,880 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:15:35,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 2436 transitions, 61928 flow. Second operand has 27 states, 27 states have (on average 5.111111111111111) internal successors, (138), 27 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-14 01:15:35,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:35,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:15:35,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:47,909 INFO L116 PetriNetUnfolderBase]: 19055/27223 cut-off events. [2025-04-14 01:15:47,910 INFO L117 PetriNetUnfolderBase]: For 541610/541610 co-relation queries the response was YES. [2025-04-14 01:15:48,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276263 conditions, 27223 events. 19055/27223 cut-off events. For 541610/541610 co-relation queries the response was YES. Maximal size of possible extension queue 1637. Compared 172712 event pairs, 3243 based on Foata normal form. 8/23026 useless extension candidates. Maximal degree in co-relation 275904. Up to 21888 conditions per place. [2025-04-14 01:15:48,437 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 1555 selfloop transitions, 1153 changer transitions 2/2710 dead transitions. [2025-04-14 01:15:48,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 2710 transitions, 71479 flow [2025-04-14 01:15:48,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-14 01:15:48,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2025-04-14 01:15:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 551 transitions. [2025-04-14 01:15:48,439 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3248820754716981 [2025-04-14 01:15:48,439 INFO L175 Difference]: Start difference. First operand has 561 places, 2436 transitions, 61928 flow. Second operand 53 states and 551 transitions. [2025-04-14 01:15:48,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 2710 transitions, 71479 flow [2025-04-14 01:15:59,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 2710 transitions, 70500 flow, removed 106 selfloop flow, removed 11 redundant places. [2025-04-14 01:15:59,929 INFO L231 Difference]: Finished difference. Result has 609 places, 2554 transitions, 67030 flow [2025-04-14 01:15:59,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60990, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1040, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=67030, PETRI_PLACES=609, PETRI_TRANSITIONS=2554} [2025-04-14 01:15:59,932 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 578 predicate places. [2025-04-14 01:15:59,932 INFO L485 AbstractCegarLoop]: Abstraction has has 609 places, 2554 transitions, 67030 flow [2025-04-14 01:15:59,932 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.111111111111111) internal successors, (138), 27 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-14 01:15:59,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:59,932 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] [2025-04-14 01:15:59,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-14 01:16:00,133 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:16:00,133 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:16:00,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:00,134 INFO L85 PathProgramCache]: Analyzing trace with hash 98564303, now seen corresponding path program 23 times [2025-04-14 01:16:00,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:00,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473347520] [2025-04-14 01:16:00,134 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:16:00,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:00,141 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:16:00,145 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:16:00,145 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:16:00,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:16:00,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:00,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473347520] [2025-04-14 01:16:00,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473347520] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:16:00,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408586748] [2025-04-14 01:16:00,186 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:16:00,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:16:00,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:16:00,188 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:16:00,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-14 01:16:00,248 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:16:00,268 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:16:00,269 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:16:00,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:00,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:16:00,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:16:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:16:00,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:16:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:16:00,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408586748] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:16:00,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:16:00,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 01:16:00,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516556244] [2025-04-14 01:16:00,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:16:00,328 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:16:00,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:00,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:16:00,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:16:00,329 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:16:00,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 2554 transitions, 67030 flow. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:16:00,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:00,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:16:00,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:16,745 INFO L116 PetriNetUnfolderBase]: 27247/39325 cut-off events. [2025-04-14 01:16:16,745 INFO L117 PetriNetUnfolderBase]: For 776315/776315 co-relation queries the response was YES. [2025-04-14 01:16:18,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405128 conditions, 39325 events. 27247/39325 cut-off events. For 776315/776315 co-relation queries the response was YES. Maximal size of possible extension queue 2014. Compared 262168 event pairs, 11383 based on Foata normal form. 0/33568 useless extension candidates. Maximal degree in co-relation 404569. Up to 21908 conditions per place. [2025-04-14 01:16:18,471 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 3595 selfloop transitions, 10 changer transitions 0/3605 dead transitions. [2025-04-14 01:16:18,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 3605 transitions, 99270 flow [2025-04-14 01:16:18,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:16:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:16:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2025-04-14 01:16:18,472 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35267857142857145 [2025-04-14 01:16:18,473 INFO L175 Difference]: Start difference. First operand has 609 places, 2554 transitions, 67030 flow. Second operand 7 states and 79 transitions. [2025-04-14 01:16:18,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 3605 transitions, 99270 flow [2025-04-14 01:16:41,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 3605 transitions, 97873 flow, removed 57 selfloop flow, removed 17 redundant places. [2025-04-14 01:16:41,310 INFO L231 Difference]: Finished difference. Result has 598 places, 2556 transitions, 66034 flow [2025-04-14 01:16:41,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=65996, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=66034, PETRI_PLACES=598, PETRI_TRANSITIONS=2556} [2025-04-14 01:16:41,312 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 567 predicate places. [2025-04-14 01:16:41,312 INFO L485 AbstractCegarLoop]: Abstraction has has 598 places, 2556 transitions, 66034 flow [2025-04-14 01:16:41,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:16:41,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:16:41,312 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] [2025-04-14 01:16:41,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-14 01:16:41,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-14 01:16:41,513 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:16:41,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:41,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1151399781, now seen corresponding path program 24 times [2025-04-14 01:16:41,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:41,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22875327] [2025-04-14 01:16:41,514 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:16:41,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:41,520 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:16:41,525 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:16:41,525 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:16:41,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:41,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:16:41,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:41,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22875327] [2025-04-14 01:16:41,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22875327] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:16:41,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132447303] [2025-04-14 01:16:41,563 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:16:41,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:16:41,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:16:41,565 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:16:41,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-14 01:16:41,620 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:16:41,637 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:16:41,637 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:16:41,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:41,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:16:41,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:16:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:16:41,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:16:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:16:41,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132447303] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:16:41,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:16:41,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-04-14 01:16:41,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578238716] [2025-04-14 01:16:41,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:16:41,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:16:41,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:41,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:16:41,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:16:41,685 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:16:41,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 2556 transitions, 66034 flow. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:16:41,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:41,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:16:41,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:00,548 INFO L116 PetriNetUnfolderBase]: 32439/46905 cut-off events. [2025-04-14 01:17:00,549 INFO L117 PetriNetUnfolderBase]: For 981413/981413 co-relation queries the response was YES. [2025-04-14 01:17:02,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480766 conditions, 46905 events. 32439/46905 cut-off events. For 981413/981413 co-relation queries the response was YES. Maximal size of possible extension queue 2580. Compared 328625 event pairs, 4875 based on Foata normal form. 0/39903 useless extension candidates. Maximal degree in co-relation 480208. Up to 18210 conditions per place. [2025-04-14 01:17:02,686 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 2979 selfloop transitions, 806 changer transitions 17/3802 dead transitions. [2025-04-14 01:17:02,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 3802 transitions, 101628 flow [2025-04-14 01:17:02,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:17:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:17:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions. [2025-04-14 01:17:02,688 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-04-14 01:17:02,688 INFO L175 Difference]: Start difference. First operand has 598 places, 2556 transitions, 66034 flow. Second operand 10 states and 152 transitions. [2025-04-14 01:17:02,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 3802 transitions, 101628 flow [2025-04-14 01:17:29,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 3802 transitions, 101608 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-14 01:17:29,578 INFO L231 Difference]: Finished difference. Result has 611 places, 2622 transitions, 70439 flow [2025-04-14 01:17:29,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=66014, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=740, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1766, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=70439, PETRI_PLACES=611, PETRI_TRANSITIONS=2622} [2025-04-14 01:17:29,581 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 580 predicate places. [2025-04-14 01:17:29,581 INFO L485 AbstractCegarLoop]: Abstraction has has 611 places, 2622 transitions, 70439 flow [2025-04-14 01:17:29,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:29,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:29,581 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] [2025-04-14 01:17:29,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-14 01:17:29,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-14 01:17:29,782 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:29,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash 463880411, now seen corresponding path program 25 times [2025-04-14 01:17:29,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:29,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806464444] [2025-04-14 01:17:29,782 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:17:29,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:29,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:17:29,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:17:29,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:17:29,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:29,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:29,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:29,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806464444] [2025-04-14 01:17:29,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806464444] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:17:29,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333004821] [2025-04-14 01:17:29,837 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:17:29,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:17:29,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:17:29,839 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:17:29,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-14 01:17:29,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:17:29,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:17:29,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:17:29,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:29,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:17:29,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:17:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:29,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:17:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:29,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333004821] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:17:29,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:17:29,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-14 01:17:29,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208699555] [2025-04-14 01:17:29,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:17:29,976 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 01:17:29,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:29,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 01:17:29,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:17:29,977 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:29,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 2622 transitions, 70439 flow. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:29,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:29,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:29,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:46,499 INFO L116 PetriNetUnfolderBase]: 26495/39033 cut-off events. [2025-04-14 01:17:46,500 INFO L117 PetriNetUnfolderBase]: For 894776/894776 co-relation queries the response was YES. [2025-04-14 01:17:47,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407150 conditions, 39033 events. 26495/39033 cut-off events. For 894776/894776 co-relation queries the response was YES. Maximal size of possible extension queue 1973. Compared 272331 event pairs, 8587 based on Foata normal form. 1568/34629 useless extension candidates. Maximal degree in co-relation 406581. Up to 21392 conditions per place. [2025-04-14 01:17:47,979 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 3456 selfloop transitions, 300 changer transitions 55/3811 dead transitions. [2025-04-14 01:17:47,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 3811 transitions, 105631 flow [2025-04-14 01:17:47,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:17:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:17:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2025-04-14 01:17:47,980 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2025-04-14 01:17:47,980 INFO L175 Difference]: Start difference. First operand has 611 places, 2622 transitions, 70439 flow. Second operand 9 states and 113 transitions. [2025-04-14 01:17:47,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 3811 transitions, 105631 flow [2025-04-14 01:18:13,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 3811 transitions, 103589 flow, removed 482 selfloop flow, removed 4 redundant places. [2025-04-14 01:18:13,993 INFO L231 Difference]: Finished difference. Result has 618 places, 2580 transitions, 69108 flow [2025-04-14 01:18:13,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=64444, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=69108, PETRI_PLACES=618, PETRI_TRANSITIONS=2580} [2025-04-14 01:18:13,996 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 587 predicate places. [2025-04-14 01:18:13,996 INFO L485 AbstractCegarLoop]: Abstraction has has 618 places, 2580 transitions, 69108 flow [2025-04-14 01:18:13,996 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:13,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:13,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:14,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-14 01:18:14,196 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-14 01:18:14,197 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:18:14,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:14,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1115251956, now seen corresponding path program 1 times [2025-04-14 01:18:14,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:14,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921095728] [2025-04-14 01:18:14,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:14,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:14,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:18:14,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:18:14,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:14,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:18:14,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:14,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921095728] [2025-04-14 01:18:14,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921095728] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:14,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546398326] [2025-04-14 01:18:14,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:14,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:14,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:14,256 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:18:14,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-14 01:18:14,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:18:14,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:18:14,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:14,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:14,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:18:14,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:14,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:18:14,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:18:14,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546398326] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:14,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:14,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-14 01:18:14,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810791965] [2025-04-14 01:18:14,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:14,406 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:14,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:14,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:14,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:14,407 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:14,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 2580 transitions, 69108 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:14,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:14,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:14,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:25,150 INFO L116 PetriNetUnfolderBase]: 15967/23593 cut-off events. [2025-04-14 01:18:25,150 INFO L117 PetriNetUnfolderBase]: For 535085/535085 co-relation queries the response was YES. [2025-04-14 01:18:25,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239857 conditions, 23593 events. 15967/23593 cut-off events. For 535085/535085 co-relation queries the response was YES. Maximal size of possible extension queue 1383. Compared 154361 event pairs, 6612 based on Foata normal form. 184/20327 useless extension candidates. Maximal degree in co-relation 239551. Up to 19420 conditions per place. [2025-04-14 01:18:25,585 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1882 selfloop transitions, 41 changer transitions 24/1947 dead transitions. [2025-04-14 01:18:25,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 1947 transitions, 51069 flow [2025-04-14 01:18:25,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:18:25,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:18:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2025-04-14 01:18:25,586 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.359375 [2025-04-14 01:18:25,586 INFO L175 Difference]: Start difference. First operand has 618 places, 2580 transitions, 69108 flow. Second operand 8 states and 92 transitions. [2025-04-14 01:18:25,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 1947 transitions, 51069 flow [2025-04-14 01:18:36,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 1947 transitions, 49288 flow, removed 566 selfloop flow, removed 32 redundant places. [2025-04-14 01:18:36,286 INFO L231 Difference]: Finished difference. Result has 543 places, 1802 transitions, 43614 flow [2025-04-14 01:18:36,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=43447, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1754, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=43614, PETRI_PLACES=543, PETRI_TRANSITIONS=1802} [2025-04-14 01:18:36,288 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 512 predicate places. [2025-04-14 01:18:36,288 INFO L485 AbstractCegarLoop]: Abstraction has has 543 places, 1802 transitions, 43614 flow [2025-04-14 01:18:36,288 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:36,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:36,288 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] [2025-04-14 01:18:36,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-14 01:18:36,489 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-14 01:18:36,489 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:18:36,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:36,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2097469568, now seen corresponding path program 26 times [2025-04-14 01:18:36,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:36,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940313733] [2025-04-14 01:18:36,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:18:36,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:36,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 01:18:36,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:18:36,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:36,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:18:36,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:36,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940313733] [2025-04-14 01:18:36,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940313733] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:36,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832372079] [2025-04-14 01:18:36,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:18:36,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:36,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:36,556 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:18:36,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-14 01:18:36,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 01:18:36,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:18:36,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:36,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:36,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:18:36,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:18:36,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:18:36,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832372079] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:36,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:18:36,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-04-14 01:18:36,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269357214] [2025-04-14 01:18:36,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:36,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:18:36,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:36,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:18:36,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-04-14 01:18:36,723 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:36,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 1802 transitions, 43614 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:36,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:36,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:36,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:45,267 INFO L116 PetriNetUnfolderBase]: 17150/25591 cut-off events. [2025-04-14 01:18:45,267 INFO L117 PetriNetUnfolderBase]: For 474178/474178 co-relation queries the response was YES. [2025-04-14 01:18:45,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246294 conditions, 25591 events. 17150/25591 cut-off events. For 474178/474178 co-relation queries the response was YES. Maximal size of possible extension queue 1390. Compared 171283 event pairs, 3983 based on Foata normal form. 20/22114 useless extension candidates. Maximal degree in co-relation 245847. Up to 14447 conditions per place. [2025-04-14 01:18:45,974 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 1939 selfloop transitions, 330 changer transitions 14/2283 dead transitions. [2025-04-14 01:18:45,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 2283 transitions, 58073 flow [2025-04-14 01:18:45,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:18:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:18:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2025-04-14 01:18:45,975 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45089285714285715 [2025-04-14 01:18:45,975 INFO L175 Difference]: Start difference. First operand has 543 places, 1802 transitions, 43614 flow. Second operand 7 states and 101 transitions. [2025-04-14 01:18:45,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 2283 transitions, 58073 flow [2025-04-14 01:18:54,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 2283 transitions, 57815 flow, removed 109 selfloop flow, removed 8 redundant places. [2025-04-14 01:18:54,451 INFO L231 Difference]: Finished difference. Result has 544 places, 1873 transitions, 46137 flow [2025-04-14 01:18:54,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=42992, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1782, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=240, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=46137, PETRI_PLACES=544, PETRI_TRANSITIONS=1873} [2025-04-14 01:18:54,453 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 513 predicate places. [2025-04-14 01:18:54,453 INFO L485 AbstractCegarLoop]: Abstraction has has 544 places, 1873 transitions, 46137 flow [2025-04-14 01:18:54,453 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:54,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:54,453 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] [2025-04-14 01:18:54,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-14 01:18:54,653 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:54,654 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:18:54,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1159922622, now seen corresponding path program 1 times [2025-04-14 01:18:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:54,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780442863] [2025-04-14 01:18:54,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:54,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:54,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:18:54,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:18:54,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:54,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:18:54,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:54,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780442863] [2025-04-14 01:18:54,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780442863] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:54,722 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47924333] [2025-04-14 01:18:54,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:54,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:54,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:54,724 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:18:54,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-14 01:18:54,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:18:54,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:18:54,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:54,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:54,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 01:18:54,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:18:54,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:54,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:18:54,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47924333] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:54,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:54,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-14 01:18:54,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735047266] [2025-04-14 01:18:54,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:54,906 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 01:18:54,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:54,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 01:18:54,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:18:54,906 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:54,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 1873 transitions, 46137 flow. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:54,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:54,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:54,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:03,539 INFO L116 PetriNetUnfolderBase]: 15885/23683 cut-off events. [2025-04-14 01:19:03,539 INFO L117 PetriNetUnfolderBase]: For 516796/516796 co-relation queries the response was YES. [2025-04-14 01:19:04,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237756 conditions, 23683 events. 15885/23683 cut-off events. For 516796/516796 co-relation queries the response was YES. Maximal size of possible extension queue 1366. Compared 156442 event pairs, 6857 based on Foata normal form. 442/22737 useless extension candidates. Maximal degree in co-relation 237123. Up to 22067 conditions per place. [2025-04-14 01:19:04,340 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 1656 selfloop transitions, 6 changer transitions 142/1804 dead transitions. [2025-04-14 01:19:04,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 1804 transitions, 47934 flow [2025-04-14 01:19:04,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:19:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:19:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2025-04-14 01:19:04,340 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32421875 [2025-04-14 01:19:04,340 INFO L175 Difference]: Start difference. First operand has 544 places, 1873 transitions, 46137 flow. Second operand 8 states and 83 transitions. [2025-04-14 01:19:04,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 1804 transitions, 47934 flow [2025-04-14 01:19:12,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 1804 transitions, 47742 flow, removed 37 selfloop flow, removed 9 redundant places. [2025-04-14 01:19:12,978 INFO L231 Difference]: Finished difference. Result has 544 places, 1662 transitions, 41416 flow [2025-04-14 01:19:12,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=43837, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1772, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1766, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=41416, PETRI_PLACES=544, PETRI_TRANSITIONS=1662} [2025-04-14 01:19:12,980 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 513 predicate places. [2025-04-14 01:19:12,980 INFO L485 AbstractCegarLoop]: Abstraction has has 544 places, 1662 transitions, 41416 flow [2025-04-14 01:19:12,980 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:12,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:12,980 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] [2025-04-14 01:19:12,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-14 01:19:13,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:13,181 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:13,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash -73947800, now seen corresponding path program 27 times [2025-04-14 01:19:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:13,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951703948] [2025-04-14 01:19:13,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:19:13,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:13,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-14 01:19:13,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:19:13,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:19:13,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:19:13,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:13,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951703948] [2025-04-14 01:19:13,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951703948] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:13,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310268539] [2025-04-14 01:19:13,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:19:13,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:13,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:13,252 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:19:13,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-14 01:19:13,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-14 01:19:13,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:19:13,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:19:13,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:13,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:19:13,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:19:13,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:13,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:19:13,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310268539] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:13,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:19:13,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-04-14 01:19:13,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460792000] [2025-04-14 01:19:13,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:13,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:19:13,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:13,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:19:13,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:19:13,451 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:13,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 1662 transitions, 41416 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:13,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:13,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:13,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:20,845 INFO L116 PetriNetUnfolderBase]: 15103/21878 cut-off events. [2025-04-14 01:19:20,845 INFO L117 PetriNetUnfolderBase]: For 495405/495405 co-relation queries the response was YES. [2025-04-14 01:19:21,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224446 conditions, 21878 events. 15103/21878 cut-off events. For 495405/495405 co-relation queries the response was YES. Maximal size of possible extension queue 1319. Compared 137136 event pairs, 6129 based on Foata normal form. 76/20566 useless extension candidates. Maximal degree in co-relation 224279. Up to 19973 conditions per place. [2025-04-14 01:19:21,232 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1614 selfloop transitions, 72 changer transitions 1/1687 dead transitions. [2025-04-14 01:19:21,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 1687 transitions, 45122 flow [2025-04-14 01:19:21,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:19:21,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:19:21,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2025-04-14 01:19:21,233 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32589285714285715 [2025-04-14 01:19:21,233 INFO L175 Difference]: Start difference. First operand has 544 places, 1662 transitions, 41416 flow. Second operand 7 states and 73 transitions. [2025-04-14 01:19:21,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 1687 transitions, 45122 flow [2025-04-14 01:19:28,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 1687 transitions, 44341 flow, removed 196 selfloop flow, removed 21 redundant places. [2025-04-14 01:19:28,576 INFO L231 Difference]: Finished difference. Result has 503 places, 1654 transitions, 40737 flow [2025-04-14 01:19:28,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=40423, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=40737, PETRI_PLACES=503, PETRI_TRANSITIONS=1654} [2025-04-14 01:19:28,578 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 472 predicate places. [2025-04-14 01:19:28,578 INFO L485 AbstractCegarLoop]: Abstraction has has 503 places, 1654 transitions, 40737 flow [2025-04-14 01:19:28,578 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:28,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:28,579 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] [2025-04-14 01:19:28,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-14 01:19:28,779 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-14 01:19:28,779 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:28,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:28,780 INFO L85 PathProgramCache]: Analyzing trace with hash 500558076, now seen corresponding path program 28 times [2025-04-14 01:19:28,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:28,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702305777] [2025-04-14 01:19:28,780 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:19:28,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:28,792 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-14 01:19:28,798 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:19:28,798 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:19:28,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:28,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:19:28,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:28,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702305777] [2025-04-14 01:19:28,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702305777] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:28,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065668118] [2025-04-14 01:19:28,853 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:19:28,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:28,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:28,855 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:19:28,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-14 01:19:28,927 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-14 01:19:28,948 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:19:28,948 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:19:28,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:28,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:19:28,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:19:28,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:19:29,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065668118] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:29,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:19:29,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-14 01:19:29,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813074901] [2025-04-14 01:19:29,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:29,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:19:29,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:29,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:19:29,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:19:29,047 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:29,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 1654 transitions, 40737 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:29,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:29,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:29,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:35,999 INFO L116 PetriNetUnfolderBase]: 15025/21708 cut-off events. [2025-04-14 01:19:35,999 INFO L117 PetriNetUnfolderBase]: For 474976/474976 co-relation queries the response was YES. [2025-04-14 01:19:36,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221037 conditions, 21708 events. 15025/21708 cut-off events. For 474976/474976 co-relation queries the response was YES. Maximal size of possible extension queue 1290. Compared 135046 event pairs, 4661 based on Foata normal form. 50/20370 useless extension candidates. Maximal degree in co-relation 220877. Up to 19522 conditions per place. [2025-04-14 01:19:36,549 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1580 selfloop transitions, 105 changer transitions 0/1685 dead transitions. [2025-04-14 01:19:36,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 1685 transitions, 44654 flow [2025-04-14 01:19:36,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:19:36,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:19:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2025-04-14 01:19:36,550 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34375 [2025-04-14 01:19:36,551 INFO L175 Difference]: Start difference. First operand has 503 places, 1654 transitions, 40737 flow. Second operand 7 states and 77 transitions. [2025-04-14 01:19:36,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 1685 transitions, 44654 flow [2025-04-14 01:19:43,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 1685 transitions, 44277 flow, removed 70 selfloop flow, removed 10 redundant places. [2025-04-14 01:19:43,620 INFO L231 Difference]: Finished difference. Result has 502 places, 1648 transitions, 40713 flow [2025-04-14 01:19:43,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=40052, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=40713, PETRI_PLACES=502, PETRI_TRANSITIONS=1648} [2025-04-14 01:19:43,622 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 471 predicate places. [2025-04-14 01:19:43,622 INFO L485 AbstractCegarLoop]: Abstraction has has 502 places, 1648 transitions, 40713 flow [2025-04-14 01:19:43,622 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:43,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:43,623 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] [2025-04-14 01:19:43,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-14 01:19:43,823 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:43,823 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:43,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:43,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1385505746, now seen corresponding path program 2 times [2025-04-14 01:19:43,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:43,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220771614] [2025-04-14 01:19:43,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:19:43,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:43,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:19:43,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:19:43,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:19:43,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:43,937 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:19:43,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:43,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220771614] [2025-04-14 01:19:43,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220771614] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:43,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546221169] [2025-04-14 01:19:43,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:19:43,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:43,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:43,939 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:19:43,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-14 01:19:44,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:19:44,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:19:44,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:19:44,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:44,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:19:44,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:44,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:19:44,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:19:44,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546221169] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:44,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:44,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-04-14 01:19:44,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781429936] [2025-04-14 01:19:44,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:44,136 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 01:19:44,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:44,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 01:19:44,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-04-14 01:19:44,137 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:44,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 1648 transitions, 40713 flow. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 15 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:44,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:44,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:44,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:48,466 INFO L116 PetriNetUnfolderBase]: 10163/14481 cut-off events. [2025-04-14 01:19:48,466 INFO L117 PetriNetUnfolderBase]: For 356116/356116 co-relation queries the response was YES. [2025-04-14 01:19:48,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155241 conditions, 14481 events. 10163/14481 cut-off events. For 356116/356116 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 81812 event pairs, 2540 based on Foata normal form. 1218/14774 useless extension candidates. Maximal degree in co-relation 155084. Up to 8553 conditions per place. [2025-04-14 01:19:48,682 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 1302 selfloop transitions, 443 changer transitions 0/1745 dead transitions. [2025-04-14 01:19:48,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 1745 transitions, 46346 flow [2025-04-14 01:19:48,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:19:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:19:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2025-04-14 01:19:48,683 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3055555555555556 [2025-04-14 01:19:48,683 INFO L175 Difference]: Start difference. First operand has 502 places, 1648 transitions, 40713 flow. Second operand 9 states and 88 transitions. [2025-04-14 01:19:48,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 1745 transitions, 46346 flow [2025-04-14 01:19:52,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 1745 transitions, 45999 flow, removed 110 selfloop flow, removed 7 redundant places. [2025-04-14 01:19:52,616 INFO L231 Difference]: Finished difference. Result has 502 places, 1571 transitions, 39355 flow [2025-04-14 01:19:52,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=38469, PETRI_DIFFERENCE_MINUEND_PLACES=494, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=443, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=39355, PETRI_PLACES=502, PETRI_TRANSITIONS=1571} [2025-04-14 01:19:52,618 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 471 predicate places. [2025-04-14 01:19:52,618 INFO L485 AbstractCegarLoop]: Abstraction has has 502 places, 1571 transitions, 39355 flow [2025-04-14 01:19:52,618 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 15 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:52,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:52,618 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] [2025-04-14 01:19:52,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-14 01:19:52,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:52,819 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:52,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:52,819 INFO L85 PathProgramCache]: Analyzing trace with hash 962204739, now seen corresponding path program 2 times [2025-04-14 01:19:52,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:52,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580206696] [2025-04-14 01:19:52,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:19:52,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:52,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:52,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:19:52,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:19:52,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:53,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:19:53,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:53,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580206696] [2025-04-14 01:19:53,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580206696] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:53,176 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97903795] [2025-04-14 01:19:53,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:19:53,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:53,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:53,177 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:19:53,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-14 01:19:53,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:53,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:19:53,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:19:53,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:53,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-14 01:19:53,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:53,443 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:19:53,444 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-14 01:19:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:19:53,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:53,677 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:19:53,677 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 304 [2025-04-14 01:19:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:19:56,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97903795] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:56,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:56,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 8] total 21 [2025-04-14 01:19:56,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668162213] [2025-04-14 01:19:56,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:56,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 01:19:56,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:56,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 01:19:56,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-04-14 01:19:56,359 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:56,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 1571 transitions, 39355 flow. Second operand has 23 states, 23 states have (on average 5.173913043478261) internal successors, (119), 23 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:56,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:56,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:56,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:01,341 INFO L116 PetriNetUnfolderBase]: 11274/16097 cut-off events. [2025-04-14 01:20:01,341 INFO L117 PetriNetUnfolderBase]: For 327873/327873 co-relation queries the response was YES. [2025-04-14 01:20:01,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173439 conditions, 16097 events. 11274/16097 cut-off events. For 327873/327873 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 92946 event pairs, 1761 based on Foata normal form. 1/15009 useless extension candidates. Maximal degree in co-relation 173285. Up to 14511 conditions per place. [2025-04-14 01:20:01,653 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1554 selfloop transitions, 251 changer transitions 1/1806 dead transitions. [2025-04-14 01:20:01,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 1806 transitions, 48249 flow [2025-04-14 01:20:01,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:20:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:20:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 186 transitions. [2025-04-14 01:20:01,658 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3875 [2025-04-14 01:20:01,658 INFO L175 Difference]: Start difference. First operand has 502 places, 1571 transitions, 39355 flow. Second operand 15 states and 186 transitions. [2025-04-14 01:20:01,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 1806 transitions, 48249 flow [2025-04-14 01:20:05,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 1806 transitions, 47351 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-04-14 01:20:05,843 INFO L231 Difference]: Finished difference. Result has 514 places, 1650 transitions, 41435 flow [2025-04-14 01:20:05,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=38461, PETRI_DIFFERENCE_MINUEND_PLACES=494, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=41435, PETRI_PLACES=514, PETRI_TRANSITIONS=1650} [2025-04-14 01:20:05,845 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 483 predicate places. [2025-04-14 01:20:05,846 INFO L485 AbstractCegarLoop]: Abstraction has has 514 places, 1650 transitions, 41435 flow [2025-04-14 01:20:05,846 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.173913043478261) internal successors, (119), 23 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:05,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:05,846 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] [2025-04-14 01:20:05,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-14 01:20:06,046 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-14 01:20:06,046 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:06,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:06,047 INFO L85 PathProgramCache]: Analyzing trace with hash 855382449, now seen corresponding path program 3 times [2025-04-14 01:20:06,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:06,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651819041] [2025-04-14 01:20:06,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:20:06,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:06,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:20:06,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:20:06,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:20:06,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:06,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:06,585 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651819041] [2025-04-14 01:20:06,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651819041] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:06,585 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604197157] [2025-04-14 01:20:06,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:20:06,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:06,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:06,587 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:20:06,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-14 01:20:06,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:20:06,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:20:06,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:20:06,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:06,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-14 01:20:06,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:06,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:20:06,838 INFO L325 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2025-04-14 01:20:06,838 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 55 [2025-04-14 01:20:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:20:06,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:07,116 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:20:07,116 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 304 [2025-04-14 01:20:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:20:09,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604197157] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:20:09,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:20:09,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 8] total 26 [2025-04-14 01:20:09,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146235527] [2025-04-14 01:20:09,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:20:09,054 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 01:20:09,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:09,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 01:20:09,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2025-04-14 01:20:09,055 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:09,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 1650 transitions, 41435 flow. Second operand has 28 states, 28 states have (on average 5.035714285714286) internal successors, (141), 28 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:09,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:09,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:09,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:16,693 INFO L116 PetriNetUnfolderBase]: 14796/21278 cut-off events. [2025-04-14 01:20:16,693 INFO L117 PetriNetUnfolderBase]: For 475423/475423 co-relation queries the response was YES. [2025-04-14 01:20:16,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233278 conditions, 21278 events. 14796/21278 cut-off events. For 475423/475423 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 128613 event pairs, 1824 based on Foata normal form. 4/19852 useless extension candidates. Maximal degree in co-relation 233118. Up to 15792 conditions per place. [2025-04-14 01:20:17,176 INFO L140 encePairwiseOnDemand]: 14/32 looper letters, 1567 selfloop transitions, 713 changer transitions 3/2283 dead transitions. [2025-04-14 01:20:17,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 2283 transitions, 59530 flow [2025-04-14 01:20:17,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-14 01:20:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-14 01:20:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 443 transitions. [2025-04-14 01:20:17,178 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36430921052631576 [2025-04-14 01:20:17,178 INFO L175 Difference]: Start difference. First operand has 514 places, 1650 transitions, 41435 flow. Second operand 38 states and 443 transitions. [2025-04-14 01:20:17,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 2283 transitions, 59530 flow [2025-04-14 01:20:23,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 2283 transitions, 59030 flow, removed 147 selfloop flow, removed 5 redundant places. [2025-04-14 01:20:23,250 INFO L231 Difference]: Finished difference. Result has 566 places, 2049 transitions, 54263 flow [2025-04-14 01:20:23,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=41008, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=371, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=54263, PETRI_PLACES=566, PETRI_TRANSITIONS=2049} [2025-04-14 01:20:23,252 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 535 predicate places. [2025-04-14 01:20:23,252 INFO L485 AbstractCegarLoop]: Abstraction has has 566 places, 2049 transitions, 54263 flow [2025-04-14 01:20:23,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.035714285714286) internal successors, (141), 28 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:23,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:23,252 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] [2025-04-14 01:20:23,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-14 01:20:23,452 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-14 01:20:23,453 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:23,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:23,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1888707235, now seen corresponding path program 4 times [2025-04-14 01:20:23,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:23,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52531878] [2025-04-14 01:20:23,454 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:20:23,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:23,461 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:20:23,476 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:20:23,476 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:20:23,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:20:24,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:24,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52531878] [2025-04-14 01:20:24,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52531878] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:24,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543742460] [2025-04-14 01:20:24,272 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:20:24,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:24,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:24,274 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:20:24,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-14 01:20:24,348 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:20:24,373 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:20:24,373 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:20:24,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:24,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-14 01:20:24,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:24,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-14 01:20:24,430 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 19 treesize of output 1 [2025-04-14 01:20:24,459 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 01:20:24,459 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 01:20:24,538 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 01:20:24,586 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-14 01:20:24,914 INFO L325 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2025-04-14 01:20:24,914 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 31 [2025-04-14 01:20:24,970 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:24,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:20:25,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543742460] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:20:25,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:20:25,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 9] total 35 [2025-04-14 01:20:25,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845956341] [2025-04-14 01:20:25,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:20:25,184 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-14 01:20:25,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:25,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-14 01:20:25,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1190, Unknown=0, NotChecked=0, Total=1332 [2025-04-14 01:20:25,185 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:25,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 2049 transitions, 54263 flow. Second operand has 37 states, 37 states have (on average 4.918918918918919) internal successors, (182), 37 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:25,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:25,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:25,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:36,313 INFO L116 PetriNetUnfolderBase]: 17386/25016 cut-off events. [2025-04-14 01:20:36,313 INFO L117 PetriNetUnfolderBase]: For 644853/644853 co-relation queries the response was YES. [2025-04-14 01:20:37,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297299 conditions, 25016 events. 17386/25016 cut-off events. For 644853/644853 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 153887 event pairs, 2087 based on Foata normal form. 2/23569 useless extension candidates. Maximal degree in co-relation 297118. Up to 20481 conditions per place. [2025-04-14 01:20:37,168 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 2201 selfloop transitions, 695 changer transitions 1/2897 dead transitions. [2025-04-14 01:20:37,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 2897 transitions, 80488 flow [2025-04-14 01:20:37,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-14 01:20:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-04-14 01:20:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 564 transitions. [2025-04-14 01:20:37,169 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34558823529411764 [2025-04-14 01:20:37,169 INFO L175 Difference]: Start difference. First operand has 566 places, 2049 transitions, 54263 flow. Second operand 51 states and 564 transitions. [2025-04-14 01:20:37,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 2897 transitions, 80488 flow [2025-04-14 01:20:48,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 2897 transitions, 78796 flow, removed 533 selfloop flow, removed 12 redundant places. [2025-04-14 01:20:48,261 INFO L231 Difference]: Finished difference. Result has 620 places, 2461 transitions, 66233 flow [2025-04-14 01:20:48,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=53128, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=296, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=66233, PETRI_PLACES=620, PETRI_TRANSITIONS=2461} [2025-04-14 01:20:48,263 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 589 predicate places. [2025-04-14 01:20:48,263 INFO L485 AbstractCegarLoop]: Abstraction has has 620 places, 2461 transitions, 66233 flow [2025-04-14 01:20:48,263 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.918918918918919) internal successors, (182), 37 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:48,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:48,263 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] [2025-04-14 01:20:48,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-14 01:20:48,465 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-14 01:20:48,465 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:48,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:48,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1663548761, now seen corresponding path program 5 times [2025-04-14 01:20:48,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:48,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321544023] [2025-04-14 01:20:48,466 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:20:48,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:48,472 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:20:48,481 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:20:48,481 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:20:48,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:20:48,481 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 01:20:48,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:20:48,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:20:48,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:48,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:20:48,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 01:20:48,537 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 01:20:48,538 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 01:20:48,545 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 01:20:48,546 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 01:20:48,546 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 01:20:48,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-14 01:20:48,546 INFO L422 BasicCegarLoop]: Path program histogram: [28, 5, 2, 1, 1, 1] [2025-04-14 01:20:48,673 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:20:48,674 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:20:48,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:20:48 BasicIcfg [2025-04-14 01:20:48,684 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:20:48,688 INFO L158 Benchmark]: Toolchain (without parser) took 528887.79ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 99.6MB in the beginning and 486.5MB in the end (delta: -386.9MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2025-04-14 01:20:48,688 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:20:48,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.53ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 84.0MB in the end (delta: 15.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 01:20:48,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.54ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 81.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:20:48,688 INFO L158 Benchmark]: Boogie Preprocessor took 60.73ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 78.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:20:48,688 INFO L158 Benchmark]: IcfgBuilder took 864.26ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 44.5MB in the end (delta: 34.4MB). Peak memory consumption was 61.6MB. Max. memory is 8.0GB. [2025-04-14 01:20:48,689 INFO L158 Benchmark]: TraceAbstraction took 527573.94ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 44.5MB in the beginning and 486.5MB in the end (delta: -442.0MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-04-14 01:20:48,690 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 328.53ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 84.0MB in the end (delta: 15.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.54ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 81.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.73ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 78.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 864.26ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 44.5MB in the end (delta: 34.4MB). Peak memory consumption was 61.6MB. Max. memory is 8.0GB. * TraceAbstraction took 527573.94ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 44.5MB in the beginning and 486.5MB in the end (delta: -442.0MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 92]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] 0 int* A; [L39] 0 int* B; [L40] 0 _Atomic int res2; [L41] 0 int res1, M, N; [L73] 0 pthread_t t1, t2, t3; [L76] 0 M = __VERIFIER_nondet_int() [L77] 0 N = __VERIFIER_nondet_int() [L78] CALL, EXPR 0 create_fresh_int_array(N) [L98] CALL 0 assume_abort_if_not(size >= 0) [L35] COND FALSE 0 !(!cond) [L98] RET 0 assume_abort_if_not(size >= 0) [L99] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L35] COND FALSE 0 !(!cond) [L99] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L101] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L102] 0 int i = 0; VAL [A={0:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-3:0}, i=0, res1=0, res2=0, size=2] [L102] COND TRUE 0 i < size [L103] 0 arr[i] = __VERIFIER_nondet_int() [L102] 0 i++ VAL [A={0:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-3:0}, i=1, res1=0, res2=0, size=2] [L102] COND TRUE 0 i < size [L103] 0 arr[i] = __VERIFIER_nondet_int() [L102] 0 i++ VAL [A={0:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-3:0}, i=2, res1=0, res2=0, size=2] [L102] COND FALSE 0 !(i < size) [L105] 0 return arr; [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) [L79] CALL, EXPR 0 create_fresh_int_array(N) [L98] CALL 0 assume_abort_if_not(size >= 0) [L35] COND FALSE 0 !(!cond) [L98] RET 0 assume_abort_if_not(size >= 0) [L99] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L35] COND FALSE 0 !(!cond) [L99] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L101] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L102] 0 int i = 0; VAL [A={-3:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-5:0}, i=0, res1=0, res2=0, size=2] [L102] COND TRUE 0 i < size [L103] 0 arr[i] = __VERIFIER_nondet_int() [L102] 0 i++ VAL [A={-3:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-5:0}, i=1, res1=0, res2=0, size=2] [L102] COND TRUE 0 i < size [L103] 0 arr[i] = __VERIFIER_nondet_int() [L102] 0 i++ VAL [A={-3:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-5:0}, i=2, res1=0, res2=0, size=2] [L102] COND FALSE 0 !(i < size) [L105] 0 return arr; [L79] RET, EXPR 0 create_fresh_int_array(N) [L79] 0 B = create_fresh_int_array(N) [L81] CALL 0 assume_abort_if_not(M >= 0 && M < N) [L35] COND FALSE 0 !(!cond) [L81] RET 0 assume_abort_if_not(M >= 0 && M < N) [L84] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-3:0}, B={-5:0}, M=1, N=2, res1=0, res2=0, t1=3] [L85] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-3:0}, B={-5:0}, M=1, N=2, res1=0, res2=0, t1=3, t2=4] [L86] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [A={-3:0}, B={-5:0}, M=1, N=2, res1=0, res2=0, t1=3, t2=4, t3=5] [L47] 1 int i=0; VAL [A={-3:0}, B={-5:0}, M=1, N=2, \at(_argptr, Pre)={0:0}, _argptr={0:0}, i=0, res1=0, res2=0] [L47] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L35] COND FALSE 1 !(!cond) [L109] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 1 return a + b; [L48] RET, EXPR 1 plus(A[i], B[i]) [L48] CALL, EXPR 1 plus(res1, plus(A[i], B[i])) [L109] CALL 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L35] COND FALSE 1 !(!cond) [L109] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 1 return a + b; [L48] RET, EXPR 1 plus(res1, plus(A[i], B[i])) [L48] 1 res1 = plus(res1, plus(A[i], B[i])) [L47] 1 i++ VAL [A={-3:0}, B={-5:0}, M=1, N=2, \at(_argptr, Pre)={0:0}, _argptr={0:0}, i=1, res1=1, res2=0] [L47] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L35] COND FALSE 1 !(!cond) [L109] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 1 return a + b; [L48] RET, EXPR 1 plus(A[i], B[i]) [L48] CALL, EXPR 1 plus(res1, plus(A[i], B[i])) [L109] CALL 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L35] COND FALSE 1 !(!cond) [L109] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 1 return a + b; [L48] RET, EXPR 1 plus(res1, plus(A[i], B[i])) [L48] 1 res1 = plus(res1, plus(A[i], B[i])) [L47] 1 i++ VAL [A={-3:0}, B={-5:0}, M=1, N=2, \at(_argptr, Pre)={0:0}, _argptr={0:0}, i=2, res1=5, res2=0] [L47] COND FALSE 1 !(i= 0 || a >= -2147483648 - b) [L35] COND FALSE 2 !(!cond) [L109] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 2 !(!cond) [L110] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 2 return a + b; [L56] RET, EXPR 2 plus(A[i], B[i]) [L56] CALL, EXPR 2 plus(res2, plus(A[i], B[i])) [L109] CALL 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L35] COND FALSE 2 !(!cond) [L109] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 2 !(!cond) [L110] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 2 return a + b; [L56] RET, EXPR 2 plus(res2, plus(A[i], B[i])) [L56] 2 int tmp = plus(res2, plus(A[i], B[i])); [L64] 3 int i=M; [L64] COND TRUE 3 i= 0 || a >= -2147483648 - b) [L35] COND FALSE 3 !(!cond) [L109] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 3 !(!cond) [L110] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 3 return a + b; [L65] RET, EXPR 3 plus(A[i], B[i]) [L65] CALL, EXPR 3 plus(res2, plus(A[i], B[i])) [L109] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L35] COND FALSE 3 !(!cond) [L109] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 3 !(!cond) [L110] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 3 return a + b; [L65] RET, EXPR 3 plus(res2, plus(A[i], B[i])) [L65] 3 int tmp = plus(res2, plus(A[i], B[i])); [L57] 2 res2 = tmp VAL [A={-3:0}, B={-5:0}, M=1, N=2, \at(_argptr, Pre)={0:0}, _argptr={0:0}, i=0, res1=5, res2=1, tmp=1] [L55] 2 i++ [L55] COND FALSE 2 !(i