/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/parallel-barrier.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:51:53,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:51:53,074 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 00:51:53,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:51:53,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:51:53,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:51:53,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:51:53,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:51:53,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:51:53,095 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:51:53,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:51:53,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:51:53,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:51:53,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:51:53,096 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:51:53,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:51:53,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:51:53,096 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:51:53,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:51:53,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:51:53,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:51:53,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:51:53,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:51:53,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:51:53,097 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:51:53,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:51:53,097 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:51:53,097 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:51:53,097 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:51:53,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:51:53,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:51:53,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:51:53,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:51:53,097 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:51:53,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:51:53,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:51:53,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:51:53,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:51:53,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:51:53,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:51:53,098 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:51:53,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:51:53,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:51:53,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:51:53,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:51:53,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:51:53,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:51:53,098 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 00:51:53,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:51:53,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:51:53,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:51:53,309 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:51:53,310 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:51:53,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-barrier.wvr.c [2025-04-14 00:51:54,595 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c261b486/41d7a04a5d4d49f98e4f72b3518786c8/FLAG975e64134 [2025-04-14 00:51:54,784 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:51:54,785 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier.wvr.c [2025-04-14 00:51:54,791 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c261b486/41d7a04a5d4d49f98e4f72b3518786c8/FLAG975e64134 [2025-04-14 00:51:55,596 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c261b486/41d7a04a5d4d49f98e4f72b3518786c8 [2025-04-14 00:51:55,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:51:55,599 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:51:55,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:51:55,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:51:55,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:51:55,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:51:55" (1/1) ... [2025-04-14 00:51:55,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ffdc3d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:55, skipping insertion in model container [2025-04-14 00:51:55,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:51:55" (1/1) ... [2025-04-14 00:51:55,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:51:55,791 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier.wvr.c[3418,3431] [2025-04-14 00:51:55,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:51:55,807 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:51:55,847 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier.wvr.c[3418,3431] [2025-04-14 00:51:55,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:51:55,862 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:51:55,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:55 WrapperNode [2025-04-14 00:51:55,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:51:55,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:51:55,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:51:55,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:51:55,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:55" (1/1) ... [2025-04-14 00:51:55,879 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:55" (1/1) ... [2025-04-14 00:51:55,899 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 210 [2025-04-14 00:51:55,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:51:55,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:51:55,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:51:55,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:51:55,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:55" (1/1) ... [2025-04-14 00:51:55,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:55" (1/1) ... [2025-04-14 00:51:55,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:55" (1/1) ... [2025-04-14 00:51:55,920 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 00:51:55,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:55" (1/1) ... [2025-04-14 00:51:55,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:55" (1/1) ... [2025-04-14 00:51:55,926 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:55" (1/1) ... [2025-04-14 00:51:55,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:55" (1/1) ... [2025-04-14 00:51:55,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:55" (1/1) ... [2025-04-14 00:51:55,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:55" (1/1) ... [2025-04-14 00:51:55,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:51:55,932 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:51:55,932 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:51:55,932 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:51:55,932 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:55" (1/1) ... [2025-04-14 00:51:55,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:51:55,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:51:55,959 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 00:51:55,962 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 00:51:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:51:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:51:55,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:51:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:51:55,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:51:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:51:55,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:51:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-14 00:51:55,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-14 00:51:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:51:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-14 00:51:55,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-14 00:51:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-14 00:51:55,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-14 00:51:55,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:51:55,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:51:55,980 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 00:51:56,059 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:51:56,061 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:51:56,345 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:51:56,346 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:51:56,346 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:51:56,555 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:51:56,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:51:56 BoogieIcfgContainer [2025-04-14 00:51:56,557 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:51:56,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:51:56,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:51:56,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:51:56,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:51:55" (1/3) ... [2025-04-14 00:51:56,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd7c83a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:51:56, skipping insertion in model container [2025-04-14 00:51:56,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:55" (2/3) ... [2025-04-14 00:51:56,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd7c83a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:51:56, skipping insertion in model container [2025-04-14 00:51:56,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:51:56" (3/3) ... [2025-04-14 00:51:56,563 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-barrier.wvr.c [2025-04-14 00:51:56,572 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:51:56,575 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-barrier.wvr.c that has 7 procedures, 72 locations, 65 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 00:51:56,575 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:51:56,642 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-04-14 00:51:56,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 81 transitions, 228 flow [2025-04-14 00:51:56,708 INFO L116 PetriNetUnfolderBase]: 4/69 cut-off events. [2025-04-14 00:51:56,711 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-14 00:51:56,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 69 events. 4/69 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 119 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 68. Up to 3 conditions per place. [2025-04-14 00:51:56,713 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 81 transitions, 228 flow [2025-04-14 00:51:56,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 68 transitions, 184 flow [2025-04-14 00:51:56,723 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:51:56,730 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;@13f022c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:51:56,730 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-14 00:51:56,754 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:51:56,754 INFO L116 PetriNetUnfolderBase]: 4/67 cut-off events. [2025-04-14 00:51:56,754 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-14 00:51:56,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:56,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:51:56,755 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-14 00:51:56,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:56,761 INFO L85 PathProgramCache]: Analyzing trace with hash -210307564, now seen corresponding path program 1 times [2025-04-14 00:51:56,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:56,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974695158] [2025-04-14 00:51:56,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:51:56,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:56,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-14 00:51:56,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-14 00:51:56,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:51:56,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:57,088 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 00:51:57,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:57,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974695158] [2025-04-14 00:51:57,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974695158] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:57,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:57,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:51:57,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310541857] [2025-04-14 00:51:57,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:57,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:51:57,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:57,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:51:57,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:51:57,114 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 85 [2025-04-14 00:51:57,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:57,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:57,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 85 [2025-04-14 00:51:57,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:02,292 INFO L116 PetriNetUnfolderBase]: 90013/113963 cut-off events. [2025-04-14 00:52:02,293 INFO L117 PetriNetUnfolderBase]: For 7532/7532 co-relation queries the response was YES. [2025-04-14 00:52:02,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239388 conditions, 113963 events. 90013/113963 cut-off events. For 7532/7532 co-relation queries the response was YES. Maximal size of possible extension queue 1716. Compared 564230 event pairs, 53048 based on Foata normal form. 1984/113163 useless extension candidates. Maximal degree in co-relation 238400. Up to 76768 conditions per place. [2025-04-14 00:52:02,963 INFO L140 encePairwiseOnDemand]: 80/85 looper letters, 93 selfloop transitions, 4 changer transitions 0/97 dead transitions. [2025-04-14 00:52:02,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 97 transitions, 457 flow [2025-04-14 00:52:02,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:52:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:52:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-04-14 00:52:02,973 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4549019607843137 [2025-04-14 00:52:02,974 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 184 flow. Second operand 3 states and 116 transitions. [2025-04-14 00:52:02,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 97 transitions, 457 flow [2025-04-14 00:52:03,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 97 transitions, 411 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-04-14 00:52:03,671 INFO L231 Difference]: Finished difference. Result has 74 places, 68 transitions, 166 flow [2025-04-14 00:52:03,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=74, PETRI_TRANSITIONS=68} [2025-04-14 00:52:03,678 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -9 predicate places. [2025-04-14 00:52:03,678 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 166 flow [2025-04-14 00:52:03,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:03,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:03,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:03,679 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:52:03,679 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-14 00:52:03,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:03,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1054167036, now seen corresponding path program 2 times [2025-04-14 00:52:03,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:03,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983646788] [2025-04-14 00:52:03,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:52:03,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:03,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 1 equivalence classes. [2025-04-14 00:52:03,729 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-14 00:52:03,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:52:03,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:03,824 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 00:52:03,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:03,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983646788] [2025-04-14 00:52:03,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983646788] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:03,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:03,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:52:03,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852941110] [2025-04-14 00:52:03,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:03,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:52:03,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:03,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:52:03,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:52:03,828 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 85 [2025-04-14 00:52:03,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:03,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:03,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 85 [2025-04-14 00:52:03,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:07,624 INFO L116 PetriNetUnfolderBase]: 68959/87698 cut-off events. [2025-04-14 00:52:07,624 INFO L117 PetriNetUnfolderBase]: For 4094/4094 co-relation queries the response was YES. [2025-04-14 00:52:07,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182285 conditions, 87698 events. 68959/87698 cut-off events. For 4094/4094 co-relation queries the response was YES. Maximal size of possible extension queue 1272. Compared 420913 event pairs, 40785 based on Foata normal form. 1544/87307 useless extension candidates. Maximal degree in co-relation 80231. Up to 59185 conditions per place. [2025-04-14 00:52:07,927 INFO L140 encePairwiseOnDemand]: 80/85 looper letters, 92 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2025-04-14 00:52:07,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 96 transitions, 429 flow [2025-04-14 00:52:07,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:52:07,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:52:07,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-04-14 00:52:07,929 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2025-04-14 00:52:07,929 INFO L175 Difference]: Start difference. First operand has 74 places, 68 transitions, 166 flow. Second operand 3 states and 115 transitions. [2025-04-14 00:52:07,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 96 transitions, 429 flow [2025-04-14 00:52:07,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 417 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:52:07,970 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 172 flow [2025-04-14 00:52:07,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2025-04-14 00:52:07,971 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, -8 predicate places. [2025-04-14 00:52:07,971 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 172 flow [2025-04-14 00:52:07,971 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:07,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:07,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:07,972 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:52:07,972 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-14 00:52:07,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:07,974 INFO L85 PathProgramCache]: Analyzing trace with hash 687050068, now seen corresponding path program 3 times [2025-04-14 00:52:07,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:07,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133988953] [2025-04-14 00:52:07,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:52:07,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:07,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 1 equivalence classes. [2025-04-14 00:52:08,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-14 00:52:08,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:52:08,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:08,613 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 00:52:08,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:08,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133988953] [2025-04-14 00:52:08,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133988953] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:08,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:08,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-14 00:52:08,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36976542] [2025-04-14 00:52:08,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:08,614 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:52:08,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:08,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:52:08,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:52:08,614 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 85 [2025-04-14 00:52:08,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 172 flow. Second operand has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 0 states have call successors, (0), 0 states 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 00:52:08,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:08,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 85 [2025-04-14 00:52:08,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:14,641 INFO L116 PetriNetUnfolderBase]: 86992/110636 cut-off events. [2025-04-14 00:52:14,641 INFO L117 PetriNetUnfolderBase]: For 6581/6581 co-relation queries the response was YES. [2025-04-14 00:52:14,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234068 conditions, 110636 events. 86992/110636 cut-off events. For 6581/6581 co-relation queries the response was YES. Maximal size of possible extension queue 1456. Compared 534627 event pairs, 26778 based on Foata normal form. 2/107920 useless extension candidates. Maximal degree in co-relation 103425. Up to 88385 conditions per place. [2025-04-14 00:52:15,044 INFO L140 encePairwiseOnDemand]: 64/85 looper letters, 313 selfloop transitions, 94 changer transitions 40/447 dead transitions. [2025-04-14 00:52:15,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 447 transitions, 1986 flow [2025-04-14 00:52:15,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-14 00:52:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-14 00:52:15,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 623 transitions. [2025-04-14 00:52:15,048 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2527383367139959 [2025-04-14 00:52:15,048 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 172 flow. Second operand 29 states and 623 transitions. [2025-04-14 00:52:15,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 447 transitions, 1986 flow [2025-04-14 00:52:15,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 447 transitions, 1954 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:52:15,189 INFO L231 Difference]: Finished difference. Result has 116 places, 158 transitions, 673 flow [2025-04-14 00:52:15,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=673, PETRI_PLACES=116, PETRI_TRANSITIONS=158} [2025-04-14 00:52:15,190 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 33 predicate places. [2025-04-14 00:52:15,190 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 158 transitions, 673 flow [2025-04-14 00:52:15,190 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 0 states have call successors, (0), 0 states 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 00:52:15,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:15,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:15,190 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:52:15,190 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-14 00:52:15,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:15,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1678735544, now seen corresponding path program 4 times [2025-04-14 00:52:15,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:15,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39834807] [2025-04-14 00:52:15,191 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:52:15,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:15,199 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 64 statements into 2 equivalence classes. [2025-04-14 00:52:15,221 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-04-14 00:52:15,221 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:52:15,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:16,017 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 00:52:16,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:16,018 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39834807] [2025-04-14 00:52:16,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39834807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:16,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:16,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-04-14 00:52:16,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452682379] [2025-04-14 00:52:16,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:16,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 00:52:16,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:16,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 00:52:16,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2025-04-14 00:52:16,019 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 85 [2025-04-14 00:52:16,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 158 transitions, 673 flow. Second operand has 17 states, 17 states have (on average 9.764705882352942) internal successors, (166), 17 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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 00:52:16,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:16,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 85 [2025-04-14 00:52:16,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:30,074 INFO L116 PetriNetUnfolderBase]: 158913/201238 cut-off events. [2025-04-14 00:52:30,075 INFO L117 PetriNetUnfolderBase]: For 184133/184133 co-relation queries the response was YES. [2025-04-14 00:52:30,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552341 conditions, 201238 events. 158913/201238 cut-off events. For 184133/184133 co-relation queries the response was YES. Maximal size of possible extension queue 2825. Compared 1041317 event pairs, 29243 based on Foata normal form. 1/196608 useless extension candidates. Maximal degree in co-relation 539074. Up to 122299 conditions per place. [2025-04-14 00:52:31,415 INFO L140 encePairwiseOnDemand]: 62/85 looper letters, 925 selfloop transitions, 416 changer transitions 11/1352 dead transitions. [2025-04-14 00:52:31,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 1352 transitions, 7734 flow [2025-04-14 00:52:31,415 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2025-04-14 00:52:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2025-04-14 00:52:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 1800 transitions. [2025-04-14 00:52:31,425 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.23017902813299232 [2025-04-14 00:52:31,425 INFO L175 Difference]: Start difference. First operand has 116 places, 158 transitions, 673 flow. Second operand 92 states and 1800 transitions. [2025-04-14 00:52:31,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 1352 transitions, 7734 flow [2025-04-14 00:52:34,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 1352 transitions, 7726 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:52:34,532 INFO L231 Difference]: Finished difference. Result has 219 places, 643 transitions, 4466 flow [2025-04-14 00:52:34,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=92, PETRI_FLOW=4466, PETRI_PLACES=219, PETRI_TRANSITIONS=643} [2025-04-14 00:52:34,533 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 136 predicate places. [2025-04-14 00:52:34,533 INFO L485 AbstractCegarLoop]: Abstraction has has 219 places, 643 transitions, 4466 flow [2025-04-14 00:52:34,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.764705882352942) internal successors, (166), 17 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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 00:52:34,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:34,533 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:34,533 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:52:34,533 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-14 00:52:34,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:34,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1716212042, now seen corresponding path program 5 times [2025-04-14 00:52:34,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:34,534 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027854799] [2025-04-14 00:52:34,534 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:52:34,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:34,542 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 64 statements into 1 equivalence classes. [2025-04-14 00:52:34,551 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-14 00:52:34,551 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:52:34,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:35,027 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 00:52:35,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:35,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027854799] [2025-04-14 00:52:35,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027854799] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:35,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:35,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-04-14 00:52:35,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838008891] [2025-04-14 00:52:35,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:35,028 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 00:52:35,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:35,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 00:52:35,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:52:35,028 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 85 [2025-04-14 00:52:35,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 643 transitions, 4466 flow. Second operand has 18 states, 18 states have (on average 9.555555555555555) internal successors, (172), 18 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 00:52:35,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:35,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 85 [2025-04-14 00:52:35,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:55,838 INFO L116 PetriNetUnfolderBase]: 198129/250505 cut-off events. [2025-04-14 00:52:55,838 INFO L117 PetriNetUnfolderBase]: For 807859/807859 co-relation queries the response was YES. [2025-04-14 00:52:57,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860232 conditions, 250505 events. 198129/250505 cut-off events. For 807859/807859 co-relation queries the response was YES. Maximal size of possible extension queue 3596. Compared 1328152 event pairs, 45347 based on Foata normal form. 1/244546 useless extension candidates. Maximal degree in co-relation 851062. Up to 203079 conditions per place. [2025-04-14 00:52:57,853 INFO L140 encePairwiseOnDemand]: 64/85 looper letters, 1111 selfloop transitions, 452 changer transitions 11/1574 dead transitions. [2025-04-14 00:52:57,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 1574 transitions, 12476 flow [2025-04-14 00:52:57,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-14 00:52:57,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2025-04-14 00:52:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 1362 transitions. [2025-04-14 00:52:57,857 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.22254901960784312 [2025-04-14 00:52:57,857 INFO L175 Difference]: Start difference. First operand has 219 places, 643 transitions, 4466 flow. Second operand 72 states and 1362 transitions. [2025-04-14 00:52:57,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 1574 transitions, 12476 flow [2025-04-14 00:54:48,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 1574 transitions, 10832 flow, removed 822 selfloop flow, removed 0 redundant places. [2025-04-14 00:54:48,154 INFO L231 Difference]: Finished difference. Result has 320 places, 1042 transitions, 7484 flow [2025-04-14 00:54:48,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=3024, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=7484, PETRI_PLACES=320, PETRI_TRANSITIONS=1042} [2025-04-14 00:54:48,156 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 237 predicate places. [2025-04-14 00:54:48,156 INFO L485 AbstractCegarLoop]: Abstraction has has 320 places, 1042 transitions, 7484 flow [2025-04-14 00:54:48,156 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.555555555555555) internal successors, (172), 18 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 00:54:48,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:48,156 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:54:48,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:54:48,156 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-04-14 00:54:48,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2093915459, now seen corresponding path program 1 times [2025-04-14 00:54:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:48,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379105228] [2025-04-14 00:54:48,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:54:48,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:48,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-14 00:54:48,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-14 00:54:48,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:54:48,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:48,474 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 00:54:48,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:48,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379105228] [2025-04-14 00:54:48,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379105228] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:54:48,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:54:48,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-04-14 00:54:48,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433443538] [2025-04-14 00:54:48,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:54:48,474 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 00:54:48,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:48,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 00:54:48,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2025-04-14 00:54:48,475 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 85 [2025-04-14 00:54:48,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 1042 transitions, 7484 flow. Second operand has 17 states, 17 states have (on average 9.764705882352942) internal successors, (166), 17 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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 00:54:48,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:48,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 85 [2025-04-14 00:54:48,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand