/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:16:07,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:16:07,154 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:16:07,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:16:07,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:16:07,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:16:07,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:16:07,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:16:07,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:16:07,187 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:16:07,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:16:07,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:16:07,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:16:07,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:16:07,189 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:16:07,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:16:07,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:16:07,189 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:16:07,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:16:07,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:16:07,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:16:07,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:16:07,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:16:07,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:16:07,190 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:16:07,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:16:07,190 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:16:07,190 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:16:07,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:16:07,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:16:07,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:16:07,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:16:07,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:16:07,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:16:07,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:16:07,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:16:07,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:16:07,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:16:07,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:16:07,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:16:07,191 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:16:07,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:16:07,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:16:07,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:16:07,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:16:07,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:16:07,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:16:07,191 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:16:07,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:16:07,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:16:07,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:16:07,409 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:16:07,410 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:16:07,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2025-04-13 20:16:08,699 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e7111455/4bcb4883464c429ca62b3839e81ea72b/FLAGf783b2c11 [2025-04-13 20:16:08,875 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:16:08,875 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2025-04-13 20:16:08,885 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e7111455/4bcb4883464c429ca62b3839e81ea72b/FLAGf783b2c11 [2025-04-13 20:16:09,749 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e7111455/4bcb4883464c429ca62b3839e81ea72b [2025-04-13 20:16:09,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:16:09,751 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:16:09,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:16:09,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:16:09,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:16:09,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:16:09" (1/1) ... [2025-04-13 20:16:09,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184a51b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:09, skipping insertion in model container [2025-04-13 20:16:09,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:16:09" (1/1) ... [2025-04-13 20:16:09,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:16:09,919 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-misc-2.wvr.c[2249,2262] [2025-04-13 20:16:09,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:16:09,930 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:16:09,957 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-misc-2.wvr.c[2249,2262] [2025-04-13 20:16:09,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:16:09,969 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:16:09,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:09 WrapperNode [2025-04-13 20:16:09,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:16:09,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:16:09,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:16:09,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:16:09,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:09" (1/1) ... [2025-04-13 20:16:09,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:09" (1/1) ... [2025-04-13 20:16:09,996 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-04-13 20:16:09,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:16:09,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:16:09,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:16:09,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:16:10,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:09" (1/1) ... [2025-04-13 20:16:10,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:09" (1/1) ... [2025-04-13 20:16:10,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:09" (1/1) ... [2025-04-13 20:16:10,010 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-13 20:16:10,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:09" (1/1) ... [2025-04-13 20:16:10,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:09" (1/1) ... [2025-04-13 20:16:10,013 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:09" (1/1) ... [2025-04-13 20:16:10,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:09" (1/1) ... [2025-04-13 20:16:10,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:09" (1/1) ... [2025-04-13 20:16:10,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:09" (1/1) ... [2025-04-13 20:16:10,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:09" (1/1) ... [2025-04-13 20:16:10,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:16:10,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:16:10,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:16:10,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:16:10,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:09" (1/1) ... [2025-04-13 20:16:10,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:16:10,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:10,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:16:10,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:16:10,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:16:10,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:16:10,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:16:10,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:16:10,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:16:10,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:16:10,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:16:10,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:16:10,064 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:16:10,127 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:16:10,128 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:16:10,269 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:16:10,269 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:16:10,270 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:16:10,397 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:16:10,408 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:16:10,426 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:16:10,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:16:10 BoogieIcfgContainer [2025-04-13 20:16:10,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:16:10,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:16:10,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:16:10,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:16:10,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:16:09" (1/3) ... [2025-04-13 20:16:10,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a39974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:16:10, skipping insertion in model container [2025-04-13 20:16:10,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:09" (2/3) ... [2025-04-13 20:16:10,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a39974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:16:10, skipping insertion in model container [2025-04-13 20:16:10,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:16:10" (3/3) ... [2025-04-13 20:16:10,434 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2025-04-13 20:16:10,444 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:16:10,445 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 23 locations, 30 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 20:16:10,445 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:16:10,488 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 20:16:10,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 32 transitions, 78 flow [2025-04-13 20:16:10,542 INFO L116 PetriNetUnfolderBase]: 10/30 cut-off events. [2025-04-13 20:16:10,543 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:16:10,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 10/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 24. Up to 3 conditions per place. [2025-04-13 20:16:10,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 32 transitions, 78 flow [2025-04-13 20:16:10,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 29 transitions, 70 flow [2025-04-13 20:16:10,555 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:16:10,566 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;@73471725, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:16:10,566 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 20:16:10,573 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:16:10,573 INFO L116 PetriNetUnfolderBase]: 10/28 cut-off events. [2025-04-13 20:16:10,573 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:16:10,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:10,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:10,574 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:10,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:10,577 INFO L85 PathProgramCache]: Analyzing trace with hash 41304879, now seen corresponding path program 1 times [2025-04-13 20:16:10,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:10,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160407043] [2025-04-13 20:16:10,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:10,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:10,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 20:16:10,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 20:16:10,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:10,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:10,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:10,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160407043] [2025-04-13 20:16:10,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160407043] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:10,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:10,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:16:10,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44010961] [2025-04-13 20:16:10,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:10,836 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:10,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:10,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:10,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:10,862 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 20:16:10,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:10,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:10,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 20:16:10,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:11,000 INFO L116 PetriNetUnfolderBase]: 269/392 cut-off events. [2025-04-13 20:16:11,000 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 20:16:11,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 392 events. 269/392 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1221 event pairs, 42 based on Foata normal form. 1/243 useless extension candidates. Maximal degree in co-relation 744. Up to 304 conditions per place. [2025-04-13 20:16:11,006 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 36 selfloop transitions, 7 changer transitions 1/44 dead transitions. [2025-04-13 20:16:11,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 44 transitions, 197 flow [2025-04-13 20:16:11,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-04-13 20:16:11,017 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.53125 [2025-04-13 20:16:11,018 INFO L175 Difference]: Start difference. First operand has 26 places, 29 transitions, 70 flow. Second operand 3 states and 51 transitions. [2025-04-13 20:16:11,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 44 transitions, 197 flow [2025-04-13 20:16:11,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 44 transitions, 183 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:16:11,024 INFO L231 Difference]: Finished difference. Result has 25 places, 33 transitions, 101 flow [2025-04-13 20:16:11,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=25, PETRI_TRANSITIONS=33} [2025-04-13 20:16:11,028 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2025-04-13 20:16:11,028 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 33 transitions, 101 flow [2025-04-13 20:16:11,028 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:11,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:11,029 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:11,029 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:16:11,029 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:11,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:11,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1417739386, now seen corresponding path program 1 times [2025-04-13 20:16:11,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:11,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985433847] [2025-04-13 20:16:11,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:11,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:11,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:16:11,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:16:11,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:11,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:11,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:11,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985433847] [2025-04-13 20:16:11,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985433847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:11,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:11,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:16:11,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649247995] [2025-04-13 20:16:11,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:11,180 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:16:11,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:11,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:16:11,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:16:11,181 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:16:11,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 33 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:11,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:11,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:16:11,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:11,444 INFO L116 PetriNetUnfolderBase]: 335/488 cut-off events. [2025-04-13 20:16:11,444 INFO L117 PetriNetUnfolderBase]: For 34/42 co-relation queries the response was YES. [2025-04-13 20:16:11,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 488 events. 335/488 cut-off events. For 34/42 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1590 event pairs, 43 based on Foata normal form. 4/284 useless extension candidates. Maximal degree in co-relation 468. Up to 233 conditions per place. [2025-04-13 20:16:11,452 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 52 selfloop transitions, 26 changer transitions 5/88 dead transitions. [2025-04-13 20:16:11,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 88 transitions, 400 flow [2025-04-13 20:16:11,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:16:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:16:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-04-13 20:16:11,454 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-04-13 20:16:11,454 INFO L175 Difference]: Start difference. First operand has 25 places, 33 transitions, 101 flow. Second operand 5 states and 106 transitions. [2025-04-13 20:16:11,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 88 transitions, 400 flow [2025-04-13 20:16:11,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 88 transitions, 391 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:11,456 INFO L231 Difference]: Finished difference. Result has 31 places, 55 transitions, 267 flow [2025-04-13 20:16:11,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=31, PETRI_TRANSITIONS=55} [2025-04-13 20:16:11,457 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2025-04-13 20:16:11,457 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 55 transitions, 267 flow [2025-04-13 20:16:11,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:11,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:11,458 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:11,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:16:11,458 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:11,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash 252788906, now seen corresponding path program 2 times [2025-04-13 20:16:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:11,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782518244] [2025-04-13 20:16:11,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:16:11,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:11,470 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:16:11,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:16:11,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:16:11,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:11,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:11,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782518244] [2025-04-13 20:16:11,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782518244] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:11,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:11,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:16:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001693332] [2025-04-13 20:16:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:11,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:16:11,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:11,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:16:11,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:16:11,594 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:16:11,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 55 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:11,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:11,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:16:11,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:11,729 INFO L116 PetriNetUnfolderBase]: 324/476 cut-off events. [2025-04-13 20:16:11,729 INFO L117 PetriNetUnfolderBase]: For 291/351 co-relation queries the response was YES. [2025-04-13 20:16:11,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1515 conditions, 476 events. 324/476 cut-off events. For 291/351 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1586 event pairs, 17 based on Foata normal form. 30/382 useless extension candidates. Maximal degree in co-relation 580. Up to 202 conditions per place. [2025-04-13 20:16:11,734 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 48 selfloop transitions, 31 changer transitions 4/88 dead transitions. [2025-04-13 20:16:11,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 88 transitions, 564 flow [2025-04-13 20:16:11,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:16:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:16:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2025-04-13 20:16:11,735 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.56875 [2025-04-13 20:16:11,735 INFO L175 Difference]: Start difference. First operand has 31 places, 55 transitions, 267 flow. Second operand 5 states and 91 transitions. [2025-04-13 20:16:11,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 88 transitions, 564 flow [2025-04-13 20:16:11,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 88 transitions, 564 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 20:16:11,738 INFO L231 Difference]: Finished difference. Result has 38 places, 64 transitions, 448 flow [2025-04-13 20:16:11,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=448, PETRI_PLACES=38, PETRI_TRANSITIONS=64} [2025-04-13 20:16:11,740 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2025-04-13 20:16:11,740 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 64 transitions, 448 flow [2025-04-13 20:16:11,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:11,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:11,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:11,741 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:16:11,741 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:11,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:11,741 INFO L85 PathProgramCache]: Analyzing trace with hash -624817436, now seen corresponding path program 1 times [2025-04-13 20:16:11,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:11,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453205986] [2025-04-13 20:16:11,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:11,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:11,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:16:11,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:16:11,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:11,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:11,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:11,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453205986] [2025-04-13 20:16:11,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453205986] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:11,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:11,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:16:11,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899674591] [2025-04-13 20:16:11,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:11,831 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:16:11,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:11,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:16:11,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:16:11,832 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:16:11,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 64 transitions, 448 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:11,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:11,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:16:11,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:11,988 INFO L116 PetriNetUnfolderBase]: 336/492 cut-off events. [2025-04-13 20:16:11,988 INFO L117 PetriNetUnfolderBase]: For 813/915 co-relation queries the response was YES. [2025-04-13 20:16:11,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1981 conditions, 492 events. 336/492 cut-off events. For 813/915 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1588 event pairs, 39 based on Foata normal form. 28/407 useless extension candidates. Maximal degree in co-relation 743. Up to 260 conditions per place. [2025-04-13 20:16:11,991 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 57 selfloop transitions, 31 changer transitions 0/93 dead transitions. [2025-04-13 20:16:11,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 93 transitions, 776 flow [2025-04-13 20:16:11,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:16:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:16:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2025-04-13 20:16:11,992 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.58125 [2025-04-13 20:16:11,992 INFO L175 Difference]: Start difference. First operand has 38 places, 64 transitions, 448 flow. Second operand 5 states and 93 transitions. [2025-04-13 20:16:11,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 93 transitions, 776 flow [2025-04-13 20:16:11,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 93 transitions, 757 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:11,998 INFO L231 Difference]: Finished difference. Result has 43 places, 75 transitions, 629 flow [2025-04-13 20:16:11,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=629, PETRI_PLACES=43, PETRI_TRANSITIONS=75} [2025-04-13 20:16:11,999 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2025-04-13 20:16:11,999 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 75 transitions, 629 flow [2025-04-13 20:16:11,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:11,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:11,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:11,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:16:11,999 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:11,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:11,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1819047692, now seen corresponding path program 2 times [2025-04-13 20:16:11,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:12,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930421355] [2025-04-13 20:16:12,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:16:12,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:12,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:16:12,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:16:12,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:16:12,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:12,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:12,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930421355] [2025-04-13 20:16:12,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930421355] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:12,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:12,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:16:12,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892342281] [2025-04-13 20:16:12,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:12,082 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:16:12,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:12,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:16:12,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:16:12,083 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:16:12,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 75 transitions, 629 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:12,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:12,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:16:12,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:12,214 INFO L116 PetriNetUnfolderBase]: 314/470 cut-off events. [2025-04-13 20:16:12,214 INFO L117 PetriNetUnfolderBase]: For 1411/1537 co-relation queries the response was YES. [2025-04-13 20:16:12,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2030 conditions, 470 events. 314/470 cut-off events. For 1411/1537 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1534 event pairs, 15 based on Foata normal form. 35/393 useless extension candidates. Maximal degree in co-relation 1340. Up to 192 conditions per place. [2025-04-13 20:16:12,217 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 63 selfloop transitions, 22 changer transitions 1/91 dead transitions. [2025-04-13 20:16:12,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 91 transitions, 830 flow [2025-04-13 20:16:12,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:16:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:16:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2025-04-13 20:16:12,218 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-04-13 20:16:12,218 INFO L175 Difference]: Start difference. First operand has 43 places, 75 transitions, 629 flow. Second operand 5 states and 90 transitions. [2025-04-13 20:16:12,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 91 transitions, 830 flow [2025-04-13 20:16:12,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 91 transitions, 799 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:12,223 INFO L231 Difference]: Finished difference. Result has 47 places, 69 transitions, 588 flow [2025-04-13 20:16:12,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=588, PETRI_PLACES=47, PETRI_TRANSITIONS=69} [2025-04-13 20:16:12,224 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2025-04-13 20:16:12,224 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 69 transitions, 588 flow [2025-04-13 20:16:12,224 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:12,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:12,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:12,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:16:12,224 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:12,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:12,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1216073699, now seen corresponding path program 1 times [2025-04-13 20:16:12,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:12,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682581662] [2025-04-13 20:16:12,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:12,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:12,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:16:12,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:16:12,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:12,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:12,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:12,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682581662] [2025-04-13 20:16:12,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682581662] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:12,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:12,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:16:12,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413539608] [2025-04-13 20:16:12,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:12,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:16:12,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:12,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:16:12,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:16:12,431 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 20:16:12,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 69 transitions, 588 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-13 20:16:12,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:12,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 20:16:12,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:12,582 INFO L116 PetriNetUnfolderBase]: 471/674 cut-off events. [2025-04-13 20:16:12,582 INFO L117 PetriNetUnfolderBase]: For 2003/2003 co-relation queries the response was YES. [2025-04-13 20:16:12,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 674 events. 471/674 cut-off events. For 2003/2003 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2178 event pairs, 20 based on Foata normal form. 22/541 useless extension candidates. Maximal degree in co-relation 2043. Up to 341 conditions per place. [2025-04-13 20:16:12,586 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 83 selfloop transitions, 21 changer transitions 0/104 dead transitions. [2025-04-13 20:16:12,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 104 transitions, 1049 flow [2025-04-13 20:16:12,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:16:12,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:16:12,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2025-04-13 20:16:12,588 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-04-13 20:16:12,588 INFO L175 Difference]: Start difference. First operand has 47 places, 69 transitions, 588 flow. Second operand 5 states and 70 transitions. [2025-04-13 20:16:12,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 104 transitions, 1049 flow [2025-04-13 20:16:12,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 104 transitions, 1006 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-13 20:16:12,593 INFO L231 Difference]: Finished difference. Result has 50 places, 78 transitions, 708 flow [2025-04-13 20:16:12,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=708, PETRI_PLACES=50, PETRI_TRANSITIONS=78} [2025-04-13 20:16:12,595 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 24 predicate places. [2025-04-13 20:16:12,595 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 78 transitions, 708 flow [2025-04-13 20:16:12,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-13 20:16:12,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:12,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:12,596 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:16:12,596 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:12,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:12,596 INFO L85 PathProgramCache]: Analyzing trace with hash -245269427, now seen corresponding path program 2 times [2025-04-13 20:16:12,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:12,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466200592] [2025-04-13 20:16:12,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:16:12,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:12,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:16:12,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:16:12,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:16:12,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:12,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:12,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466200592] [2025-04-13 20:16:12,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466200592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:12,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:12,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:16:12,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222672112] [2025-04-13 20:16:12,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:12,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:16:12,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:12,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:16:12,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:16:12,764 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 20:16:12,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 78 transitions, 708 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-13 20:16:12,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:12,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 20:16:12,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:12,956 INFO L116 PetriNetUnfolderBase]: 569/816 cut-off events. [2025-04-13 20:16:12,956 INFO L117 PetriNetUnfolderBase]: For 2616/2616 co-relation queries the response was YES. [2025-04-13 20:16:12,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4131 conditions, 816 events. 569/816 cut-off events. For 2616/2616 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2723 event pairs, 59 based on Foata normal form. 36/657 useless extension candidates. Maximal degree in co-relation 3785. Up to 562 conditions per place. [2025-04-13 20:16:12,962 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 75 selfloop transitions, 31 changer transitions 0/106 dead transitions. [2025-04-13 20:16:12,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 106 transitions, 1132 flow [2025-04-13 20:16:12,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:16:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:16:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2025-04-13 20:16:12,963 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41875 [2025-04-13 20:16:12,963 INFO L175 Difference]: Start difference. First operand has 50 places, 78 transitions, 708 flow. Second operand 5 states and 67 transitions. [2025-04-13 20:16:12,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 106 transitions, 1132 flow [2025-04-13 20:16:12,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 106 transitions, 1102 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 20:16:12,970 INFO L231 Difference]: Finished difference. Result has 54 places, 92 transitions, 937 flow [2025-04-13 20:16:12,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=937, PETRI_PLACES=54, PETRI_TRANSITIONS=92} [2025-04-13 20:16:12,971 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2025-04-13 20:16:12,971 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 92 transitions, 937 flow [2025-04-13 20:16:12,971 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-13 20:16:12,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:12,971 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:12,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:16:12,971 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:12,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:12,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1418840536, now seen corresponding path program 1 times [2025-04-13 20:16:12,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:12,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660658116] [2025-04-13 20:16:12,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:12,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:12,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:16:12,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:16:12,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:12,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:13,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:13,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660658116] [2025-04-13 20:16:13,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660658116] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:13,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:13,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:13,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261438785] [2025-04-13 20:16:13,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:13,063 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:13,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:13,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:13,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:13,064 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:16:13,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 92 transitions, 937 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:13,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:13,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:16:13,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:13,197 INFO L116 PetriNetUnfolderBase]: 574/866 cut-off events. [2025-04-13 20:16:13,197 INFO L117 PetriNetUnfolderBase]: For 3776/3800 co-relation queries the response was YES. [2025-04-13 20:16:13,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4835 conditions, 866 events. 574/866 cut-off events. For 3776/3800 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3341 event pairs, 96 based on Foata normal form. 4/680 useless extension candidates. Maximal degree in co-relation 4401. Up to 548 conditions per place. [2025-04-13 20:16:13,204 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 102 selfloop transitions, 24 changer transitions 0/133 dead transitions. [2025-04-13 20:16:13,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 133 transitions, 1630 flow [2025-04-13 20:16:13,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-04-13 20:16:13,205 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-04-13 20:16:13,205 INFO L175 Difference]: Start difference. First operand has 54 places, 92 transitions, 937 flow. Second operand 3 states and 54 transitions. [2025-04-13 20:16:13,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 133 transitions, 1630 flow [2025-04-13 20:16:13,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 133 transitions, 1597 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:13,213 INFO L231 Difference]: Finished difference. Result has 56 places, 103 transitions, 1134 flow [2025-04-13 20:16:13,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1134, PETRI_PLACES=56, PETRI_TRANSITIONS=103} [2025-04-13 20:16:13,214 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 30 predicate places. [2025-04-13 20:16:13,214 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 103 transitions, 1134 flow [2025-04-13 20:16:13,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:13,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:13,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:13,214 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:16:13,214 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:13,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:13,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1405679514, now seen corresponding path program 1 times [2025-04-13 20:16:13,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:13,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818360384] [2025-04-13 20:16:13,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:13,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:13,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:16:13,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:16:13,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:13,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:13,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:13,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818360384] [2025-04-13 20:16:13,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818360384] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:13,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:13,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:16:13,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518912818] [2025-04-13 20:16:13,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:13,397 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:16:13,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:13,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:16:13,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:16:13,406 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 20:16:13,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 103 transitions, 1134 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:13,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:13,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 20:16:13,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:13,710 INFO L116 PetriNetUnfolderBase]: 724/1048 cut-off events. [2025-04-13 20:16:13,710 INFO L117 PetriNetUnfolderBase]: For 6402/6402 co-relation queries the response was YES. [2025-04-13 20:16:13,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6083 conditions, 1048 events. 724/1048 cut-off events. For 6402/6402 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3830 event pairs, 35 based on Foata normal form. 15/921 useless extension candidates. Maximal degree in co-relation 5546. Up to 848 conditions per place. [2025-04-13 20:16:13,716 INFO L140 encePairwiseOnDemand]: 14/32 looper letters, 88 selfloop transitions, 27 changer transitions 8/123 dead transitions. [2025-04-13 20:16:13,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 123 transitions, 1467 flow [2025-04-13 20:16:13,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:16:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:16:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2025-04-13 20:16:13,717 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36607142857142855 [2025-04-13 20:16:13,717 INFO L175 Difference]: Start difference. First operand has 56 places, 103 transitions, 1134 flow. Second operand 7 states and 82 transitions. [2025-04-13 20:16:13,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 123 transitions, 1467 flow [2025-04-13 20:16:13,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 123 transitions, 1442 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:13,724 INFO L231 Difference]: Finished difference. Result has 62 places, 101 transitions, 1152 flow [2025-04-13 20:16:13,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1152, PETRI_PLACES=62, PETRI_TRANSITIONS=101} [2025-04-13 20:16:13,724 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 36 predicate places. [2025-04-13 20:16:13,724 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 101 transitions, 1152 flow [2025-04-13 20:16:13,724 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:13,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:13,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:13,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:16:13,725 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:13,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:13,725 INFO L85 PathProgramCache]: Analyzing trace with hash 85620518, now seen corresponding path program 1 times [2025-04-13 20:16:13,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:13,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294635456] [2025-04-13 20:16:13,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:13,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:13,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:16:13,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:16:13,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:13,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:13,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:13,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294635456] [2025-04-13 20:16:13,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294635456] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:13,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:13,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:16:13,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426024928] [2025-04-13 20:16:13,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:13,813 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:16:13,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:13,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:16:13,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:16:13,813 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:16:13,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 101 transitions, 1152 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-13 20:16:13,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:13,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:16:13,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:13,972 INFO L116 PetriNetUnfolderBase]: 657/992 cut-off events. [2025-04-13 20:16:13,973 INFO L117 PetriNetUnfolderBase]: For 6503/6591 co-relation queries the response was YES. [2025-04-13 20:16:13,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5855 conditions, 992 events. 657/992 cut-off events. For 6503/6591 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3913 event pairs, 61 based on Foata normal form. 40/820 useless extension candidates. Maximal degree in co-relation 5505. Up to 588 conditions per place. [2025-04-13 20:16:13,978 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 92 selfloop transitions, 37 changer transitions 0/136 dead transitions. [2025-04-13 20:16:13,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 136 transitions, 1719 flow [2025-04-13 20:16:13,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:16:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:16:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2025-04-13 20:16:13,980 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.578125 [2025-04-13 20:16:13,980 INFO L175 Difference]: Start difference. First operand has 62 places, 101 transitions, 1152 flow. Second operand 4 states and 74 transitions. [2025-04-13 20:16:13,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 136 transitions, 1719 flow [2025-04-13 20:16:13,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 136 transitions, 1662 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-04-13 20:16:13,989 INFO L231 Difference]: Finished difference. Result has 59 places, 117 transitions, 1407 flow [2025-04-13 20:16:13,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1407, PETRI_PLACES=59, PETRI_TRANSITIONS=117} [2025-04-13 20:16:13,989 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 33 predicate places. [2025-04-13 20:16:13,989 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 117 transitions, 1407 flow [2025-04-13 20:16:13,989 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-13 20:16:13,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:13,989 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:13,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:16:13,990 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:13,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:13,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2093027744, now seen corresponding path program 1 times [2025-04-13 20:16:13,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:13,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697654114] [2025-04-13 20:16:13,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:13,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:13,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:16:14,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:16:14,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:14,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:14,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:14,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697654114] [2025-04-13 20:16:14,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697654114] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:14,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:14,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:14,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102672406] [2025-04-13 20:16:14,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:14,063 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:14,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:14,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:14,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:14,063 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:16:14,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 117 transitions, 1407 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:14,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:14,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:16:14,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:14,170 INFO L116 PetriNetUnfolderBase]: 596/929 cut-off events. [2025-04-13 20:16:14,170 INFO L117 PetriNetUnfolderBase]: For 7015/7051 co-relation queries the response was YES. [2025-04-13 20:16:14,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5561 conditions, 929 events. 596/929 cut-off events. For 7015/7051 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3802 event pairs, 132 based on Foata normal form. 36/811 useless extension candidates. Maximal degree in co-relation 5075. Up to 521 conditions per place. [2025-04-13 20:16:14,175 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 91 selfloop transitions, 31 changer transitions 0/129 dead transitions. [2025-04-13 20:16:14,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 129 transitions, 1791 flow [2025-04-13 20:16:14,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:14,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-13 20:16:14,176 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2025-04-13 20:16:14,176 INFO L175 Difference]: Start difference. First operand has 59 places, 117 transitions, 1407 flow. Second operand 3 states and 47 transitions. [2025-04-13 20:16:14,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 129 transitions, 1791 flow [2025-04-13 20:16:14,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 129 transitions, 1724 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-04-13 20:16:14,185 INFO L231 Difference]: Finished difference. Result has 59 places, 106 transitions, 1261 flow [2025-04-13 20:16:14,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1199, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1261, PETRI_PLACES=59, PETRI_TRANSITIONS=106} [2025-04-13 20:16:14,186 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 33 predicate places. [2025-04-13 20:16:14,186 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 106 transitions, 1261 flow [2025-04-13 20:16:14,186 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:14,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:14,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:14,186 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:16:14,186 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:14,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:14,186 INFO L85 PathProgramCache]: Analyzing trace with hash -692253563, now seen corresponding path program 1 times [2025-04-13 20:16:14,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:14,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438598365] [2025-04-13 20:16:14,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:14,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:14,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:16:14,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:16:14,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:14,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:14,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:14,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438598365] [2025-04-13 20:16:14,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438598365] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:14,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:14,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:16:14,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244328216] [2025-04-13 20:16:14,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:14,272 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:16:14,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:14,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:16:14,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:16:14,273 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:16:14,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 106 transitions, 1261 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-13 20:16:14,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:14,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:16:14,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:14,407 INFO L116 PetriNetUnfolderBase]: 623/974 cut-off events. [2025-04-13 20:16:14,407 INFO L117 PetriNetUnfolderBase]: For 8596/8652 co-relation queries the response was YES. [2025-04-13 20:16:14,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5845 conditions, 974 events. 623/974 cut-off events. For 8596/8652 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4052 event pairs, 46 based on Foata normal form. 66/953 useless extension candidates. Maximal degree in co-relation 5285. Up to 542 conditions per place. [2025-04-13 20:16:14,412 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 93 selfloop transitions, 30 changer transitions 0/130 dead transitions. [2025-04-13 20:16:14,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 130 transitions, 1732 flow [2025-04-13 20:16:14,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:16:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:16:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-04-13 20:16:14,413 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.546875 [2025-04-13 20:16:14,413 INFO L175 Difference]: Start difference. First operand has 59 places, 106 transitions, 1261 flow. Second operand 4 states and 70 transitions. [2025-04-13 20:16:14,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 130 transitions, 1732 flow [2025-04-13 20:16:14,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 130 transitions, 1662 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:16:14,423 INFO L231 Difference]: Finished difference. Result has 61 places, 112 transitions, 1381 flow [2025-04-13 20:16:14,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1199, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1381, PETRI_PLACES=61, PETRI_TRANSITIONS=112} [2025-04-13 20:16:14,424 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 35 predicate places. [2025-04-13 20:16:14,424 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 112 transitions, 1381 flow [2025-04-13 20:16:14,425 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-13 20:16:14,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:14,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:14,425 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:16:14,425 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:14,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:14,426 INFO L85 PathProgramCache]: Analyzing trace with hash 389640443, now seen corresponding path program 1 times [2025-04-13 20:16:14,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:14,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994548749] [2025-04-13 20:16:14,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:14,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:14,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:16:14,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:16:14,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:14,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:14,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:14,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994548749] [2025-04-13 20:16:14,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994548749] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:14,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:14,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:16:14,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057215778] [2025-04-13 20:16:14,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:14,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:16:14,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:14,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:16:14,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:16:14,565 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 20:16:14,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 112 transitions, 1381 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:14,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:14,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 20:16:14,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:14,759 INFO L116 PetriNetUnfolderBase]: 737/1096 cut-off events. [2025-04-13 20:16:14,759 INFO L117 PetriNetUnfolderBase]: For 8645/8645 co-relation queries the response was YES. [2025-04-13 20:16:14,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6810 conditions, 1096 events. 737/1096 cut-off events. For 8645/8645 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4177 event pairs, 59 based on Foata normal form. 6/931 useless extension candidates. Maximal degree in co-relation 6131. Up to 909 conditions per place. [2025-04-13 20:16:14,765 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 95 selfloop transitions, 23 changer transitions 5/123 dead transitions. [2025-04-13 20:16:14,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 123 transitions, 1627 flow [2025-04-13 20:16:14,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:16:14,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:16:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2025-04-13 20:16:14,767 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3392857142857143 [2025-04-13 20:16:14,767 INFO L175 Difference]: Start difference. First operand has 61 places, 112 transitions, 1381 flow. Second operand 7 states and 76 transitions. [2025-04-13 20:16:14,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 123 transitions, 1627 flow [2025-04-13 20:16:14,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 123 transitions, 1558 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-04-13 20:16:14,775 INFO L231 Difference]: Finished difference. Result has 66 places, 104 transitions, 1258 flow [2025-04-13 20:16:14,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1258, PETRI_PLACES=66, PETRI_TRANSITIONS=104} [2025-04-13 20:16:14,777 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 40 predicate places. [2025-04-13 20:16:14,777 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 104 transitions, 1258 flow [2025-04-13 20:16:14,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:14,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:14,777 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-13 20:16:14,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:16:14,778 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:14,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:14,778 INFO L85 PathProgramCache]: Analyzing trace with hash 529955690, now seen corresponding path program 1 times [2025-04-13 20:16:14,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:14,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302648289] [2025-04-13 20:16:14,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:14,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:14,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:16:14,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:16:14,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:14,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:14,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:14,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:14,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302648289] [2025-04-13 20:16:14,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302648289] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:14,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:14,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:16:14,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290190285] [2025-04-13 20:16:14,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:14,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:16:14,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:14,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:16:14,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:16:14,900 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 20:16:14,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 104 transitions, 1258 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:14,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:14,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 20:16:14,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:15,261 INFO L116 PetriNetUnfolderBase]: 1493/2307 cut-off events. [2025-04-13 20:16:15,261 INFO L117 PetriNetUnfolderBase]: For 18379/18379 co-relation queries the response was YES. [2025-04-13 20:16:15,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12930 conditions, 2307 events. 1493/2307 cut-off events. For 18379/18379 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10638 event pairs, 178 based on Foata normal form. 1/2031 useless extension candidates. Maximal degree in co-relation 12692. Up to 1028 conditions per place. [2025-04-13 20:16:15,288 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 238 selfloop transitions, 24 changer transitions 7/269 dead transitions. [2025-04-13 20:16:15,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 269 transitions, 3674 flow [2025-04-13 20:16:15,289 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:16:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:16:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2025-04-13 20:16:15,290 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5520833333333334 [2025-04-13 20:16:15,290 INFO L175 Difference]: Start difference. First operand has 66 places, 104 transitions, 1258 flow. Second operand 6 states and 106 transitions. [2025-04-13 20:16:15,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 269 transitions, 3674 flow [2025-04-13 20:16:15,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 269 transitions, 3594 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-13 20:16:15,308 INFO L231 Difference]: Finished difference. Result has 65 places, 117 transitions, 1335 flow [2025-04-13 20:16:15,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1335, PETRI_PLACES=65, PETRI_TRANSITIONS=117} [2025-04-13 20:16:15,308 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2025-04-13 20:16:15,308 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 117 transitions, 1335 flow [2025-04-13 20:16:15,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:15,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:15,308 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-13 20:16:15,309 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 20:16:15,309 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:15,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:15,309 INFO L85 PathProgramCache]: Analyzing trace with hash 945002098, now seen corresponding path program 1 times [2025-04-13 20:16:15,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:15,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241943992] [2025-04-13 20:16:15,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:15,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:15,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:16:15,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:16:15,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:15,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:15,407 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-13 20:16:15,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:15,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241943992] [2025-04-13 20:16:15,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241943992] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:16:15,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585675687] [2025-04-13 20:16:15,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:15,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:15,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:15,409 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:16:15,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:16:15,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:16:15,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:16:15,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:15,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:15,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:16:15,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:16:15,520 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-13 20:16:15,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:16:15,570 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-13 20:16:15,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585675687] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:16:15,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:16:15,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-13 20:16:15,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517235569] [2025-04-13 20:16:15,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:16:15,570 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:16:15,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:15,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:16:15,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:16:15,574 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 20:16:15,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 117 transitions, 1335 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:15,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:15,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 20:16:15,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:15,856 INFO L116 PetriNetUnfolderBase]: 1797/2802 cut-off events. [2025-04-13 20:16:15,856 INFO L117 PetriNetUnfolderBase]: For 22074/22074 co-relation queries the response was YES. [2025-04-13 20:16:15,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15991 conditions, 2802 events. 1797/2802 cut-off events. For 22074/22074 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13666 event pairs, 182 based on Foata normal form. 1/2464 useless extension candidates. Maximal degree in co-relation 13700. Up to 2137 conditions per place. [2025-04-13 20:16:15,872 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 181 selfloop transitions, 27 changer transitions 5/213 dead transitions. [2025-04-13 20:16:15,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 213 transitions, 2729 flow [2025-04-13 20:16:15,873 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:16:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:16:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2025-04-13 20:16:15,874 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5375 [2025-04-13 20:16:15,874 INFO L175 Difference]: Start difference. First operand has 65 places, 117 transitions, 1335 flow. Second operand 5 states and 86 transitions. [2025-04-13 20:16:15,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 213 transitions, 2729 flow [2025-04-13 20:16:15,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 213 transitions, 2679 flow, removed 25 selfloop flow, removed 0 redundant places. [2025-04-13 20:16:15,911 INFO L231 Difference]: Finished difference. Result has 72 places, 133 transitions, 1502 flow [2025-04-13 20:16:15,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1502, PETRI_PLACES=72, PETRI_TRANSITIONS=133} [2025-04-13 20:16:15,911 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 46 predicate places. [2025-04-13 20:16:15,911 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 133 transitions, 1502 flow [2025-04-13 20:16:15,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:15,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:15,911 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:15,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 20:16:16,116 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 20:16:16,116 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:16,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash 944048786, now seen corresponding path program 1 times [2025-04-13 20:16:16,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:16,118 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453968300] [2025-04-13 20:16:16,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:16,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:16,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:16:16,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:16:16,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:16,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:16,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:16,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:16,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453968300] [2025-04-13 20:16:16,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453968300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:16,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:16,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:16,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244113500] [2025-04-13 20:16:16,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:16,170 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:16,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:16,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:16,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:16,170 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:16:16,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 133 transitions, 1502 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:16,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:16,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:16:16,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:16,336 INFO L116 PetriNetUnfolderBase]: 1258/2148 cut-off events. [2025-04-13 20:16:16,336 INFO L117 PetriNetUnfolderBase]: For 21955/22177 co-relation queries the response was YES. [2025-04-13 20:16:16,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12411 conditions, 2148 events. 1258/2148 cut-off events. For 21955/22177 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11693 event pairs, 311 based on Foata normal form. 8/1986 useless extension candidates. Maximal degree in co-relation 10510. Up to 1315 conditions per place. [2025-04-13 20:16:16,346 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 120 selfloop transitions, 25 changer transitions 0/165 dead transitions. [2025-04-13 20:16:16,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 165 transitions, 2065 flow [2025-04-13 20:16:16,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-04-13 20:16:16,347 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.53125 [2025-04-13 20:16:16,347 INFO L175 Difference]: Start difference. First operand has 72 places, 133 transitions, 1502 flow. Second operand 3 states and 51 transitions. [2025-04-13 20:16:16,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 165 transitions, 2065 flow [2025-04-13 20:16:16,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 165 transitions, 2043 flow, removed 11 selfloop flow, removed 0 redundant places. [2025-04-13 20:16:16,361 INFO L231 Difference]: Finished difference. Result has 74 places, 123 transitions, 1397 flow [2025-04-13 20:16:16,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1397, PETRI_PLACES=74, PETRI_TRANSITIONS=123} [2025-04-13 20:16:16,362 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 48 predicate places. [2025-04-13 20:16:16,362 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 123 transitions, 1397 flow [2025-04-13 20:16:16,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:16,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:16,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:16,362 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 20:16:16,362 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:16,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:16,363 INFO L85 PathProgramCache]: Analyzing trace with hash -127912456, now seen corresponding path program 2 times [2025-04-13 20:16:16,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:16,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095520758] [2025-04-13 20:16:16,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:16:16,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:16,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:16:16,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:16:16,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:16:16,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:16,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:16,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095520758] [2025-04-13 20:16:16,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095520758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:16,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:16,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:16:16,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758296731] [2025-04-13 20:16:16,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:16,490 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:16:16,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:16,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:16:16,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:16:16,493 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 20:16:16,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 123 transitions, 1397 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:16,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:16,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 20:16:16,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:16,975 INFO L116 PetriNetUnfolderBase]: 2387/3827 cut-off events. [2025-04-13 20:16:16,975 INFO L117 PetriNetUnfolderBase]: For 38329/38329 co-relation queries the response was YES. [2025-04-13 20:16:16,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22057 conditions, 3827 events. 2387/3827 cut-off events. For 38329/38329 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 21285 event pairs, 222 based on Foata normal form. 1/3548 useless extension candidates. Maximal degree in co-relation 18642. Up to 1786 conditions per place. [2025-04-13 20:16:16,995 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 279 selfloop transitions, 41 changer transitions 8/328 dead transitions. [2025-04-13 20:16:16,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 328 transitions, 4484 flow [2025-04-13 20:16:16,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:16:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:16:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2025-04-13 20:16:16,997 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6302083333333334 [2025-04-13 20:16:16,997 INFO L175 Difference]: Start difference. First operand has 74 places, 123 transitions, 1397 flow. Second operand 6 states and 121 transitions. [2025-04-13 20:16:16,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 328 transitions, 4484 flow [2025-04-13 20:16:17,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 328 transitions, 4298 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-04-13 20:16:17,023 INFO L231 Difference]: Finished difference. Result has 78 places, 138 transitions, 1549 flow [2025-04-13 20:16:17,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1549, PETRI_PLACES=78, PETRI_TRANSITIONS=138} [2025-04-13 20:16:17,024 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 52 predicate places. [2025-04-13 20:16:17,024 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 138 transitions, 1549 flow [2025-04-13 20:16:17,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:17,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:17,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:17,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 20:16:17,024 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:17,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:17,025 INFO L85 PathProgramCache]: Analyzing trace with hash 458448528, now seen corresponding path program 1 times [2025-04-13 20:16:17,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:17,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050060715] [2025-04-13 20:16:17,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:17,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:17,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:16:17,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:16:17,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:17,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:17,122 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-13 20:16:17,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:17,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050060715] [2025-04-13 20:16:17,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050060715] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:16:17,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517994405] [2025-04-13 20:16:17,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:17,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:17,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:17,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:16:17,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:16:17,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:16:17,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:16:17,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:17,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:17,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:16:17,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:16:17,207 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-13 20:16:17,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:16:17,247 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-13 20:16:17,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517994405] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:16:17,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:16:17,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-13 20:16:17,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152827954] [2025-04-13 20:16:17,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:16:17,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:16:17,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:17,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:16:17,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:16:17,255 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 20:16:17,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 138 transitions, 1549 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:17,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:17,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 20:16:17,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:17,630 INFO L116 PetriNetUnfolderBase]: 2665/4298 cut-off events. [2025-04-13 20:16:17,631 INFO L117 PetriNetUnfolderBase]: For 38851/38851 co-relation queries the response was YES. [2025-04-13 20:16:17,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24535 conditions, 4298 events. 2665/4298 cut-off events. For 38851/38851 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 24604 event pairs, 380 based on Foata normal form. 1/3915 useless extension candidates. Maximal degree in co-relation 20803. Up to 3698 conditions per place. [2025-04-13 20:16:17,647 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 198 selfloop transitions, 31 changer transitions 5/234 dead transitions. [2025-04-13 20:16:17,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 234 transitions, 2968 flow [2025-04-13 20:16:17,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:16:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:16:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-04-13 20:16:17,648 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-04-13 20:16:17,648 INFO L175 Difference]: Start difference. First operand has 78 places, 138 transitions, 1549 flow. Second operand 5 states and 84 transitions. [2025-04-13 20:16:17,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 234 transitions, 2968 flow [2025-04-13 20:16:17,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 234 transitions, 2902 flow, removed 33 selfloop flow, removed 0 redundant places. [2025-04-13 20:16:17,672 INFO L231 Difference]: Finished difference. Result has 85 places, 158 transitions, 1776 flow [2025-04-13 20:16:17,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1776, PETRI_PLACES=85, PETRI_TRANSITIONS=158} [2025-04-13 20:16:17,673 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 59 predicate places. [2025-04-13 20:16:17,673 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 158 transitions, 1776 flow [2025-04-13 20:16:17,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:17,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:17,673 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-13 20:16:17,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 20:16:17,877 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,SelfDestructingSolverStorable17 [2025-04-13 20:16:17,877 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:17,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:17,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1312241506, now seen corresponding path program 2 times [2025-04-13 20:16:17,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:17,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57683133] [2025-04-13 20:16:17,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:16:17,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:17,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:16:17,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:16:17,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:16:17,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:17,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:17,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57683133] [2025-04-13 20:16:17,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57683133] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:17,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:17,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:16:17,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72669900] [2025-04-13 20:16:17,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:17,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:16:17,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:17,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:16:17,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:16:17,965 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 20:16:17,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 158 transitions, 1776 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:17,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:17,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 20:16:17,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:18,541 INFO L116 PetriNetUnfolderBase]: 3834/6208 cut-off events. [2025-04-13 20:16:18,541 INFO L117 PetriNetUnfolderBase]: For 59091/59091 co-relation queries the response was YES. [2025-04-13 20:16:18,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35435 conditions, 6208 events. 3834/6208 cut-off events. For 59091/59091 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 38442 event pairs, 481 based on Foata normal form. 1/5714 useless extension candidates. Maximal degree in co-relation 29638. Up to 3128 conditions per place. [2025-04-13 20:16:18,570 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 296 selfloop transitions, 73 changer transitions 8/377 dead transitions. [2025-04-13 20:16:18,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 377 transitions, 4992 flow [2025-04-13 20:16:18,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:16:18,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:16:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-04-13 20:16:18,572 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-04-13 20:16:18,572 INFO L175 Difference]: Start difference. First operand has 85 places, 158 transitions, 1776 flow. Second operand 6 states and 116 transitions. [2025-04-13 20:16:18,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 377 transitions, 4992 flow [2025-04-13 20:16:18,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 377 transitions, 4982 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-04-13 20:16:18,611 INFO L231 Difference]: Finished difference. Result has 94 places, 191 transitions, 2340 flow [2025-04-13 20:16:18,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2340, PETRI_PLACES=94, PETRI_TRANSITIONS=191} [2025-04-13 20:16:18,612 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 68 predicate places. [2025-04-13 20:16:18,612 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 191 transitions, 2340 flow [2025-04-13 20:16:18,612 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:18,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:18,612 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-13 20:16:18,612 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 20:16:18,612 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:18,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:18,613 INFO L85 PathProgramCache]: Analyzing trace with hash 756932464, now seen corresponding path program 1 times [2025-04-13 20:16:18,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:18,613 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069085185] [2025-04-13 20:16:18,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:18,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:18,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:16:18,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:16:18,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:18,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:18,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:18,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069085185] [2025-04-13 20:16:18,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069085185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:18,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:18,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:16:18,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204737281] [2025-04-13 20:16:18,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:18,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:16:18,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:18,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:16:18,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:16:18,726 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 20:16:18,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 191 transitions, 2340 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:18,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:18,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 20:16:18,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:19,561 INFO L116 PetriNetUnfolderBase]: 4921/7981 cut-off events. [2025-04-13 20:16:19,561 INFO L117 PetriNetUnfolderBase]: For 83227/83227 co-relation queries the response was YES. [2025-04-13 20:16:19,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47553 conditions, 7981 events. 4921/7981 cut-off events. For 83227/83227 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 51989 event pairs, 634 based on Foata normal form. 1/7363 useless extension candidates. Maximal degree in co-relation 39609. Up to 5760 conditions per place. [2025-04-13 20:16:19,605 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 353 selfloop transitions, 48 changer transitions 6/407 dead transitions. [2025-04-13 20:16:19,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 407 transitions, 5613 flow [2025-04-13 20:16:19,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:16:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:16:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2025-04-13 20:16:19,606 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6302083333333334 [2025-04-13 20:16:19,606 INFO L175 Difference]: Start difference. First operand has 94 places, 191 transitions, 2340 flow. Second operand 6 states and 121 transitions. [2025-04-13 20:16:19,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 407 transitions, 5613 flow [2025-04-13 20:16:19,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 407 transitions, 5551 flow, removed 31 selfloop flow, removed 0 redundant places. [2025-04-13 20:16:19,678 INFO L231 Difference]: Finished difference. Result has 102 places, 221 transitions, 2774 flow [2025-04-13 20:16:19,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2774, PETRI_PLACES=102, PETRI_TRANSITIONS=221} [2025-04-13 20:16:19,678 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 76 predicate places. [2025-04-13 20:16:19,678 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 221 transitions, 2774 flow [2025-04-13 20:16:19,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:19,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:19,678 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:19,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 20:16:19,679 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:19,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:19,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2041151721, now seen corresponding path program 1 times [2025-04-13 20:16:19,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:19,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119897483] [2025-04-13 20:16:19,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:19,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:19,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:16:19,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:16:19,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:19,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:19,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:19,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119897483] [2025-04-13 20:16:19,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119897483] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:19,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:19,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:19,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048182263] [2025-04-13 20:16:19,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:19,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:19,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:19,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:19,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:19,775 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:16:19,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 221 transitions, 2774 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:19,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:19,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:16:19,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:20,097 INFO L116 PetriNetUnfolderBase]: 2033/3771 cut-off events. [2025-04-13 20:16:20,097 INFO L117 PetriNetUnfolderBase]: For 50849/51269 co-relation queries the response was YES. [2025-04-13 20:16:20,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23175 conditions, 3771 events. 2033/3771 cut-off events. For 50849/51269 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 25924 event pairs, 569 based on Foata normal form. 152/3845 useless extension candidates. Maximal degree in co-relation 18108. Up to 2302 conditions per place. [2025-04-13 20:16:20,118 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 123 selfloop transitions, 25 changer transitions 0/199 dead transitions. [2025-04-13 20:16:20,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 199 transitions, 2851 flow [2025-04-13 20:16:20,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-04-13 20:16:20,119 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2025-04-13 20:16:20,119 INFO L175 Difference]: Start difference. First operand has 102 places, 221 transitions, 2774 flow. Second operand 3 states and 46 transitions. [2025-04-13 20:16:20,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 199 transitions, 2851 flow [2025-04-13 20:16:20,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 199 transitions, 2809 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:20,170 INFO L231 Difference]: Finished difference. Result has 103 places, 180 transitions, 2338 flow [2025-04-13 20:16:20,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2288, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2338, PETRI_PLACES=103, PETRI_TRANSITIONS=180} [2025-04-13 20:16:20,170 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 77 predicate places. [2025-04-13 20:16:20,170 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 180 transitions, 2338 flow [2025-04-13 20:16:20,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:20,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:20,170 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] [2025-04-13 20:16:20,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 20:16:20,170 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:16:20,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:20,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2068909423, now seen corresponding path program 1 times [2025-04-13 20:16:20,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:20,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336546506] [2025-04-13 20:16:20,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:20,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:20,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:16:20,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:16:20,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:20,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:20,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:20,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336546506] [2025-04-13 20:16:20,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336546506] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:16:20,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906252515] [2025-04-13 20:16:20,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:20,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:20,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:20,490 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:16:20,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:16:20,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:16:20,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:16:20,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:20,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:20,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 20:16:20,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:16:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:20,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:16:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:21,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906252515] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:16:21,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:16:21,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2025-04-13 20:16:21,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075371484] [2025-04-13 20:16:21,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:16:21,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 20:16:21,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:21,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 20:16:21,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:16:21,407 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 20:16:21,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 180 transitions, 2338 flow. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:21,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:21,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 20:16:21,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:26,026 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:16:29,421 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:16:31,184 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:16:44,075 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:16:45,930 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:16:49,172 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:16:51,228 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:16:55,306 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:16:59,756 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:17:03,905 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:17:08,447 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:17:13,631 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:17:40,798 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:17:45,806 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:17:49,858 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:17:53,903 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:17:57,624 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:18:01,505 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:18:05,512 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:18:09,636 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:18:13,721 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:18:14,920 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:18:19,098 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:18:23,105 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:18:35,141 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:18:36,322 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:18:40,324 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:18:44,336 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:18:46,305 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:18:50,766 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:18:54,319 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:18:54,994 INFO L116 PetriNetUnfolderBase]: 6637/11052 cut-off events. [2025-04-13 20:18:54,994 INFO L117 PetriNetUnfolderBase]: For 168571/168571 co-relation queries the response was YES. [2025-04-13 20:18:55,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68648 conditions, 11052 events. 6637/11052 cut-off events. For 168571/168571 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 77496 event pairs, 204 based on Foata normal form. 616/11608 useless extension candidates. Maximal degree in co-relation 60656. Up to 4584 conditions per place. [2025-04-13 20:18:55,052 INFO L140 encePairwiseOnDemand]: 14/32 looper letters, 748 selfloop transitions, 121 changer transitions 9/878 dead transitions. [2025-04-13 20:18:55,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 878 transitions, 11667 flow [2025-04-13 20:18:55,052 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 20:18:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 20:18:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 263 transitions. [2025-04-13 20:18:55,053 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4109375 [2025-04-13 20:18:55,053 INFO L175 Difference]: Start difference. First operand has 103 places, 180 transitions, 2338 flow. Second operand 20 states and 263 transitions. [2025-04-13 20:18:55,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 878 transitions, 11667 flow [2025-04-13 20:18:55,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 878 transitions, 11511 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-04-13 20:18:55,180 INFO L231 Difference]: Finished difference. Result has 128 places, 272 transitions, 3968 flow [2025-04-13 20:18:55,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2284, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3968, PETRI_PLACES=128, PETRI_TRANSITIONS=272} [2025-04-13 20:18:55,181 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 102 predicate places. [2025-04-13 20:18:55,181 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 272 transitions, 3968 flow [2025-04-13 20:18:55,181 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:18:55,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:18:55,181 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] [2025-04-13 20:18:55,188 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-13 20:18:55,382 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:18:55,382 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:18:55,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:18:55,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1328924379, now seen corresponding path program 1 times [2025-04-13 20:18:55,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:18:55,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610963674] [2025-04-13 20:18:55,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:55,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:18:55,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:18:55,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:18:55,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:55,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:18:55,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:18:55,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610963674] [2025-04-13 20:18:55,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610963674] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:18:55,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039274880] [2025-04-13 20:18:55,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:18:55,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:18:55,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:18:55,533 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:18:55,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:18:55,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:18:55,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:18:55,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:18:55,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:18:55,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 20:18:55,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:18:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:18:55,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:18:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:18:55,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039274880] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:18:55,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:18:55,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-04-13 20:18:55,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778026854] [2025-04-13 20:18:55,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:18:55,945 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:18:55,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:18:55,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:18:55,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:18:55,946 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:18:55,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 272 transitions, 3968 flow. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:18:55,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:18:55,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:18:55,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:19:00,962 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:19:05,125 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:19:09,141 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:19:13,218 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:19:14,629 INFO L116 PetriNetUnfolderBase]: 7014/12263 cut-off events. [2025-04-13 20:19:14,629 INFO L117 PetriNetUnfolderBase]: For 245263/247207 co-relation queries the response was YES. [2025-04-13 20:19:14,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83704 conditions, 12263 events. 7014/12263 cut-off events. For 245263/247207 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 93683 event pairs, 306 based on Foata normal form. 1282/13453 useless extension candidates. Maximal degree in co-relation 81844. Up to 6790 conditions per place. [2025-04-13 20:19:14,700 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 369 selfloop transitions, 94 changer transitions 16/530 dead transitions. [2025-04-13 20:19:14,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 530 transitions, 7674 flow [2025-04-13 20:19:14,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:19:14,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:19:14,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 235 transitions. [2025-04-13 20:19:14,701 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4079861111111111 [2025-04-13 20:19:14,701 INFO L175 Difference]: Start difference. First operand has 128 places, 272 transitions, 3968 flow. Second operand 18 states and 235 transitions. [2025-04-13 20:19:14,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 530 transitions, 7674 flow [2025-04-13 20:19:15,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 530 transitions, 6947 flow, removed 346 selfloop flow, removed 4 redundant places. [2025-04-13 20:19:15,279 INFO L231 Difference]: Finished difference. Result has 148 places, 298 transitions, 4071 flow [2025-04-13 20:19:15,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3453, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4071, PETRI_PLACES=148, PETRI_TRANSITIONS=298} [2025-04-13 20:19:15,279 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 122 predicate places. [2025-04-13 20:19:15,279 INFO L485 AbstractCegarLoop]: Abstraction has has 148 places, 298 transitions, 4071 flow [2025-04-13 20:19:15,279 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:19:15,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:19:15,279 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] [2025-04-13 20:19:15,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 20:19:15,480 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:19:15,480 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:19:15,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:19:15,480 INFO L85 PathProgramCache]: Analyzing trace with hash -523155043, now seen corresponding path program 2 times [2025-04-13 20:19:15,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:19:15,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8351499] [2025-04-13 20:19:15,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:19:15,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:19:15,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:19:15,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:19:15,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:19:15,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:19:15,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:19:15,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8351499] [2025-04-13 20:19:15,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8351499] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:19:15,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:19:15,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:19:15,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264636429] [2025-04-13 20:19:15,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:19:15,572 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:19:15,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:19:15,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:19:15,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:19:15,573 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:19:15,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 298 transitions, 4071 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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-13 20:19:15,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:19:15,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:19:15,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:19:17,204 INFO L116 PetriNetUnfolderBase]: 8268/14323 cut-off events. [2025-04-13 20:19:17,204 INFO L117 PetriNetUnfolderBase]: For 250461/252327 co-relation queries the response was YES. [2025-04-13 20:19:17,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92153 conditions, 14323 events. 8268/14323 cut-off events. For 250461/252327 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 108258 event pairs, 699 based on Foata normal form. 706/14927 useless extension candidates. Maximal degree in co-relation 89719. Up to 10722 conditions per place. [2025-04-13 20:19:17,405 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 320 selfloop transitions, 78 changer transitions 4/453 dead transitions. [2025-04-13 20:19:17,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 453 transitions, 6673 flow [2025-04-13 20:19:17,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:19:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:19:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2025-04-13 20:19:17,406 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2025-04-13 20:19:17,406 INFO L175 Difference]: Start difference. First operand has 148 places, 298 transitions, 4071 flow. Second operand 6 states and 92 transitions. [2025-04-13 20:19:17,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 453 transitions, 6673 flow [2025-04-13 20:19:18,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 453 transitions, 6410 flow, removed 94 selfloop flow, removed 7 redundant places. [2025-04-13 20:19:18,239 INFO L231 Difference]: Finished difference. Result has 146 places, 348 transitions, 4935 flow [2025-04-13 20:19:18,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3788, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4935, PETRI_PLACES=146, PETRI_TRANSITIONS=348} [2025-04-13 20:19:18,244 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 120 predicate places. [2025-04-13 20:19:18,245 INFO L485 AbstractCegarLoop]: Abstraction has has 146 places, 348 transitions, 4935 flow [2025-04-13 20:19:18,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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-13 20:19:18,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:19:18,245 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] [2025-04-13 20:19:18,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 20:19:18,245 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:19:18,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:19:18,245 INFO L85 PathProgramCache]: Analyzing trace with hash -731075849, now seen corresponding path program 1 times [2025-04-13 20:19:18,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:19:18,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857359184] [2025-04-13 20:19:18,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:19:18,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:19:18,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:19:18,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:19:18,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:19:18,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:18,464 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-13 20:19:18,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:19:18,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857359184] [2025-04-13 20:19:18,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857359184] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:19:18,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926712972] [2025-04-13 20:19:18,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:19:18,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:19:18,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:19:18,470 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:19:18,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:19:18,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:19:18,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:19:18,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:19:18,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:19:18,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 20:19:18,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:19:18,686 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-13 20:19:18,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:19:18,893 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-13 20:19:18,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926712972] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:19:18,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:19:18,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2025-04-13 20:19:18,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949787442] [2025-04-13 20:19:18,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:19:18,894 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:19:18,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:19:18,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:19:18,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:19:18,895 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:19:18,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 348 transitions, 4935 flow. Second operand has 15 states, 15 states have (on average 7.933333333333334) internal successors, (119), 15 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:19:18,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:19:18,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:19:18,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:19:22,986 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:19:27,022 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:19:36,850 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification. DAG size of input: 49 DAG size of output: 43 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:19:42,067 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:19:46,428 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:19:50,779 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:19:54,781 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:20:03,031 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:20:07,095 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:20:11,152 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:20:12,834 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:20:15,274 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:20:18,865 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:20:23,077 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:20:31,299 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:20:35,323 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:20:39,329 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:20:41,998 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:20:44,172 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:20:48,251 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:20:52,749 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:20:56,751 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:21:05,265 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:21:23,322 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:21:27,324 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:21:31,330 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:21:35,332 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:21:39,473 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:21:43,609 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:21:47,616 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:21:52,541 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:21:55,481 INFO L116 PetriNetUnfolderBase]: 12167/21316 cut-off events. [2025-04-13 20:21:55,481 INFO L117 PetriNetUnfolderBase]: For 420134/422220 co-relation queries the response was YES. [2025-04-13 20:21:55,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143842 conditions, 21316 events. 12167/21316 cut-off events. For 420134/422220 co-relation queries the response was YES. Maximal size of possible extension queue 1321. Compared 175396 event pairs, 432 based on Foata normal form. 1124/22322 useless extension candidates. Maximal degree in co-relation 138767. Up to 10051 conditions per place. [2025-04-13 20:21:55,652 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 627 selfloop transitions, 174 changer transitions 44/896 dead transitions. [2025-04-13 20:21:55,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 896 transitions, 12681 flow [2025-04-13 20:21:55,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 20:21:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-13 20:21:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 348 transitions. [2025-04-13 20:21:55,653 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4182692307692308 [2025-04-13 20:21:55,654 INFO L175 Difference]: Start difference. First operand has 146 places, 348 transitions, 4935 flow. Second operand 26 states and 348 transitions. [2025-04-13 20:21:55,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 896 transitions, 12681 flow [2025-04-13 20:21:58,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 896 transitions, 12379 flow, removed 110 selfloop flow, removed 3 redundant places. [2025-04-13 20:21:58,070 INFO L231 Difference]: Finished difference. Result has 175 places, 421 transitions, 6550 flow [2025-04-13 20:21:58,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4465, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=6550, PETRI_PLACES=175, PETRI_TRANSITIONS=421} [2025-04-13 20:21:58,070 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 149 predicate places. [2025-04-13 20:21:58,070 INFO L485 AbstractCegarLoop]: Abstraction has has 175 places, 421 transitions, 6550 flow [2025-04-13 20:21:58,070 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.933333333333334) internal successors, (119), 15 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:21:58,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:21:58,071 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] [2025-04-13 20:21:58,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 20:21:58,271 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,SelfDestructingSolverStorable24 [2025-04-13 20:21:58,271 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:21:58,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:21:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash -190144131, now seen corresponding path program 2 times [2025-04-13 20:21:58,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:21:58,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333709744] [2025-04-13 20:21:58,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:21:58,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:21:58,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:21:58,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:21:58,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:21:58,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:21:58,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:21:58,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333709744] [2025-04-13 20:21:58,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333709744] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:21:58,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518358738] [2025-04-13 20:21:58,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:21:58,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:21:58,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:21:58,462 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:21:58,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:21:58,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:21:58,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:21:58,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:21:58,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:21:58,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 20:21:58,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:21:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:21:58,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:21:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:21:58,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518358738] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:21:58,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:21:58,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 20:21:58,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883399235] [2025-04-13 20:21:58,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:21:58,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:21:58,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:21:58,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:21:58,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:21:58,861 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:21:58,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 421 transitions, 6550 flow. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:21:58,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:21:58,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:21:58,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:01,103 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:22:05,244 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:22:09,348 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:22:13,500 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:22:17,544 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:22:21,593 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:22:25,647 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:22:28,781 INFO L116 PetriNetUnfolderBase]: 14036/24519 cut-off events. [2025-04-13 20:22:28,781 INFO L117 PetriNetUnfolderBase]: For 562657/564683 co-relation queries the response was YES. [2025-04-13 20:22:28,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177241 conditions, 24519 events. 14036/24519 cut-off events. For 562657/564683 co-relation queries the response was YES. Maximal size of possible extension queue 1591. Compared 205991 event pairs, 702 based on Foata normal form. 648/25053 useless extension candidates. Maximal degree in co-relation 170081. Up to 16503 conditions per place. [2025-04-13 20:22:28,990 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 525 selfloop transitions, 126 changer transitions 51/753 dead transitions. [2025-04-13 20:22:28,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 753 transitions, 12081 flow [2025-04-13 20:22:28,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:22:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:22:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 191 transitions. [2025-04-13 20:22:28,992 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4263392857142857 [2025-04-13 20:22:28,992 INFO L175 Difference]: Start difference. First operand has 175 places, 421 transitions, 6550 flow. Second operand 14 states and 191 transitions. [2025-04-13 20:22:28,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 753 transitions, 12081 flow [2025-04-13 20:22:33,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 753 transitions, 11376 flow, removed 325 selfloop flow, removed 10 redundant places. [2025-04-13 20:22:33,321 INFO L231 Difference]: Finished difference. Result has 180 places, 475 transitions, 7555 flow [2025-04-13 20:22:33,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6035, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7555, PETRI_PLACES=180, PETRI_TRANSITIONS=475} [2025-04-13 20:22:33,322 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 154 predicate places. [2025-04-13 20:22:33,322 INFO L485 AbstractCegarLoop]: Abstraction has has 180 places, 475 transitions, 7555 flow [2025-04-13 20:22:33,322 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:22:33,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:22:33,322 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] [2025-04-13 20:22:33,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 20:22:33,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 20:22:33,523 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:22:33,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:22:33,524 INFO L85 PathProgramCache]: Analyzing trace with hash 217927747, now seen corresponding path program 3 times [2025-04-13 20:22:33,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:22:33,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164561011] [2025-04-13 20:22:33,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:22:33,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:22:33,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:22:33,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-04-13 20:22:33,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:22:33,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:22:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:22:33,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:22:33,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164561011] [2025-04-13 20:22:33,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164561011] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:22:33,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:22:33,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:22:33,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009983077] [2025-04-13 20:22:33,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:22:33,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:22:33,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:22:33,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:22:33,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:22:33,871 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 20:22:33,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 475 transitions, 7555 flow. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:22:33,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:22:33,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 20:22:33,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:22:37,652 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:22:42,423 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:22:46,443 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:22:50,475 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:22:54,865 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:22:59,107 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:23:03,111 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:23:07,115 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:23:11,445 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:23:15,447 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:23:16,897 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:23:20,695 INFO L116 PetriNetUnfolderBase]: 16918/27906 cut-off events. [2025-04-13 20:23:20,695 INFO L117 PetriNetUnfolderBase]: For 541747/541747 co-relation queries the response was YES. [2025-04-13 20:23:20,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193622 conditions, 27906 events. 16918/27906 cut-off events. For 541747/541747 co-relation queries the response was YES. Maximal size of possible extension queue 1484. Compared 215594 event pairs, 1749 based on Foata normal form. 15/27811 useless extension candidates. Maximal degree in co-relation 192062. Up to 27245 conditions per place. [2025-04-13 20:23:21,030 INFO L140 encePairwiseOnDemand]: 14/32 looper letters, 531 selfloop transitions, 47 changer transitions 14/592 dead transitions. [2025-04-13 20:23:21,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 592 transitions, 9883 flow [2025-04-13 20:23:21,031 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:23:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:23:21,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2025-04-13 20:23:21,032 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.384375 [2025-04-13 20:23:21,032 INFO L175 Difference]: Start difference. First operand has 180 places, 475 transitions, 7555 flow. Second operand 10 states and 123 transitions. [2025-04-13 20:23:21,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 592 transitions, 9883 flow [2025-04-13 20:23:25,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 592 transitions, 9686 flow, removed 88 selfloop flow, removed 5 redundant places. [2025-04-13 20:23:25,369 INFO L231 Difference]: Finished difference. Result has 185 places, 483 transitions, 7600 flow [2025-04-13 20:23:25,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=7358, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7600, PETRI_PLACES=185, PETRI_TRANSITIONS=483} [2025-04-13 20:23:25,369 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 159 predicate places. [2025-04-13 20:23:25,369 INFO L485 AbstractCegarLoop]: Abstraction has has 185 places, 483 transitions, 7600 flow [2025-04-13 20:23:25,370 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:23:25,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:23:25,370 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] [2025-04-13 20:23:25,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 20:23:25,370 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:23:25,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:23:25,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1531469529, now seen corresponding path program 4 times [2025-04-13 20:23:25,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:23:25,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978045519] [2025-04-13 20:23:25,370 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:23:25,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:23:25,375 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:23:25,381 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:23:25,381 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:23:25,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:23:25,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:23:25,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978045519] [2025-04-13 20:23:25,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978045519] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:23:25,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980258157] [2025-04-13 20:23:25,505 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:23:25,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:23:25,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:23:25,507 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:23:25,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:23:25,537 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:23:25,592 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:23:25,592 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:23:25,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:23:25,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 20:23:25,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:23:50,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:23:50,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:23:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:23:51,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980258157] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:23:51,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:23:51,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-04-13 20:23:51,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180282102] [2025-04-13 20:23:51,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:23:51,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:23:51,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:23:51,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:23:51,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=111, Unknown=5, NotChecked=0, Total=156 [2025-04-13 20:23:51,183 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-13 20:23:51,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 483 transitions, 7600 flow. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:23:51,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:23:51,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-13 20:23:51,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:23:55,241 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:23:59,273 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:24:03,463 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:24:07,504 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:24:11,536 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:24:15,560 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:24:19,580 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:24:23,639 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:24:27,664 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:24:31,756 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:24:35,970 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:24:40,116 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:24:44,192 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:24:48,222 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:24:52,258 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:24:56,275 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:25:00,309 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:25:04,358 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:25:08,390 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:25:12,409 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:25:16,431 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:25:20,462 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:25:24,504 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:25:29,082 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:25:33,099 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:25:37,128 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:25:41,168 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:25:45,197 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:25:49,258 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:25:53,285 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:25:57,326 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:26:01,376 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:26:05,415 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:26:09,467 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:26:21,819 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:26:25,849 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:26:29,912 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:26:33,994 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:26:38,109 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:26:42,131 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:26:46,439 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:26:50,466 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:26:54,590 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:26:58,629 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:27:02,690 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:27:04,004 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:27:08,012 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:27:24,695 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:27:28,707 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:27:32,723 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:27:36,764 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:27:40,833 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:27:44,848 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:27:49,123 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:27:53,316 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:27:57,441 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:28:03,873 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:28:07,975 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:28:12,022 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:28:16,056 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:28:20,092 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:28:24,143 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:28:28,165 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:28:32,244 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:28:36,305 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:28:40,322 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:28:44,354 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:28:48,490 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:28:52,537 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:28:56,581 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:29:00,669 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:29:04,729 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:29:08,757 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:29:12,800 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:29:16,947 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:29:25,048 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:29:29,099 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:29:33,299 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:29:37,428 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:29:41,460 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:29:45,634 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:29:47,633 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:29:52,585 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:29:56,842 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-04-13 20:29:59,536 INFO L116 PetriNetUnfolderBase]: 19000/31717 cut-off events. [2025-04-13 20:29:59,537 INFO L117 PetriNetUnfolderBase]: For 602157/602157 co-relation queries the response was YES. [2025-04-13 20:29:59,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215808 conditions, 31717 events. 19000/31717 cut-off events. For 602157/602157 co-relation queries the response was YES. Maximal size of possible extension queue 1521. Compared 250790 event pairs, 1834 based on Foata normal form. 852/32459 useless extension candidates. Maximal degree in co-relation 215737. Up to 21050 conditions per place. [2025-04-13 20:29:59,958 INFO L140 encePairwiseOnDemand]: 14/32 looper letters, 723 selfloop transitions, 159 changer transitions 42/924 dead transitions. [2025-04-13 20:29:59,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 924 transitions, 14696 flow [2025-04-13 20:29:59,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 20:29:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 20:29:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 227 transitions. [2025-04-13 20:29:59,960 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3546875 [2025-04-13 20:29:59,960 INFO L175 Difference]: Start difference. First operand has 185 places, 483 transitions, 7600 flow. Second operand 20 states and 227 transitions. [2025-04-13 20:29:59,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 924 transitions, 14696 flow [2025-04-13 20:30:04,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 924 transitions, 14612 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-04-13 20:30:04,400 INFO L231 Difference]: Finished difference. Result has 203 places, 517 transitions, 8652 flow [2025-04-13 20:30:04,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=7322, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=8652, PETRI_PLACES=203, PETRI_TRANSITIONS=517} [2025-04-13 20:30:04,401 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 177 predicate places. [2025-04-13 20:30:04,401 INFO L485 AbstractCegarLoop]: Abstraction has has 203 places, 517 transitions, 8652 flow [2025-04-13 20:30:04,401 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:04,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:04,401 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] [2025-04-13 20:30:04,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 20:30:04,605 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:04,605 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:30:04,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:04,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1929676643, now seen corresponding path program 5 times [2025-04-13 20:30:04,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:04,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639803321] [2025-04-13 20:30:04,606 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:30:04,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:04,611 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:30:04,618 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:30:04,618 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:30:04,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:04,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:04,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639803321] [2025-04-13 20:30:04,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639803321] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:30:04,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698709847] [2025-04-13 20:30:04,733 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:30:04,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:04,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:30:04,735 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:30:04,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 20:30:04,766 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:30:04,812 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:30:04,824 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:30:04,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:04,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 20:30:04,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:30:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:05,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:30:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:09,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698709847] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:30:09,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:30:09,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 20:30:09,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221001691] [2025-04-13 20:30:09,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:30:09,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:30:09,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:09,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:30:09,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=114, Unknown=1, NotChecked=0, Total=156 [2025-04-13 20:30:09,654 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:30:09,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 517 transitions, 8652 flow. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:09,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:09,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:30:09,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:13,979 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:30:22,079 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:30:36,598 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 31 DAG size of output: 31 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 20:30:38,528 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2025-04-13 20:30:41,373 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 20:30:41,388 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:30:41,389 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-13 20:30:41,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 20:30:41,481 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 20:30:41,487 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-13 20:30:41,685 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,SelfDestructingSolverStorable28 [2025-04-13 20:30:41,685 WARN L610 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. [2025-04-13 20:30:41,687 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 20:30:41,687 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 20:30:41,687 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:41,690 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:30:41,690 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:30:41,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:30:41 BasicIcfg [2025-04-13 20:30:41,697 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:30:41,697 INFO L158 Benchmark]: Toolchain (without parser) took 871946.13ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 98.2MB in the beginning and 987.8MB in the end (delta: -889.6MB). Peak memory consumption was 630.8MB. Max. memory is 8.0GB. [2025-04-13 20:30:41,698 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 95.0MB in the end (delta: 275.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:30:41,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.65ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 84.0MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:30:41,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.18ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 82.5MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:30:41,698 INFO L158 Benchmark]: Boogie Preprocessor took 21.79ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 80.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:30:41,698 INFO L158 Benchmark]: RCFGBuilder took 407.25ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 49.9MB in the end (delta: 30.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 20:30:41,698 INFO L158 Benchmark]: TraceAbstraction took 871269.44ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 49.0MB in the beginning and 987.8MB in the end (delta: -938.8MB). Peak memory consumption was 580.5MB. Max. memory is 8.0GB. [2025-04-13 20:30:41,699 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.15ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 95.0MB in the end (delta: 275.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.65ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 84.0MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.18ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 82.5MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.79ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 80.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 407.25ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 49.9MB in the end (delta: 30.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 871269.44ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 49.0MB in the beginning and 987.8MB in the end (delta: -938.8MB). Peak memory consumption was 580.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 36 locations, 55 edges, 3 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: 871.2s, OverallIterations: 29, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 832.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 144 mSolverCounterUnknown, 1327 SdHoareTripleChecker+Valid, 665.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1311 mSDsluCounter, 274 SdHoareTripleChecker+Invalid, 662.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 236 mSDsCounter, 476 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6733 IncrementalHoareTripleChecker+Invalid, 7353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 476 mSolverCounterUnsat, 38 mSDtfsCounter, 6733 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 576 GetRequests, 332 SyntacticMatches, 34 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 157.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8652occurred in iteration=28, InterpolantAutomatonStates: 215, 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.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 35.8s InterpolantComputationTime, 716 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 843 ConstructedInterpolants, 5 QuantifiedInterpolants, 8924 SizeOfPredicates, 44 NumberOfNonLiveVariables, 1144 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 45 InterpolantComputations, 21 PerfectInterpolantSequences, 49/84 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