/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-queue-add-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:32:40,336 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:32:40,384 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:32:40,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:32:40,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:32:40,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:32:40,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:32:40,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:32:40,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:32:40,403 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:32:40,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:32:40,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:32:40,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:32:40,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:32:40,404 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:32:40,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:32:40,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:32:40,404 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:32:40,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:32:40,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:32:40,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:32:40,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:32:40,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:32:40,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:32:40,405 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:32:40,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:32:40,405 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:32:40,405 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:32:40,405 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:32:40,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:32:40,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:32:40,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:32:40,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:32:40,405 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:32:40,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:32:40,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:32:40,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:32:40,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:32:40,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:32:40,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:32:40,406 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:32:40,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:32:40,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:32:40,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:32:40,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:32:40,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:32:40,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:32:40,406 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:32:40,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:32:40,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:32:40,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:32:40,635 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:32:40,637 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:32:40,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2025-04-14 01:32:41,954 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b16470f2/c23d6057ef45477ca268869efd96027b/FLAG9c2f5ba8f [2025-04-14 01:32:42,174 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:32:42,175 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2025-04-14 01:32:42,184 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b16470f2/c23d6057ef45477ca268869efd96027b/FLAG9c2f5ba8f [2025-04-14 01:32:43,005 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b16470f2/c23d6057ef45477ca268869efd96027b [2025-04-14 01:32:43,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:32:43,008 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:32:43,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:32:43,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:32:43,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:32:43,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:32:43" (1/1) ... [2025-04-14 01:32:43,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4251b423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:43, skipping insertion in model container [2025-04-14 01:32:43,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:32:43" (1/1) ... [2025-04-14 01:32:43,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:32:43,187 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-queue-add-3.wvr.c[3451,3464] [2025-04-14 01:32:43,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:32:43,207 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:32:43,239 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-queue-add-3.wvr.c[3451,3464] [2025-04-14 01:32:43,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:32:43,251 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:32:43,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:43 WrapperNode [2025-04-14 01:32:43,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:32:43,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:32:43,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:32:43,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:32:43,258 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:32:43" (1/1) ... [2025-04-14 01:32:43,264 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:32:43" (1/1) ... [2025-04-14 01:32:43,287 INFO L138 Inliner]: procedures = 24, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 224 [2025-04-14 01:32:43,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:32:43,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:32:43,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:32:43,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:32:43,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:43" (1/1) ... [2025-04-14 01:32:43,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:43" (1/1) ... [2025-04-14 01:32:43,301 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:43" (1/1) ... [2025-04-14 01:32:43,316 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-14 01:32:43,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:43" (1/1) ... [2025-04-14 01:32:43,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:43" (1/1) ... [2025-04-14 01:32:43,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:43" (1/1) ... [2025-04-14 01:32:43,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:43" (1/1) ... [2025-04-14 01:32:43,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:43" (1/1) ... [2025-04-14 01:32:43,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:43" (1/1) ... [2025-04-14 01:32:43,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:32:43,332 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:32:43,333 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:32:43,333 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:32:43,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:43" (1/1) ... [2025-04-14 01:32:43,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:32:43,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:32:43,360 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:32:43,364 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:32:43,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:32:43,379 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:32:43,379 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:32:43,379 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:32:43,379 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:32:43,379 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:32:43,379 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:32:43,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:32:43,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:32:43,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:32:43,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:32:43,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:32:43,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:32:43,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:32:43,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:32:43,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:32:43,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:32:43,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:32:43,381 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:32:43,468 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:32:43,470 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:32:43,690 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:32:43,691 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:32:43,691 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:32:43,948 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:32:43,950 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:32:43,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:32:43 BoogieIcfgContainer [2025-04-14 01:32:43,951 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:32:43,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:32:43,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:32:43,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:32:43,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:32:43" (1/3) ... [2025-04-14 01:32:43,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf5e216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:32:43, skipping insertion in model container [2025-04-14 01:32:43,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:43" (2/3) ... [2025-04-14 01:32:43,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf5e216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:32:43, skipping insertion in model container [2025-04-14 01:32:43,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:32:43" (3/3) ... [2025-04-14 01:32:43,956 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2025-04-14 01:32:43,965 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:32:43,966 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-queue-add-3.wvr.c that has 4 procedures, 30 locations, 34 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-14 01:32:43,966 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:32:44,001 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 01:32:44,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 95 flow [2025-04-14 01:32:44,048 INFO L116 PetriNetUnfolderBase]: 8/34 cut-off events. [2025-04-14 01:32:44,050 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:32:44,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 8/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-14 01:32:44,052 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 37 transitions, 95 flow [2025-04-14 01:32:44,053 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 33 transitions, 84 flow [2025-04-14 01:32:44,060 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:32:44,067 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;@4f9b2efe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:32:44,067 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:32:44,076 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:32:44,077 INFO L116 PetriNetUnfolderBase]: 8/32 cut-off events. [2025-04-14 01:32:44,077 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:32:44,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:44,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:44,078 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:32:44,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:44,082 INFO L85 PathProgramCache]: Analyzing trace with hash 227834798, now seen corresponding path program 1 times [2025-04-14 01:32:44,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:44,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782092885] [2025-04-14 01:32:44,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:44,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:44,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:32:44,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:32:44,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:44,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:44,239 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:32:44,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:44,240 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782092885] [2025-04-14 01:32:44,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782092885] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:32:44,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:32:44,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:32:44,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387948835] [2025-04-14 01:32:44,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:32:44,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 01:32:44,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:44,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 01:32:44,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 01:32:44,265 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:32:44,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:44,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:44,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:32:44,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:44,432 INFO L116 PetriNetUnfolderBase]: 831/1172 cut-off events. [2025-04-14 01:32:44,433 INFO L117 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-04-14 01:32:44,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2448 conditions, 1172 events. 831/1172 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3785 event pairs, 595 based on Foata normal form. 0/936 useless extension candidates. Maximal degree in co-relation 2264. Up to 1173 conditions per place. [2025-04-14 01:32:44,440 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 31 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2025-04-14 01:32:44,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 142 flow [2025-04-14 01:32:44,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 01:32:44,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 01:32:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2025-04-14 01:32:44,452 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2025-04-14 01:32:44,453 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 84 flow. Second operand 2 states and 39 transitions. [2025-04-14 01:32:44,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 142 flow [2025-04-14 01:32:44,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 01:32:44,462 INFO L231 Difference]: Finished difference. Result has 30 places, 31 transitions, 68 flow [2025-04-14 01:32:44,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=30, PETRI_TRANSITIONS=31} [2025-04-14 01:32:44,468 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2025-04-14 01:32:44,468 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 31 transitions, 68 flow [2025-04-14 01:32:44,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:44,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:44,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:44,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:32:44,469 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:32:44,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:44,470 INFO L85 PathProgramCache]: Analyzing trace with hash 145219194, now seen corresponding path program 1 times [2025-04-14 01:32:44,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:44,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566851134] [2025-04-14 01:32:44,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:44,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:44,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:32:44,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:32:44,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:44,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:44,740 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:32:44,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:44,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566851134] [2025-04-14 01:32:44,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566851134] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:32:44,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:32:44,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:32:44,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269077515] [2025-04-14 01:32:44,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:32:44,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:32:44,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:44,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:32:44,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:32:44,743 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:32:44,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:44,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:44,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:32:44,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:44,923 INFO L116 PetriNetUnfolderBase]: 932/1343 cut-off events. [2025-04-14 01:32:44,924 INFO L117 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-04-14 01:32:44,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2736 conditions, 1343 events. 932/1343 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4600 event pairs, 682 based on Foata normal form. 74/1144 useless extension candidates. Maximal degree in co-relation 2733. Up to 1173 conditions per place. [2025-04-14 01:32:44,931 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 30 selfloop transitions, 2 changer transitions 18/50 dead transitions. [2025-04-14 01:32:44,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 50 transitions, 209 flow [2025-04-14 01:32:44,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:32:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:32:44,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2025-04-14 01:32:44,934 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3675675675675676 [2025-04-14 01:32:44,934 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 68 flow. Second operand 5 states and 68 transitions. [2025-04-14 01:32:44,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 50 transitions, 209 flow [2025-04-14 01:32:44,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 50 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:32:44,936 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 90 flow [2025-04-14 01:32:44,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-04-14 01:32:44,937 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-04-14 01:32:44,937 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 90 flow [2025-04-14 01:32:44,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:44,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:44,937 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:32:44,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:32:44,937 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:32:44,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:44,938 INFO L85 PathProgramCache]: Analyzing trace with hash -370979451, now seen corresponding path program 1 times [2025-04-14 01:32:44,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:44,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585506000] [2025-04-14 01:32:44,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:44,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:44,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:32:44,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:32:44,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:44,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:45,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:32:45,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:45,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585506000] [2025-04-14 01:32:45,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585506000] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:32:45,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:32:45,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:32:45,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662647184] [2025-04-14 01:32:45,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:32:45,108 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:32:45,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:45,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:32:45,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:32:45,109 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:32:45,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:45,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:45,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:32:45,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:45,347 INFO L116 PetriNetUnfolderBase]: 1051/1521 cut-off events. [2025-04-14 01:32:45,348 INFO L117 PetriNetUnfolderBase]: For 220/220 co-relation queries the response was YES. [2025-04-14 01:32:45,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3366 conditions, 1521 events. 1051/1521 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5432 event pairs, 775 based on Foata normal form. 77/1321 useless extension candidates. Maximal degree in co-relation 3359. Up to 1174 conditions per place. [2025-04-14 01:32:45,357 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 31 selfloop transitions, 2 changer transitions 18/51 dead transitions. [2025-04-14 01:32:45,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 51 transitions, 244 flow [2025-04-14 01:32:45,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:32:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:32:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-14 01:32:45,359 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2025-04-14 01:32:45,359 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 90 flow. Second operand 4 states and 64 transitions. [2025-04-14 01:32:45,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 51 transitions, 244 flow [2025-04-14 01:32:45,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 51 transitions, 232 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-14 01:32:45,361 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 98 flow [2025-04-14 01:32:45,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-04-14 01:32:45,362 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-04-14 01:32:45,362 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 98 flow [2025-04-14 01:32:45,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:45,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:45,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, 1, 1, 1] [2025-04-14 01:32:45,362 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:32:45,362 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:32:45,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash -711488051, now seen corresponding path program 1 times [2025-04-14 01:32:45,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:45,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852839991] [2025-04-14 01:32:45,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:45,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:45,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:32:45,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:32:45,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:45,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:32:45,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:45,553 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852839991] [2025-04-14 01:32:45,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852839991] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:32:45,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:32:45,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:32:45,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490107098] [2025-04-14 01:32:45,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:32:45,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:32:45,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:45,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:32:45,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:32:45,554 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:32:45,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:45,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:45,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:32:45,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:45,802 INFO L116 PetriNetUnfolderBase]: 1702/2426 cut-off events. [2025-04-14 01:32:45,802 INFO L117 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2025-04-14 01:32:45,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5581 conditions, 2426 events. 1702/2426 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9708 event pairs, 595 based on Foata normal form. 1/1957 useless extension candidates. Maximal degree in co-relation 5573. Up to 1050 conditions per place. [2025-04-14 01:32:45,812 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 65 selfloop transitions, 5 changer transitions 2/72 dead transitions. [2025-04-14 01:32:45,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 72 transitions, 346 flow [2025-04-14 01:32:45,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:32:45,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:32:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2025-04-14 01:32:45,814 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4648648648648649 [2025-04-14 01:32:45,814 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 98 flow. Second operand 5 states and 86 transitions. [2025-04-14 01:32:45,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 72 transitions, 346 flow [2025-04-14 01:32:45,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 72 transitions, 342 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:32:45,816 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 121 flow [2025-04-14 01:32:45,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2025-04-14 01:32:45,816 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-04-14 01:32:45,816 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 121 flow [2025-04-14 01:32:45,816 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:45,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:45,817 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:45,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:32:45,817 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:32:45,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:45,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1772628853, now seen corresponding path program 1 times [2025-04-14 01:32:45,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:45,817 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918007296] [2025-04-14 01:32:45,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:45,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:45,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:32:45,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:32:45,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:45,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:45,987 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:32:45,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:45,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918007296] [2025-04-14 01:32:45,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918007296] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:32:45,988 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114037238] [2025-04-14 01:32:45,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:45,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:32:45,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:32:45,990 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:32:45,991 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:32:46,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:32:46,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:32:46,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:46,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:46,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:32:46,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:32:46,155 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:32:46,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:32:46,232 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:32:46,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114037238] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:32:46,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:32:46,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 01:32:46,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791695560] [2025-04-14 01:32:46,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:32:46,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:32:46,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:46,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:32:46,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:32:46,234 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:32:46,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 121 flow. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:46,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:46,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:32:46,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:46,640 INFO L116 PetriNetUnfolderBase]: 3152/4541 cut-off events. [2025-04-14 01:32:46,641 INFO L117 PetriNetUnfolderBase]: For 1477/1477 co-relation queries the response was YES. [2025-04-14 01:32:46,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11180 conditions, 4541 events. 3152/4541 cut-off events. For 1477/1477 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 21174 event pairs, 1553 based on Foata normal form. 204/4331 useless extension candidates. Maximal degree in co-relation 11170. Up to 2426 conditions per place. [2025-04-14 01:32:46,656 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 71 selfloop transitions, 6 changer transitions 9/86 dead transitions. [2025-04-14 01:32:46,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 86 transitions, 458 flow [2025-04-14 01:32:46,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:32:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:32:46,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2025-04-14 01:32:46,657 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3783783783783784 [2025-04-14 01:32:46,657 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 121 flow. Second operand 7 states and 98 transitions. [2025-04-14 01:32:46,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 86 transitions, 458 flow [2025-04-14 01:32:46,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 86 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:32:46,659 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 175 flow [2025-04-14 01:32:46,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=175, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-04-14 01:32:46,660 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2025-04-14 01:32:46,660 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 175 flow [2025-04-14 01:32:46,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:46,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:46,660 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:46,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 01:32:46,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:32:46,861 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:32:46,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:46,861 INFO L85 PathProgramCache]: Analyzing trace with hash -357970143, now seen corresponding path program 1 times [2025-04-14 01:32:46,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:46,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713051355] [2025-04-14 01:32:46,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:46,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:46,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:32:46,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:32:46,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:46,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:32:46,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:46,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713051355] [2025-04-14 01:32:46,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713051355] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:32:46,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:32:46,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:32:46,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669938082] [2025-04-14 01:32:46,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:32:46,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:32:46,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:46,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:32:46,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:32:46,928 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:32:46,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:46,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:46,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:32:46,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:47,122 INFO L116 PetriNetUnfolderBase]: 2148/3167 cut-off events. [2025-04-14 01:32:47,122 INFO L117 PetriNetUnfolderBase]: For 2345/2345 co-relation queries the response was YES. [2025-04-14 01:32:47,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8574 conditions, 3167 events. 2148/3167 cut-off events. For 2345/2345 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13489 event pairs, 719 based on Foata normal form. 87/2994 useless extension candidates. Maximal degree in co-relation 8559. Up to 2461 conditions per place. [2025-04-14 01:32:47,135 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 52 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-04-14 01:32:47,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 54 transitions, 335 flow [2025-04-14 01:32:47,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:32:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:32:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-04-14 01:32:47,136 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2025-04-14 01:32:47,137 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 175 flow. Second operand 3 states and 55 transitions. [2025-04-14 01:32:47,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 54 transitions, 335 flow [2025-04-14 01:32:47,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 302 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-04-14 01:32:47,139 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 166 flow [2025-04-14 01:32:47,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2025-04-14 01:32:47,143 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2025-04-14 01:32:47,143 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 166 flow [2025-04-14 01:32:47,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:47,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:47,143 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:47,143 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:32:47,143 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:32:47,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:47,144 INFO L85 PathProgramCache]: Analyzing trace with hash 522357411, now seen corresponding path program 2 times [2025-04-14 01:32:47,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:47,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947277703] [2025-04-14 01:32:47,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:32:47,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:47,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:32:47,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:32:47,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:32:47,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:32:47,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:47,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947277703] [2025-04-14 01:32:47,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947277703] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:32:47,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:32:47,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:32:47,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024266252] [2025-04-14 01:32:47,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:32:47,245 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:32:47,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:47,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:32:47,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:32:47,245 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:32:47,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:47,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:47,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:32:47,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:47,617 INFO L116 PetriNetUnfolderBase]: 4744/6929 cut-off events. [2025-04-14 01:32:47,617 INFO L117 PetriNetUnfolderBase]: For 3116/3116 co-relation queries the response was YES. [2025-04-14 01:32:47,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18100 conditions, 6929 events. 4744/6929 cut-off events. For 3116/3116 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 33428 event pairs, 1276 based on Foata normal form. 74/6359 useless extension candidates. Maximal degree in co-relation 18086. Up to 2565 conditions per place. [2025-04-14 01:32:47,651 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 85 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2025-04-14 01:32:47,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 90 transitions, 508 flow [2025-04-14 01:32:47,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:32:47,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:32:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-04-14 01:32:47,652 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5878378378378378 [2025-04-14 01:32:47,652 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 166 flow. Second operand 4 states and 87 transitions. [2025-04-14 01:32:47,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 90 transitions, 508 flow [2025-04-14 01:32:47,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 90 transitions, 494 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-04-14 01:32:47,658 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 194 flow [2025-04-14 01:32:47,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2025-04-14 01:32:47,659 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2025-04-14 01:32:47,659 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 194 flow [2025-04-14 01:32:47,659 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:47,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:47,659 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:47,659 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:32:47,659 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:32:47,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:47,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1295660618, now seen corresponding path program 2 times [2025-04-14 01:32:47,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:47,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009105679] [2025-04-14 01:32:47,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:32:47,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:47,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:32:47,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-04-14 01:32:47,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:32:47,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:32:47,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:47,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009105679] [2025-04-14 01:32:47,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009105679] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:32:47,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:32:47,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:32:47,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373129000] [2025-04-14 01:32:47,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:32:47,792 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:32:47,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:47,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:32:47,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:32:47,792 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:32:47,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:47,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:47,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:32:47,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:48,196 INFO L116 PetriNetUnfolderBase]: 3802/5676 cut-off events. [2025-04-14 01:32:48,196 INFO L117 PetriNetUnfolderBase]: For 3139/3139 co-relation queries the response was YES. [2025-04-14 01:32:48,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15219 conditions, 5676 events. 3802/5676 cut-off events. For 3139/3139 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 27706 event pairs, 1032 based on Foata normal form. 18/5178 useless extension candidates. Maximal degree in co-relation 15204. Up to 3772 conditions per place. [2025-04-14 01:32:48,218 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 76 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2025-04-14 01:32:48,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 85 transitions, 493 flow [2025-04-14 01:32:48,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:32:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:32:48,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2025-04-14 01:32:48,219 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40540540540540543 [2025-04-14 01:32:48,219 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 194 flow. Second operand 6 states and 90 transitions. [2025-04-14 01:32:48,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 85 transitions, 493 flow [2025-04-14 01:32:48,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 85 transitions, 482 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 01:32:48,222 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 241 flow [2025-04-14 01:32:48,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2025-04-14 01:32:48,223 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2025-04-14 01:32:48,223 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 241 flow [2025-04-14 01:32:48,223 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:48,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:48,223 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:48,223 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:32:48,223 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:32:48,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:48,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1320657199, now seen corresponding path program 1 times [2025-04-14 01:32:48,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:48,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540894964] [2025-04-14 01:32:48,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:48,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:48,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-14 01:32:48,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 01:32:48,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:48,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:32:48,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:48,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540894964] [2025-04-14 01:32:48,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540894964] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:32:48,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652230062] [2025-04-14 01:32:48,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:48,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:32:48,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:32:48,377 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:32:48,379 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:32:48,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-14 01:32:48,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 01:32:48,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:48,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:48,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-14 01:32:48,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:32:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:32:48,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:32:48,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652230062] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:32:48,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:32:48,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-04-14 01:32:48,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658072271] [2025-04-14 01:32:48,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:32:48,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:32:48,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:48,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:32:48,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:32:48,487 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:32:48,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:32:48,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:48,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:32:48,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:48,985 INFO L116 PetriNetUnfolderBase]: 6819/10013 cut-off events. [2025-04-14 01:32:48,985 INFO L117 PetriNetUnfolderBase]: For 11637/11637 co-relation queries the response was YES. [2025-04-14 01:32:49,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29990 conditions, 10013 events. 6819/10013 cut-off events. For 11637/11637 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 52082 event pairs, 2245 based on Foata normal form. 258/9745 useless extension candidates. Maximal degree in co-relation 29973. Up to 3634 conditions per place. [2025-04-14 01:32:49,025 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 91 selfloop transitions, 8 changer transitions 7/106 dead transitions. [2025-04-14 01:32:49,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 106 transitions, 692 flow [2025-04-14 01:32:49,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:32:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:32:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-04-14 01:32:49,026 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2025-04-14 01:32:49,026 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 241 flow. Second operand 4 states and 89 transitions. [2025-04-14 01:32:49,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 106 transitions, 692 flow [2025-04-14 01:32:49,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 106 transitions, 689 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:32:49,031 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 264 flow [2025-04-14 01:32:49,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=264, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2025-04-14 01:32:49,031 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2025-04-14 01:32:49,031 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 264 flow [2025-04-14 01:32:49,031 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:32:49,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:49,032 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:49,038 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:32:49,232 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,SelfDestructingSolverStorable8 [2025-04-14 01:32:49,232 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:32:49,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:49,233 INFO L85 PathProgramCache]: Analyzing trace with hash 880134784, now seen corresponding path program 1 times [2025-04-14 01:32:49,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:49,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442183327] [2025-04-14 01:32:49,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:49,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:49,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 01:32:49,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:32:49,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:49,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:49,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:32:49,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:49,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442183327] [2025-04-14 01:32:49,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442183327] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:32:49,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475652977] [2025-04-14 01:32:49,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:49,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:32:49,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:32:49,365 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:32:49,366 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:32:49,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 01:32:49,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:32:49,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:49,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:49,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:32:49,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:32:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:32:49,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:32:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:32:49,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475652977] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:32:49,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:32:49,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-14 01:32:49,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949163751] [2025-04-14 01:32:49,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:32:49,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:32:49,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:49,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:32:49,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:32:49,613 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:32:49,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 264 flow. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 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:32:49,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:49,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:32:49,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:50,294 INFO L116 PetriNetUnfolderBase]: 7747/11375 cut-off events. [2025-04-14 01:32:50,294 INFO L117 PetriNetUnfolderBase]: For 21244/21244 co-relation queries the response was YES. [2025-04-14 01:32:50,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37647 conditions, 11375 events. 7747/11375 cut-off events. For 21244/21244 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 58435 event pairs, 5354 based on Foata normal form. 195/10890 useless extension candidates. Maximal degree in co-relation 37627. Up to 9220 conditions per place. [2025-04-14 01:32:50,393 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 45 selfloop transitions, 3 changer transitions 44/92 dead transitions. [2025-04-14 01:32:50,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 92 transitions, 696 flow [2025-04-14 01:32:50,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:32:50,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:32:50,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-04-14 01:32:50,394 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3783783783783784 [2025-04-14 01:32:50,394 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 264 flow. Second operand 6 states and 84 transitions. [2025-04-14 01:32:50,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 92 transitions, 696 flow [2025-04-14 01:32:50,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 92 transitions, 624 flow, removed 36 selfloop flow, removed 2 redundant places. [2025-04-14 01:32:50,404 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 258 flow [2025-04-14 01:32:50,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2025-04-14 01:32:50,405 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 31 predicate places. [2025-04-14 01:32:50,405 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 48 transitions, 258 flow [2025-04-14 01:32:50,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 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:32:50,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:50,405 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:50,411 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:32:50,605 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:32:50,606 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:32:50,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:50,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1869466958, now seen corresponding path program 2 times [2025-04-14 01:32:50,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:50,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162064122] [2025-04-14 01:32:50,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:32:50,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:50,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-14 01:32:50,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 01:32:50,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:32:50,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:32:51,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:51,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162064122] [2025-04-14 01:32:51,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162064122] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:32:51,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058910644] [2025-04-14 01:32:51,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:32:51,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:32:51,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:32:51,146 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:32:51,147 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:32:51,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-14 01:32:51,236 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 01:32:51,236 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:32:51,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:51,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-14 01:32:51,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:32:51,448 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 8 [2025-04-14 01:32:51,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:32:51,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:32:51,622 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-14 01:32:51,622 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 24 treesize of output 11 [2025-04-14 01:32:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:32:51,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058910644] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:32:51,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:32:51,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 27 [2025-04-14 01:32:51,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899317678] [2025-04-14 01:32:51,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:32:51,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 01:32:51,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:51,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 01:32:51,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2025-04-14 01:32:51,892 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:32:51,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 48 transitions, 258 flow. Second operand has 28 states, 28 states have (on average 6.035714285714286) internal successors, (169), 28 states have internal predecessors, (169), 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:32:51,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:51,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:32:51,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:55,155 INFO L116 PetriNetUnfolderBase]: 21567/31785 cut-off events. [2025-04-14 01:32:55,155 INFO L117 PetriNetUnfolderBase]: For 46786/46786 co-relation queries the response was YES. [2025-04-14 01:32:55,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100201 conditions, 31785 events. 21567/31785 cut-off events. For 46786/46786 co-relation queries the response was YES. Maximal size of possible extension queue 976. Compared 195646 event pairs, 1365 based on Foata normal form. 1258/31205 useless extension candidates. Maximal degree in co-relation 100179. Up to 4241 conditions per place. [2025-04-14 01:32:55,384 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 601 selfloop transitions, 88 changer transitions 32/721 dead transitions. [2025-04-14 01:32:55,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 721 transitions, 4885 flow [2025-04-14 01:32:55,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-14 01:32:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-04-14 01:32:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 650 transitions. [2025-04-14 01:32:55,387 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39926289926289926 [2025-04-14 01:32:55,387 INFO L175 Difference]: Start difference. First operand has 66 places, 48 transitions, 258 flow. Second operand 44 states and 650 transitions. [2025-04-14 01:32:55,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 721 transitions, 4885 flow [2025-04-14 01:32:55,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 721 transitions, 4847 flow, removed 17 selfloop flow, removed 4 redundant places. [2025-04-14 01:32:55,434 INFO L231 Difference]: Finished difference. Result has 130 places, 140 transitions, 1203 flow [2025-04-14 01:32:55,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=1203, PETRI_PLACES=130, PETRI_TRANSITIONS=140} [2025-04-14 01:32:55,434 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 95 predicate places. [2025-04-14 01:32:55,437 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 140 transitions, 1203 flow [2025-04-14 01:32:55,437 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.035714285714286) internal successors, (169), 28 states have internal predecessors, (169), 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:32:55,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:55,437 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:55,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 01:32:55,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:32:55,641 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:32:55,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:55,642 INFO L85 PathProgramCache]: Analyzing trace with hash 255173752, now seen corresponding path program 3 times [2025-04-14 01:32:55,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:55,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457138715] [2025-04-14 01:32:55,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:32:55,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:55,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-04-14 01:32:55,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 32 statements. [2025-04-14 01:32:55,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:32:55,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 01:32:55,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:55,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457138715] [2025-04-14 01:32:55,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457138715] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:32:55,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:32:55,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:32:55,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711458512] [2025-04-14 01:32:55,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:32:55,791 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:32:55,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:55,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:32:55,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:32:55,792 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:32:55,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 140 transitions, 1203 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:55,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:55,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:32:55,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:58,249 INFO L116 PetriNetUnfolderBase]: 18469/27221 cut-off events. [2025-04-14 01:32:58,249 INFO L117 PetriNetUnfolderBase]: For 222552/222552 co-relation queries the response was YES. [2025-04-14 01:32:58,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124520 conditions, 27221 events. 18469/27221 cut-off events. For 222552/222552 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 162039 event pairs, 1517 based on Foata normal form. 1220/26861 useless extension candidates. Maximal degree in co-relation 124474. Up to 12614 conditions per place. [2025-04-14 01:32:58,439 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 168 selfloop transitions, 40 changer transitions 0/208 dead transitions. [2025-04-14 01:32:58,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 208 transitions, 2039 flow [2025-04-14 01:32:58,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:32:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:32:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2025-04-14 01:32:58,441 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-14 01:32:58,441 INFO L175 Difference]: Start difference. First operand has 130 places, 140 transitions, 1203 flow. Second operand 8 states and 111 transitions. [2025-04-14 01:32:58,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 208 transitions, 2039 flow [2025-04-14 01:32:59,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 208 transitions, 1922 flow, removed 55 selfloop flow, removed 6 redundant places. [2025-04-14 01:32:59,311 INFO L231 Difference]: Finished difference. Result has 127 places, 134 transitions, 1186 flow [2025-04-14 01:32:59,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1186, PETRI_PLACES=127, PETRI_TRANSITIONS=134} [2025-04-14 01:32:59,312 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 92 predicate places. [2025-04-14 01:32:59,312 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 134 transitions, 1186 flow [2025-04-14 01:32:59,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:59,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:59,312 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:59,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 01:32:59,312 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:32:59,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:59,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1553957016, now seen corresponding path program 1 times [2025-04-14 01:32:59,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:59,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254351530] [2025-04-14 01:32:59,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:59,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:59,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 01:32:59,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:32:59,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:59,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:00,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:00,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254351530] [2025-04-14 01:33:00,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254351530] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:00,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471049975] [2025-04-14 01:33:00,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:00,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:00,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:00,780 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:33:00,781 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:33:00,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 01:33:00,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:33:00,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:00,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:00,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-14 01:33:00,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:33:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 01:33:01,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:33:05,425 WARN L849 $PredicateComparison]: unable to prove that (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse0 (select |c_#memory_int#1| ~q2~0.base))) (or (not (= (select .cse0 (+ ~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int#1| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (= c_~N~0 (+ c_~t~0 (select .cse0 (+ ~q2~0.offset (* c_~q2_front~0 4)))))))) is different from false [2025-04-14 01:33:05,547 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-14 01:33:05,547 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 46 treesize of output 87 [2025-04-14 01:33:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 1 not checked. [2025-04-14 01:33:05,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471049975] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:33:05,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:33:05,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 8] total 31 [2025-04-14 01:33:05,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243847476] [2025-04-14 01:33:05,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:33:05,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 01:33:05,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:05,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 01:33:05,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=917, Unknown=1, NotChecked=60, Total=1056 [2025-04-14 01:33:05,720 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:33:05,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 134 transitions, 1186 flow. Second operand has 33 states, 33 states have (on average 5.757575757575758) internal successors, (190), 33 states have internal predecessors, (190), 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:33:05,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:05,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:33:05,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:10,133 INFO L116 PetriNetUnfolderBase]: 23652/35485 cut-off events. [2025-04-14 01:33:10,134 INFO L117 PetriNetUnfolderBase]: For 236414/236414 co-relation queries the response was YES. [2025-04-14 01:33:10,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164526 conditions, 35485 events. 23652/35485 cut-off events. For 236414/236414 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 229602 event pairs, 7887 based on Foata normal form. 30/33921 useless extension candidates. Maximal degree in co-relation 164481. Up to 27445 conditions per place. [2025-04-14 01:33:10,435 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 346 selfloop transitions, 62 changer transitions 67/475 dead transitions. [2025-04-14 01:33:10,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 475 transitions, 4663 flow [2025-04-14 01:33:10,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-14 01:33:10,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-14 01:33:10,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 311 transitions. [2025-04-14 01:33:10,436 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3001930501930502 [2025-04-14 01:33:10,436 INFO L175 Difference]: Start difference. First operand has 127 places, 134 transitions, 1186 flow. Second operand 28 states and 311 transitions. [2025-04-14 01:33:10,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 475 transitions, 4663 flow [2025-04-14 01:33:12,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 475 transitions, 4565 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-04-14 01:33:12,711 INFO L231 Difference]: Finished difference. Result has 162 places, 189 transitions, 1886 flow [2025-04-14 01:33:12,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1886, PETRI_PLACES=162, PETRI_TRANSITIONS=189} [2025-04-14 01:33:12,711 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 127 predicate places. [2025-04-14 01:33:12,711 INFO L485 AbstractCegarLoop]: Abstraction has has 162 places, 189 transitions, 1886 flow [2025-04-14 01:33:12,712 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.757575757575758) internal successors, (190), 33 states have internal predecessors, (190), 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:33:12,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:12,712 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:12,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 01:33:12,914 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-14 01:33:12,914 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:33:12,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:12,914 INFO L85 PathProgramCache]: Analyzing trace with hash -604799320, now seen corresponding path program 2 times [2025-04-14 01:33:12,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:12,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514328716] [2025-04-14 01:33:12,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:33:12,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:12,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:33:12,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:33:12,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:33:12,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:14,032 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:33:14,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:14,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514328716] [2025-04-14 01:33:14,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514328716] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:14,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252315280] [2025-04-14 01:33:14,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:33:14,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:14,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:14,035 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:33:14,035 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:33:14,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:33:14,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:33:14,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:33:14,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:14,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-14 01:33:14,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:33:14,760 INFO L325 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2025-04-14 01:33:14,761 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 38 [2025-04-14 01:33:14,789 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:33:14,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:33:15,230 INFO L325 Elim1Store]: treesize reduction 23, result has 84.4 percent of original size [2025-04-14 01:33:15,231 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 141 [2025-04-14 01:33:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:33:16,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252315280] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:33:16,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:33:16,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 46 [2025-04-14 01:33:16,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035524901] [2025-04-14 01:33:16,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:33:16,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-14 01:33:16,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:16,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-14 01:33:16,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2067, Unknown=0, NotChecked=0, Total=2256 [2025-04-14 01:33:16,015 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:33:16,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 189 transitions, 1886 flow. Second operand has 48 states, 48 states have (on average 5.041666666666667) internal successors, (242), 48 states have internal predecessors, (242), 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:33:16,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:16,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:33:16,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:24,920 INFO L116 PetriNetUnfolderBase]: 36646/54314 cut-off events. [2025-04-14 01:33:24,921 INFO L117 PetriNetUnfolderBase]: For 415000/415000 co-relation queries the response was YES. [2025-04-14 01:33:25,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262377 conditions, 54314 events. 36646/54314 cut-off events. For 415000/415000 co-relation queries the response was YES. Maximal size of possible extension queue 1523. Compared 370062 event pairs, 1596 based on Foata normal form. 5/51757 useless extension candidates. Maximal degree in co-relation 262320. Up to 21103 conditions per place. [2025-04-14 01:33:25,607 INFO L140 encePairwiseOnDemand]: 21/37 looper letters, 414 selfloop transitions, 255 changer transitions 133/802 dead transitions. [2025-04-14 01:33:25,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 802 transitions, 7676 flow [2025-04-14 01:33:25,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-14 01:33:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-04-14 01:33:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 633 transitions. [2025-04-14 01:33:25,610 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3055019305019305 [2025-04-14 01:33:25,610 INFO L175 Difference]: Start difference. First operand has 162 places, 189 transitions, 1886 flow. Second operand 56 states and 633 transitions. [2025-04-14 01:33:25,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 802 transitions, 7676 flow [2025-04-14 01:33:29,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 802 transitions, 7600 flow, removed 14 selfloop flow, removed 8 redundant places. [2025-04-14 01:33:29,200 INFO L231 Difference]: Finished difference. Result has 227 places, 351 transitions, 4578 flow [2025-04-14 01:33:29,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1833, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=4578, PETRI_PLACES=227, PETRI_TRANSITIONS=351} [2025-04-14 01:33:29,200 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 192 predicate places. [2025-04-14 01:33:29,201 INFO L485 AbstractCegarLoop]: Abstraction has has 227 places, 351 transitions, 4578 flow [2025-04-14 01:33:29,201 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 5.041666666666667) internal successors, (242), 48 states have internal predecessors, (242), 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:33:29,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:29,202 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:29,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 01:33:29,402 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:29,403 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:33:29,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:29,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1431079488, now seen corresponding path program 3 times [2025-04-14 01:33:29,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:29,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500637901] [2025-04-14 01:33:29,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:33:29,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:29,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:33:29,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:33:29,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:33:29,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:30,430 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:33:30,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:30,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500637901] [2025-04-14 01:33:30,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500637901] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:30,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243155340] [2025-04-14 01:33:30,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:33:30,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:30,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:30,433 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:33:30,434 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:33:30,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:33:30,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:33:30,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:33:30,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:30,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-14 01:33:30,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:33:31,311 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:33:31,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:33:31,743 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-14 01:33:31,743 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 46 treesize of output 87 [2025-04-14 01:33:32,397 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:33:32,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243155340] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:33:32,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:33:32,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 50 [2025-04-14 01:33:32,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881351840] [2025-04-14 01:33:32,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:33:32,397 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-14 01:33:32,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:32,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-14 01:33:32,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=2377, Unknown=0, NotChecked=0, Total=2652 [2025-04-14 01:33:32,399 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:33:32,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 351 transitions, 4578 flow. Second operand has 52 states, 52 states have (on average 4.884615384615385) internal successors, (254), 52 states have internal predecessors, (254), 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:33:32,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:32,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:33:32,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:49,927 INFO L116 PetriNetUnfolderBase]: 41852/62442 cut-off events. [2025-04-14 01:33:49,927 INFO L117 PetriNetUnfolderBase]: For 795200/795200 co-relation queries the response was YES. [2025-04-14 01:33:50,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374059 conditions, 62442 events. 41852/62442 cut-off events. For 795200/795200 co-relation queries the response was YES. Maximal size of possible extension queue 1785. Compared 438378 event pairs, 3031 based on Foata normal form. 12/62454 useless extension candidates. Maximal degree in co-relation 373986. Up to 27693 conditions per place. [2025-04-14 01:33:50,985 INFO L140 encePairwiseOnDemand]: 20/37 looper letters, 671 selfloop transitions, 548 changer transitions 191/1410 dead transitions. [2025-04-14 01:33:50,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 1410 transitions, 16869 flow [2025-04-14 01:33:50,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-04-14 01:33:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2025-04-14 01:33:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 1076 transitions. [2025-04-14 01:33:50,988 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30292792792792794 [2025-04-14 01:33:50,988 INFO L175 Difference]: Start difference. First operand has 227 places, 351 transitions, 4578 flow. Second operand 96 states and 1076 transitions. [2025-04-14 01:33:50,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 1410 transitions, 16869 flow [2025-04-14 01:34:00,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 1410 transitions, 16090 flow, removed 250 selfloop flow, removed 24 redundant places. [2025-04-14 01:34:00,376 INFO L231 Difference]: Finished difference. Result has 324 places, 727 transitions, 10909 flow [2025-04-14 01:34:00,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4193, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=96, PETRI_FLOW=10909, PETRI_PLACES=324, PETRI_TRANSITIONS=727} [2025-04-14 01:34:00,377 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 289 predicate places. [2025-04-14 01:34:00,377 INFO L485 AbstractCegarLoop]: Abstraction has has 324 places, 727 transitions, 10909 flow [2025-04-14 01:34:00,377 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.884615384615385) internal successors, (254), 52 states have internal predecessors, (254), 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:34:00,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:34:00,378 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:34:00,384 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:34:00,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:34:00,578 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:34:00,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:34:00,579 INFO L85 PathProgramCache]: Analyzing trace with hash 460005860, now seen corresponding path program 4 times [2025-04-14 01:34:00,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:34:00,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969777089] [2025-04-14 01:34:00,579 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:34:00,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:34:00,586 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:34:00,601 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:34:00,601 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:34:00,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:34:01,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:34:01,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969777089] [2025-04-14 01:34:01,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969777089] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:34:01,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412988536] [2025-04-14 01:34:01,140 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:34:01,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:34:01,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:34:01,143 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:34:01,144 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:34:01,194 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:34:01,222 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:34:01,222 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:34:01,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:01,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-14 01:34:01,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:34:01,591 INFO L325 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-04-14 01:34:01,591 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 23 treesize of output 7 [2025-04-14 01:34:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:34:01,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:34:01,954 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-14 01:34:01,955 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 46 treesize of output 87 [2025-04-14 01:34:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:34:02,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412988536] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:34:02,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:34:02,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 40 [2025-04-14 01:34:02,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027614828] [2025-04-14 01:34:02,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:34:02,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-14 01:34:02,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:34:02,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-14 01:34:02,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1518, Unknown=0, NotChecked=0, Total=1722 [2025-04-14 01:34:02,279 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:34:02,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 727 transitions, 10909 flow. Second operand has 42 states, 42 states have (on average 5.238095238095238) internal successors, (220), 42 states have internal predecessors, (220), 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:34:02,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:34:02,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:34:02,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:34:16,782 INFO L116 PetriNetUnfolderBase]: 42920/63955 cut-off events. [2025-04-14 01:34:16,782 INFO L117 PetriNetUnfolderBase]: For 1062477/1062477 co-relation queries the response was YES. [2025-04-14 01:34:18,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419246 conditions, 63955 events. 42920/63955 cut-off events. For 1062477/1062477 co-relation queries the response was YES. Maximal size of possible extension queue 1849. Compared 449753 event pairs, 2007 based on Foata normal form. 5/63959 useless extension candidates. Maximal degree in co-relation 419145. Up to 29132 conditions per place. [2025-04-14 01:34:18,299 INFO L140 encePairwiseOnDemand]: 20/37 looper letters, 513 selfloop transitions, 717 changer transitions 114/1344 dead transitions. [2025-04-14 01:34:18,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 1344 transitions, 19973 flow [2025-04-14 01:34:18,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-04-14 01:34:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2025-04-14 01:34:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 589 transitions. [2025-04-14 01:34:18,300 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2947947947947948 [2025-04-14 01:34:18,300 INFO L175 Difference]: Start difference. First operand has 324 places, 727 transitions, 10909 flow. Second operand 54 states and 589 transitions. [2025-04-14 01:34:18,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 1344 transitions, 19973 flow [2025-04-14 01:34:36,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 1344 transitions, 18284 flow, removed 823 selfloop flow, removed 24 redundant places. [2025-04-14 01:34:36,407 INFO L231 Difference]: Finished difference. Result has 357 places, 922 transitions, 14480 flow [2025-04-14 01:34:36,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9762, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=528, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=14480, PETRI_PLACES=357, PETRI_TRANSITIONS=922} [2025-04-14 01:34:36,408 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 322 predicate places. [2025-04-14 01:34:36,409 INFO L485 AbstractCegarLoop]: Abstraction has has 357 places, 922 transitions, 14480 flow [2025-04-14 01:34:36,409 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 5.238095238095238) internal successors, (220), 42 states have internal predecessors, (220), 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:34:36,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:34:36,409 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:34:36,415 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:34:36,609 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,SelfDestructingSolverStorable15 [2025-04-14 01:34:36,610 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:34:36,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:34:36,610 INFO L85 PathProgramCache]: Analyzing trace with hash -482416406, now seen corresponding path program 5 times [2025-04-14 01:34:36,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:34:36,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436283399] [2025-04-14 01:34:36,610 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:34:36,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:34:36,618 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:34:36,637 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:34:36,637 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:34:36,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:37,397 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:34:37,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:34:37,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436283399] [2025-04-14 01:34:37,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436283399] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:34:37,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97433581] [2025-04-14 01:34:37,398 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:34:37,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:34:37,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:34:37,399 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:34:37,402 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:34:37,467 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-14 01:34:37,493 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 01:34:37,493 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:34:37,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:37,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-14 01:34:37,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:34:37,952 INFO L325 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-04-14 01:34:37,952 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 24 treesize of output 7 [2025-04-14 01:34:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:34:38,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:34:38,404 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-14 01:34:38,404 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 46 treesize of output 87 [2025-04-14 01:34:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:34:38,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97433581] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:34:38,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:34:38,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 40 [2025-04-14 01:34:38,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605506506] [2025-04-14 01:34:38,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:34:38,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-14 01:34:38,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:34:38,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-14 01:34:38,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1520, Unknown=0, NotChecked=0, Total=1722 [2025-04-14 01:34:38,807 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:34:38,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 922 transitions, 14480 flow. Second operand has 42 states, 42 states have (on average 5.238095238095238) internal successors, (220), 42 states have internal predecessors, (220), 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:34:38,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:34:38,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:34:38,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:34:43,003 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:34:47,046 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:34:51,717 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:34:56,490 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:35:00,579 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:35:04,960 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-14 01:35:09,184 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:35:13,199 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-04-14 01:35:17,382 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:35:21,459 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:35:25,947 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:35:30,566 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:35:45,842 INFO L116 PetriNetUnfolderBase]: 57927/86921 cut-off events. [2025-04-14 01:35:45,843 INFO L117 PetriNetUnfolderBase]: For 1590937/1590937 co-relation queries the response was YES. [2025-04-14 01:35:48,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590731 conditions, 86921 events. 57927/86921 cut-off events. For 1590937/1590937 co-relation queries the response was YES. Maximal size of possible extension queue 2744. Compared 643572 event pairs, 11401 based on Foata normal form. 49/86948 useless extension candidates. Maximal degree in co-relation 590624. Up to 55408 conditions per place. [2025-04-14 01:35:48,497 INFO L140 encePairwiseOnDemand]: 20/37 looper letters, 1098 selfloop transitions, 581 changer transitions 156/1835 dead transitions. [2025-04-14 01:35:48,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 1835 transitions, 29848 flow [2025-04-14 01:35:48,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-14 01:35:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-04-14 01:35:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 558 transitions. [2025-04-14 01:35:48,499 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2742014742014742 [2025-04-14 01:35:48,499 INFO L175 Difference]: Start difference. First operand has 357 places, 922 transitions, 14480 flow. Second operand 55 states and 558 transitions. [2025-04-14 01:35:48,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 1835 transitions, 29848 flow [2025-04-14 01:36:20,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 1835 transitions, 29082 flow, removed 310 selfloop flow, removed 17 redundant places. [2025-04-14 01:36:20,822 INFO L231 Difference]: Finished difference. Result has 413 places, 1185 transitions, 20378 flow [2025-04-14 01:36:20,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13979, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=922, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=349, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=20378, PETRI_PLACES=413, PETRI_TRANSITIONS=1185} [2025-04-14 01:36:20,825 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 378 predicate places. [2025-04-14 01:36:20,826 INFO L485 AbstractCegarLoop]: Abstraction has has 413 places, 1185 transitions, 20378 flow [2025-04-14 01:36:20,826 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 5.238095238095238) internal successors, (220), 42 states have internal predecessors, (220), 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:36:20,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:36:20,826 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:36:20,832 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:36:21,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-14 01:36:21,030 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:36:21,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:36:21,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1030983946, now seen corresponding path program 6 times [2025-04-14 01:36:21,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:36:21,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547532120] [2025-04-14 01:36:21,031 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:36:21,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:36:21,050 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 3 equivalence classes. [2025-04-14 01:36:21,086 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 01:36:21,086 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 01:36:21,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:36:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 01:36:21,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:36:21,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547532120] [2025-04-14 01:36:21,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547532120] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:36:21,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272980291] [2025-04-14 01:36:21,486 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:36:21,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:36:21,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:36:21,488 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:36:21,490 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:36:21,562 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 3 equivalence classes. [2025-04-14 01:36:21,636 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 01:36:21,636 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 01:36:21,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:36:21,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-14 01:36:21,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:36:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:36:21,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:36:30,144 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-14 01:36:30,144 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 87 [2025-04-14 01:36:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 01:36:30,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272980291] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:36:30,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:36:30,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 22 [2025-04-14 01:36:30,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497991229] [2025-04-14 01:36:30,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:36:30,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 01:36:30,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:36:30,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 01:36:30,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=482, Unknown=2, NotChecked=0, Total=552 [2025-04-14 01:36:30,278 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:36:30,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 1185 transitions, 20378 flow. Second operand has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 24 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:36:30,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:36:30,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:36:30,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:36:34,430 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:36:38,479 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:36:42,494 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:36:46,509 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:36:51,011 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:36:55,021 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:36:59,038 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:37:18,155 INFO L116 PetriNetUnfolderBase]: 56108/83963 cut-off events. [2025-04-14 01:37:18,156 INFO L117 PetriNetUnfolderBase]: For 1783201/1783201 co-relation queries the response was YES. [2025-04-14 01:37:20,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611129 conditions, 83963 events. 56108/83963 cut-off events. For 1783201/1783201 co-relation queries the response was YES. Maximal size of possible extension queue 2572. Compared 613570 event pairs, 14229 based on Foata normal form. 4/83947 useless extension candidates. Maximal degree in co-relation 611000. Up to 77144 conditions per place. [2025-04-14 01:37:21,030 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 1125 selfloop transitions, 127 changer transitions 96/1348 dead transitions. [2025-04-14 01:37:21,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 1348 transitions, 24634 flow [2025-04-14 01:37:21,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 01:37:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 01:37:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 208 transitions. [2025-04-14 01:37:21,216 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33068362480127184 [2025-04-14 01:37:21,216 INFO L175 Difference]: Start difference. First operand has 413 places, 1185 transitions, 20378 flow. Second operand 17 states and 208 transitions. [2025-04-14 01:37:21,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 1348 transitions, 24634 flow [2025-04-14 01:38:03,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 1348 transitions, 24197 flow, removed 187 selfloop flow, removed 20 redundant places. [2025-04-14 01:38:03,739 INFO L231 Difference]: Finished difference. Result has 404 places, 1153 transitions, 19650 flow [2025-04-14 01:38:03,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=19957, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1058, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=19650, PETRI_PLACES=404, PETRI_TRANSITIONS=1153} [2025-04-14 01:38:03,740 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 369 predicate places. [2025-04-14 01:38:03,740 INFO L485 AbstractCegarLoop]: Abstraction has has 404 places, 1153 transitions, 19650 flow [2025-04-14 01:38:03,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 24 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:38:03,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:38:03,740 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:38:03,746 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:38:03,940 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,SelfDestructingSolverStorable17 [2025-04-14 01:38:03,941 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:38:03,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:38:03,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1433745766, now seen corresponding path program 7 times [2025-04-14 01:38:03,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:38:03,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893676401] [2025-04-14 01:38:03,941 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:38:03,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:38:03,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 01:38:03,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 01:38:03,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:38:03,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:38:05,143 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:38:05,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:38:05,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893676401] [2025-04-14 01:38:05,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893676401] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:38:05,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550021142] [2025-04-14 01:38:05,144 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:38:05,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:38:05,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:38:05,145 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:38:05,146 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:38:05,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 01:38:05,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 01:38:05,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:38:05,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:38:05,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-14 01:38:05,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:38:05,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:38:05,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:38:09,795 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-14 01:38:09,796 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 46 treesize of output 87 [2025-04-14 01:38:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-14 01:38:09,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550021142] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:38:09,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:38:09,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19, 10] total 35 [2025-04-14 01:38:09,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799636841] [2025-04-14 01:38:09,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:38:09,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:38:09,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:38:09,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:38:09,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1235, Unknown=1, NotChecked=0, Total=1332 [2025-04-14 01:38:09,904 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:38:09,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 1153 transitions, 19650 flow. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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:38:09,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:38:09,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:38:09,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:38:13,986 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:38:17,991 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:38:21,998 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:38:26,003 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:38:30,007 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:38:34,010 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:38:38,019 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:38:42,022 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:38:46,029 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:38:50,039 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:38:54,057 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:38:58,066 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:39:02,090 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:39:06,112 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:39:10,119 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:39:14,128 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:39:18,138 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:39:22,167 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:39:26,176 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:39:30,198 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:39:34,207 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:39:38,215 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:39:42,223 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:39:46,264 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:39:50,270 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:39:54,280 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:39:58,290 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:40:00,045 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:40:04,127 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:40:05,217 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:40:09,509 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:40:13,516 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:40:31,469 INFO L116 PetriNetUnfolderBase]: 55419/82867 cut-off events. [2025-04-14 01:40:31,469 INFO L117 PetriNetUnfolderBase]: For 1604781/1604781 co-relation queries the response was YES. [2025-04-14 01:40:33,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589686 conditions, 82867 events. 55419/82867 cut-off events. For 1604781/1604781 co-relation queries the response was YES. Maximal size of possible extension queue 2503. Compared 603363 event pairs, 14540 based on Foata normal form. 2/82849 useless extension candidates. Maximal degree in co-relation 589563. Up to 79608 conditions per place. [2025-04-14 01:40:34,014 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 1142 selfloop transitions, 61 changer transitions 45/1248 dead transitions. [2025-04-14 01:40:34,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 1248 transitions, 22859 flow [2025-04-14 01:40:34,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:40:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:40:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 152 transitions. [2025-04-14 01:40:34,015 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37346437346437344 [2025-04-14 01:40:34,015 INFO L175 Difference]: Start difference. First operand has 404 places, 1153 transitions, 19650 flow. Second operand 11 states and 152 transitions. [2025-04-14 01:40:34,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 1248 transitions, 22859 flow [2025-04-14 01:41:04,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 1248 transitions, 22587 flow, removed 28 selfloop flow, removed 17 redundant places. [2025-04-14 01:41:04,443 INFO L231 Difference]: Finished difference. Result has 394 places, 1137 transitions, 19162 flow [2025-04-14 01:41:04,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=19384, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1092, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=19162, PETRI_PLACES=394, PETRI_TRANSITIONS=1137} [2025-04-14 01:41:04,444 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 359 predicate places. [2025-04-14 01:41:04,444 INFO L485 AbstractCegarLoop]: Abstraction has has 394 places, 1137 transitions, 19162 flow [2025-04-14 01:41:04,444 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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:41:04,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:41:04,444 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:41:04,450 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:41:04,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:41:04,645 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:41:04,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:41:04,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2107365828, now seen corresponding path program 8 times [2025-04-14 01:41:04,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:41:04,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323642012] [2025-04-14 01:41:04,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:41:04,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:41:04,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-14 01:41:04,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 01:41:04,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:41:04,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:41:05,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:41:05,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323642012] [2025-04-14 01:41:05,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323642012] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:41:05,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555262096] [2025-04-14 01:41:05,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:41:05,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:41:05,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:41:05,152 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:41:05,154 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:41:05,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-14 01:41:05,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 01:41:05,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:41:05,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:05,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-14 01:41:05,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:41:05,610 INFO L325 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2025-04-14 01:41:05,611 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 38 [2025-04-14 01:41:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:41:05,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:41:06,028 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-14 01:41:06,028 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 46 treesize of output 87 [2025-04-14 01:41:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:41:06,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555262096] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:41:06,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:41:06,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 38 [2025-04-14 01:41:06,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595425210] [2025-04-14 01:41:06,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:41:06,377 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-14 01:41:06,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:41:06,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-14 01:41:06,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1383, Unknown=0, NotChecked=0, Total=1560 [2025-04-14 01:41:06,378 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:41:06,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 1137 transitions, 19162 flow. Second operand has 40 states, 40 states have (on average 5.325) internal successors, (213), 40 states have internal predecessors, (213), 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:41:06,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:41:06,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:41:06,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:41:11,615 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:41:15,618 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:41:21,640 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:41:27,273 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:41:31,282 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:41:35,296 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:41:41,644 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:41:42,780 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:41:46,826 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:41:50,999 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:41:55,200 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:41:57,483 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:42:18,215 INFO L116 PetriNetUnfolderBase]: 75466/112470 cut-off events. [2025-04-14 01:42:18,216 INFO L117 PetriNetUnfolderBase]: For 2300544/2300544 co-relation queries the response was YES. [2025-04-14 01:42:21,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811702 conditions, 112470 events. 75466/112470 cut-off events. For 2300544/2300544 co-relation queries the response was YES. Maximal size of possible extension queue 3310. Compared 846425 event pairs, 14219 based on Foata normal form. 78/112520 useless extension candidates. Maximal degree in co-relation 811582. Up to 71226 conditions per place. [2025-04-14 01:42:21,806 INFO L140 encePairwiseOnDemand]: 18/37 looper letters, 1117 selfloop transitions, 839 changer transitions 170/2126 dead transitions. [2025-04-14 01:42:21,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 2126 transitions, 35990 flow [2025-04-14 01:42:21,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-14 01:42:21,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2025-04-14 01:42:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 709 transitions. [2025-04-14 01:42:21,808 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29940878378378377 [2025-04-14 01:42:21,808 INFO L175 Difference]: Start difference. First operand has 394 places, 1137 transitions, 19162 flow. Second operand 64 states and 709 transitions. [2025-04-14 01:42:21,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 2126 transitions, 35990 flow [2025-04-14 01:43:18,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 2126 transitions, 35779 flow, removed 9 selfloop flow, removed 13 redundant places. [2025-04-14 01:43:18,261 INFO L231 Difference]: Finished difference. Result has 477 places, 1479 transitions, 27375 flow [2025-04-14 01:43:18,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=18972, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=527, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=27375, PETRI_PLACES=477, PETRI_TRANSITIONS=1479} [2025-04-14 01:43:18,263 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 442 predicate places. [2025-04-14 01:43:18,263 INFO L485 AbstractCegarLoop]: Abstraction has has 477 places, 1479 transitions, 27375 flow [2025-04-14 01:43:18,263 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 5.325) internal successors, (213), 40 states have internal predecessors, (213), 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:43:18,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:43:18,263 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:43:18,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-14 01:43:18,463 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:43:18,464 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:43:18,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:43:18,464 INFO L85 PathProgramCache]: Analyzing trace with hash -597936198, now seen corresponding path program 9 times [2025-04-14 01:43:18,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:43:18,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517819526] [2025-04-14 01:43:18,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:43:18,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:43:18,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-04-14 01:43:18,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 35 statements. [2025-04-14 01:43:18,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:43:18,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:43:18,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:43:18,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517819526] [2025-04-14 01:43:18,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517819526] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:43:18,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515420278] [2025-04-14 01:43:18,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:43:18,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:43:18,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:43:18,919 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:43:18,920 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:43:18,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-04-14 01:43:18,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 35 statements. [2025-04-14 01:43:18,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:43:18,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:43:18,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-14 01:43:18,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:43:19,402 INFO L325 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-04-14 01:43:19,402 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 23 treesize of output 7 [2025-04-14 01:43:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:43:19,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:43:19,762 INFO L325 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-04-14 01:43:19,763 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 46 treesize of output 87 [2025-04-14 01:43:20,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:43:20,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515420278] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:43:20,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:43:20,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 38 [2025-04-14 01:43:20,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776687069] [2025-04-14 01:43:20,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:43:20,078 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-14 01:43:20,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:43:20,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-14 01:43:20,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1364, Unknown=0, NotChecked=0, Total=1560 [2025-04-14 01:43:20,079 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:43:20,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 1479 transitions, 27375 flow. Second operand has 40 states, 40 states have (on average 5.275) internal successors, (211), 40 states have internal predecessors, (211), 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:43:20,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:43:20,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:43:20,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:43:24,208 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:43:28,214 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:43:33,151 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:43:37,161 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:43:43,375 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:44:09,062 INFO L116 PetriNetUnfolderBase]: 62200/93560 cut-off events. [2025-04-14 01:44:09,062 INFO L117 PetriNetUnfolderBase]: For 2359515/2359515 co-relation queries the response was YES. [2025-04-14 01:44:12,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736926 conditions, 93560 events. 62200/93560 cut-off events. For 2359515/2359515 co-relation queries the response was YES. Maximal size of possible extension queue 2990. Compared 703921 event pairs, 14497 based on Foata normal form. 496/94056 useless extension candidates. Maximal degree in co-relation 736776. Up to 70489 conditions per place. [2025-04-14 01:44:12,921 INFO L140 encePairwiseOnDemand]: 20/37 looper letters, 1056 selfloop transitions, 504 changer transitions 347/1907 dead transitions. [2025-04-14 01:44:12,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 1907 transitions, 36212 flow [2025-04-14 01:44:12,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-14 01:44:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-04-14 01:44:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 521 transitions. [2025-04-14 01:44:12,922 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30611045828437133 [2025-04-14 01:44:12,923 INFO L175 Difference]: Start difference. First operand has 477 places, 1479 transitions, 27375 flow. Second operand 46 states and 521 transitions. [2025-04-14 01:44:12,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 1907 transitions, 36212 flow [2025-04-14 01:45:02,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 1907 transitions, 35001 flow, removed 544 selfloop flow, removed 23 redundant places. [2025-04-14 01:45:02,199 INFO L231 Difference]: Finished difference. Result has 494 places, 1171 transitions, 22470 flow [2025-04-14 01:45:02,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=23346, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=473, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=832, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=22470, PETRI_PLACES=494, PETRI_TRANSITIONS=1171} [2025-04-14 01:45:02,200 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 459 predicate places. [2025-04-14 01:45:02,200 INFO L485 AbstractCegarLoop]: Abstraction has has 494 places, 1171 transitions, 22470 flow [2025-04-14 01:45:02,200 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 5.275) internal successors, (211), 40 states have internal predecessors, (211), 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:45:02,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:45:02,200 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:45:02,208 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:45:02,405 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,SelfDestructingSolverStorable20 [2025-04-14 01:45:02,405 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:45:02,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:02,406 INFO L85 PathProgramCache]: Analyzing trace with hash -71848078, now seen corresponding path program 10 times [2025-04-14 01:45:02,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:02,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295169960] [2025-04-14 01:45:02,406 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:45:02,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:02,412 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-14 01:45:02,418 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 01:45:02,418 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:45:02,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:45:02,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:02,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295169960] [2025-04-14 01:45:02,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295169960] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:45:02,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003793390] [2025-04-14 01:45:02,459 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:45:02,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:02,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:45:02,461 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:45:02,463 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:45:02,520 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-14 01:45:02,539 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 01:45:02,539 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:45:02,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:02,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:45:02,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:45:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:45:02,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:45:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:45:02,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003793390] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:45:02,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:45:02,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 9 [2025-04-14 01:45:02,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875679779] [2025-04-14 01:45:02,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:45:02,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:45:02,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:45:02,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:45:02,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:45:02,655 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2025-04-14 01:45:02,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 1171 transitions, 22470 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:45:02,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:45:02,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2025-04-14 01:45:02,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:45:36,494 INFO L116 PetriNetUnfolderBase]: 89652/133924 cut-off events. [2025-04-14 01:45:36,494 INFO L117 PetriNetUnfolderBase]: For 3390064/3390064 co-relation queries the response was YES. [2025-04-14 01:45:40,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052597 conditions, 133924 events. 89652/133924 cut-off events. For 3390064/3390064 co-relation queries the response was YES. Maximal size of possible extension queue 3583. Compared 1025371 event pairs, 19466 based on Foata normal form. 338/134262 useless extension candidates. Maximal degree in co-relation 1052447. Up to 43457 conditions per place. [2025-04-14 01:45:41,412 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 1364 selfloop transitions, 297 changer transitions 138/1799 dead transitions. [2025-04-14 01:45:41,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 1799 transitions, 37750 flow [2025-04-14 01:45:41,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:45:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:45:41,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-04-14 01:45:41,413 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2025-04-14 01:45:41,413 INFO L175 Difference]: Start difference. First operand has 494 places, 1171 transitions, 22470 flow. Second operand 5 states and 105 transitions. [2025-04-14 01:45:41,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 1799 transitions, 37750 flow Received shutdown request... [2025-04-14 01:45:43,192 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:45:43,192 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:45:43,368 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 01:45:43,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-14 01:45:43,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:43,569 WARN L610 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2025-04-14 01:45:43,573 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 01:45:43,573 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 01:45:43,573 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 01:45:43,573 INFO L422 BasicCegarLoop]: Path program histogram: [10, 3, 2, 2, 1, 1, 1, 1, 1] [2025-04-14 01:45:43,581 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:45:43,581 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:45:43,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:45:43 BasicIcfg [2025-04-14 01:45:43,586 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:45:43,586 INFO L158 Benchmark]: Toolchain (without parser) took 780578.22ms. Allocated memory was 155.2MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 107.6MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 5.6GB. Max. memory is 8.0GB. [2025-04-14 01:45:43,587 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 167.8MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:45:43,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.52ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 92.3MB in the end (delta: 15.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-14 01:45:43,587 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.81ms. Allocated memory is still 155.2MB. Free memory was 92.3MB in the beginning and 90.2MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:45:43,587 INFO L158 Benchmark]: Boogie Preprocessor took 40.77ms. Allocated memory is still 155.2MB. Free memory was 90.2MB in the beginning and 87.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:45:43,587 INFO L158 Benchmark]: IcfgBuilder took 618.34ms. Allocated memory is still 155.2MB. Free memory was 87.4MB in the beginning and 85.0MB in the end (delta: 2.4MB). Peak memory consumption was 70.5MB. Max. memory is 8.0GB. [2025-04-14 01:45:43,587 INFO L158 Benchmark]: TraceAbstraction took 779633.99ms. Allocated memory was 155.2MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 85.0MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 5.6GB. Max. memory is 8.0GB. [2025-04-14 01:45:43,588 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 167.8MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.52ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 92.3MB in the end (delta: 15.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.81ms. Allocated memory is still 155.2MB. Free memory was 92.3MB in the beginning and 90.2MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.77ms. Allocated memory is still 155.2MB. Free memory was 90.2MB in the beginning and 87.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 618.34ms. Allocated memory is still 155.2MB. Free memory was 87.4MB in the beginning and 85.0MB in the end (delta: 2.4MB). Peak memory consumption was 70.5MB. Max. memory is 8.0GB. * TraceAbstraction took 779633.99ms. Allocated memory was 155.2MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 85.0MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 5.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 118]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 48 locations, 61 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 779.6s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 737.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 68 mSolverCounterUnknown, 4239 SdHoareTripleChecker+Valid, 280.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4239 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 277.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 217 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 922 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36022 IncrementalHoareTripleChecker+Invalid, 37229 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 922 mSolverCounterUnsat, 0 mSDtfsCounter, 36022 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1420 GetRequests, 666 SyntacticMatches, 5 SemanticMatches, 749 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 40.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27375occurred in iteration=20, InterpolantAutomatonStates: 525, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 36.8s InterpolantComputationTime, 1138 NumberOfCodeBlocks, 1126 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1525 ConstructedInterpolants, 84 QuantifiedInterpolants, 23338 SizeOfPredicates, 195 NumberOfNonLiveVariables, 3867 ConjunctsInSsa, 432 ConjunctsInUnsatCore, 49 InterpolantComputations, 10 PerfectInterpolantSequences, 177/361 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown