/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/pthread/triangular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:14:46,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:14:46,619 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 19:14:46,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:14:46,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:14:46,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:14:46,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:14:46,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:14:46,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:14:46,647 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:14:46,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:14:46,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:14:46,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:14:46,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:14:46,648 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:14:46,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:14:46,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:14:46,649 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:14:46,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:14:46,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:14:46,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:14:46,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:14:46,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:14:46,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:14:46,649 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:14:46,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:14:46,649 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:14:46,649 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:14:46,649 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:14:46,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:14:46,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:14:46,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:14:46,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:14:46,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:14:46,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:14:46,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:14:46,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:14:46,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:14:46,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:14:46,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:14:46,650 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:14:46,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:14:46,650 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:14:46,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:14:46,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:14:46,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:14:46,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:14:46,651 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 19:14:46,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:14:46,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:14:46,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:14:46,879 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:14:46,880 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:14:46,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-2.i [2025-04-13 19:14:48,181 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b67af0e/a19f08214d1a40709d867d3c419dce69/FLAG1986f82fa [2025-04-13 19:14:48,478 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:14:48,478 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i [2025-04-13 19:14:48,492 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b67af0e/a19f08214d1a40709d867d3c419dce69/FLAG1986f82fa [2025-04-13 19:14:49,182 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b67af0e/a19f08214d1a40709d867d3c419dce69 [2025-04-13 19:14:49,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:14:49,185 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:14:49,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:14:49,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:14:49,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:14:49,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:14:49" (1/1) ... [2025-04-13 19:14:49,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647543c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:49, skipping insertion in model container [2025-04-13 19:14:49,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:14:49" (1/1) ... [2025-04-13 19:14:49,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:14:49,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i[30952,30965] [2025-04-13 19:14:49,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:14:49,431 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:14:49,467 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i[30952,30965] [2025-04-13 19:14:49,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:14:49,493 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:14:49,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:49 WrapperNode [2025-04-13 19:14:49,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:14:49,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:14:49,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:14:49,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:14:49,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:49" (1/1) ... [2025-04-13 19:14:49,510 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:49" (1/1) ... [2025-04-13 19:14:49,524 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-04-13 19:14:49,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:14:49,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:14:49,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:14:49,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:14:49,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:49" (1/1) ... [2025-04-13 19:14:49,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:49" (1/1) ... [2025-04-13 19:14:49,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:49" (1/1) ... [2025-04-13 19:14:49,541 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 19:14:49,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:49" (1/1) ... [2025-04-13 19:14:49,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:49" (1/1) ... [2025-04-13 19:14:49,548 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:49" (1/1) ... [2025-04-13 19:14:49,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:49" (1/1) ... [2025-04-13 19:14:49,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:49" (1/1) ... [2025-04-13 19:14:49,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:49" (1/1) ... [2025-04-13 19:14:49,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:49" (1/1) ... [2025-04-13 19:14:49,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:14:49,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:14:49,555 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:14:49,555 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:14:49,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:49" (1/1) ... [2025-04-13 19:14:49,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:14:49,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:14:49,579 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 19:14:49,581 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 19:14:49,596 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 19:14:49,597 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 19:14:49,597 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 19:14:49,597 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 19:14:49,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:14:49,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:14:49,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:14:49,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:14:49,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:14:49,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:14:49,598 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 19:14:49,685 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:14:49,686 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:14:49,772 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:14:49,773 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:14:49,773 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:14:49,838 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:14:49,840 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:14:49,846 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:14:49,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:14:49 BoogieIcfgContainer [2025-04-13 19:14:49,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:14:49,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:14:49,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:14:49,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:14:49,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:14:49" (1/3) ... [2025-04-13 19:14:49,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab51313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:14:49, skipping insertion in model container [2025-04-13 19:14:49,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:14:49" (2/3) ... [2025-04-13 19:14:49,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab51313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:14:49, skipping insertion in model container [2025-04-13 19:14:49,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:14:49" (3/3) ... [2025-04-13 19:14:49,852 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2025-04-13 19:14:49,861 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:14:49,862 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-2.i that has 3 procedures, 18 locations, 19 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 19:14:49,862 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:14:49,889 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:14:49,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 50 flow [2025-04-13 19:14:49,934 INFO L116 PetriNetUnfolderBase]: 4/19 cut-off events. [2025-04-13 19:14:49,936 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:14:49,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 19 events. 4/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 22 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-04-13 19:14:49,938 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 21 transitions, 50 flow [2025-04-13 19:14:49,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 19 transitions, 44 flow [2025-04-13 19:14:49,944 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:14:49,952 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;@7e344d6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:14:49,952 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 19:14:49,958 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:14:49,958 INFO L116 PetriNetUnfolderBase]: 4/17 cut-off events. [2025-04-13 19:14:49,958 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:14:49,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:49,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:49,959 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 19:14:49,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:49,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1193666932, now seen corresponding path program 1 times [2025-04-13 19:14:49,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:49,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764732997] [2025-04-13 19:14:49,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:49,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:50,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:14:50,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:14:50,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:50,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:50,311 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 19:14:50,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:50,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764732997] [2025-04-13 19:14:50,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764732997] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:14:50,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:14:50,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:14:50,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471696541] [2025-04-13 19:14:50,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:14:50,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:14:50,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:50,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:14:50,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:14:50,355 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:14:50,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 44 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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 19:14:50,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:50,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:14:50,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:50,568 INFO L116 PetriNetUnfolderBase]: 237/370 cut-off events. [2025-04-13 19:14:50,569 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:14:50,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 370 events. 237/370 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1115 event pairs, 45 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 744. Up to 233 conditions per place. [2025-04-13 19:14:50,576 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 25 selfloop transitions, 4 changer transitions 17/46 dead transitions. [2025-04-13 19:14:50,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 46 transitions, 190 flow [2025-04-13 19:14:50,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:14:50,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:14:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2025-04-13 19:14:50,593 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2025-04-13 19:14:50,594 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 44 flow. Second operand 6 states and 68 transitions. [2025-04-13 19:14:50,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 46 transitions, 190 flow [2025-04-13 19:14:50,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:14:50,602 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 65 flow [2025-04-13 19:14:50,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=65, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2025-04-13 19:14:50,606 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 7 predicate places. [2025-04-13 19:14:50,607 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 65 flow [2025-04-13 19:14:50,607 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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 19:14:50,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:50,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:50,607 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:14:50,607 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 19:14:50,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:50,608 INFO L85 PathProgramCache]: Analyzing trace with hash -344557750, now seen corresponding path program 1 times [2025-04-13 19:14:50,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:50,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299674926] [2025-04-13 19:14:50,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:50,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:50,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:14:50,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:14:50,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:50,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:50,732 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 19:14:50,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:50,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299674926] [2025-04-13 19:14:50,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299674926] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:14:50,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:14:50,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:14:50,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227628161] [2025-04-13 19:14:50,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:14:50,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:14:50,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:50,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:14:50,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:14:50,745 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:14:50,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 65 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 19:14:50,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:50,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:14:50,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:50,922 INFO L116 PetriNetUnfolderBase]: 295/480 cut-off events. [2025-04-13 19:14:50,923 INFO L117 PetriNetUnfolderBase]: For 213/213 co-relation queries the response was YES. [2025-04-13 19:14:50,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 480 events. 295/480 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1657 event pairs, 41 based on Foata normal form. 24/418 useless extension candidates. Maximal degree in co-relation 1169. Up to 219 conditions per place. [2025-04-13 19:14:50,928 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 43 selfloop transitions, 9 changer transitions 19/71 dead transitions. [2025-04-13 19:14:50,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 71 transitions, 357 flow [2025-04-13 19:14:50,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:14:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:14:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2025-04-13 19:14:50,931 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.455026455026455 [2025-04-13 19:14:50,931 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 65 flow. Second operand 9 states and 86 transitions. [2025-04-13 19:14:50,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 71 transitions, 357 flow [2025-04-13 19:14:50,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 71 transitions, 341 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-04-13 19:14:50,934 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 150 flow [2025-04-13 19:14:50,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=150, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2025-04-13 19:14:50,935 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 17 predicate places. [2025-04-13 19:14:50,935 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 150 flow [2025-04-13 19:14:50,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 19:14:50,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:50,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:50,935 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:14:50,935 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 19:14:50,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:50,936 INFO L85 PathProgramCache]: Analyzing trace with hash -344096470, now seen corresponding path program 2 times [2025-04-13 19:14:50,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:50,936 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695298156] [2025-04-13 19:14:50,936 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:14:50,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:50,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:14:50,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:14:50,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:14:50,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:51,049 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 19:14:51,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:51,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695298156] [2025-04-13 19:14:51,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695298156] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:14:51,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:14:51,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:14:51,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949412344] [2025-04-13 19:14:51,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:14:51,050 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:14:51,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:51,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:14:51,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:14:51,079 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:14:51,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 19:14:51,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:51,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:14:51,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:51,244 INFO L116 PetriNetUnfolderBase]: 256/429 cut-off events. [2025-04-13 19:14:51,244 INFO L117 PetriNetUnfolderBase]: For 744/744 co-relation queries the response was YES. [2025-04-13 19:14:51,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 429 events. 256/429 cut-off events. For 744/744 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1514 event pairs, 41 based on Foata normal form. 39/386 useless extension candidates. Maximal degree in co-relation 1329. Up to 208 conditions per place. [2025-04-13 19:14:51,249 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 38 selfloop transitions, 9 changer transitions 25/72 dead transitions. [2025-04-13 19:14:51,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 478 flow [2025-04-13 19:14:51,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:14:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:14:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2025-04-13 19:14:51,251 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-04-13 19:14:51,251 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 150 flow. Second operand 8 states and 76 transitions. [2025-04-13 19:14:51,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 72 transitions, 478 flow [2025-04-13 19:14:51,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 72 transitions, 470 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 19:14:51,256 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 204 flow [2025-04-13 19:14:51,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=204, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2025-04-13 19:14:51,257 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 24 predicate places. [2025-04-13 19:14:51,257 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 204 flow [2025-04-13 19:14:51,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 19:14:51,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:51,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:51,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:14:51,257 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 19:14:51,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash 255482424, now seen corresponding path program 1 times [2025-04-13 19:14:51,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:51,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411149007] [2025-04-13 19:14:51,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:51,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:51,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:14:51,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:14:51,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:51,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:51,355 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 19:14:51,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:51,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411149007] [2025-04-13 19:14:51,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411149007] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:14:51,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:14:51,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:14:51,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989900496] [2025-04-13 19:14:51,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:14:51,356 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:14:51,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:51,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:14:51,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:14:51,365 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:14:51,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 204 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 19:14:51,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:51,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:14:51,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:51,567 INFO L116 PetriNetUnfolderBase]: 274/453 cut-off events. [2025-04-13 19:14:51,567 INFO L117 PetriNetUnfolderBase]: For 1317/1317 co-relation queries the response was YES. [2025-04-13 19:14:51,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 453 events. 274/453 cut-off events. For 1317/1317 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1586 event pairs, 53 based on Foata normal form. 18/381 useless extension candidates. Maximal degree in co-relation 1557. Up to 211 conditions per place. [2025-04-13 19:14:51,570 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 46 selfloop transitions, 16 changer transitions 17/79 dead transitions. [2025-04-13 19:14:51,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 573 flow [2025-04-13 19:14:51,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:14:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:14:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 95 transitions. [2025-04-13 19:14:51,574 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2025-04-13 19:14:51,574 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 204 flow. Second operand 11 states and 95 transitions. [2025-04-13 19:14:51,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 573 flow [2025-04-13 19:14:51,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 506 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-04-13 19:14:51,582 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 273 flow [2025-04-13 19:14:51,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=273, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2025-04-13 19:14:51,583 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 29 predicate places. [2025-04-13 19:14:51,583 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 273 flow [2025-04-13 19:14:51,583 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 19:14:51,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:51,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:51,583 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:14:51,585 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 19:14:51,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:51,585 INFO L85 PathProgramCache]: Analyzing trace with hash 250552494, now seen corresponding path program 2 times [2025-04-13 19:14:51,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:51,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416736213] [2025-04-13 19:14:51,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:14:51,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:51,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:14:51,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:14:51,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:14:51,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:51,701 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 19:14:51,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:51,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416736213] [2025-04-13 19:14:51,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416736213] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:14:51,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:14:51,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:14:51,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336322888] [2025-04-13 19:14:51,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:14:51,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:14:51,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:51,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:14:51,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:14:51,708 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:14:51,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 273 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 19:14:51,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:51,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:14:51,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:51,885 INFO L116 PetriNetUnfolderBase]: 445/732 cut-off events. [2025-04-13 19:14:51,886 INFO L117 PetriNetUnfolderBase]: For 2551/2551 co-relation queries the response was YES. [2025-04-13 19:14:51,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2665 conditions, 732 events. 445/732 cut-off events. For 2551/2551 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2830 event pairs, 49 based on Foata normal form. 27/597 useless extension candidates. Maximal degree in co-relation 2638. Up to 253 conditions per place. [2025-04-13 19:14:51,889 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 57 selfloop transitions, 20 changer transitions 21/98 dead transitions. [2025-04-13 19:14:51,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 98 transitions, 757 flow [2025-04-13 19:14:51,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:14:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:14:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2025-04-13 19:14:51,890 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4588744588744589 [2025-04-13 19:14:51,890 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 273 flow. Second operand 11 states and 106 transitions. [2025-04-13 19:14:51,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 98 transitions, 757 flow [2025-04-13 19:14:51,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 98 transitions, 691 flow, removed 27 selfloop flow, removed 4 redundant places. [2025-04-13 19:14:51,897 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 370 flow [2025-04-13 19:14:51,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=370, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2025-04-13 19:14:51,897 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 40 predicate places. [2025-04-13 19:14:51,898 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 370 flow [2025-04-13 19:14:51,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 19:14:51,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:51,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:51,898 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:14:51,898 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 19:14:51,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:51,898 INFO L85 PathProgramCache]: Analyzing trace with hash -651136364, now seen corresponding path program 3 times [2025-04-13 19:14:51,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:51,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345231875] [2025-04-13 19:14:51,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:14:51,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:51,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:14:51,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:14:51,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:14:51,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:51,965 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 19:14:51,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:51,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345231875] [2025-04-13 19:14:51,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345231875] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:14:51,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:14:51,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:14:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063109618] [2025-04-13 19:14:51,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:14:51,966 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:14:51,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:51,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:14:51,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:14:51,976 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:14:51,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 370 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 19:14:51,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:51,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:14:51,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:52,157 INFO L116 PetriNetUnfolderBase]: 418/696 cut-off events. [2025-04-13 19:14:52,157 INFO L117 PetriNetUnfolderBase]: For 4216/4216 co-relation queries the response was YES. [2025-04-13 19:14:52,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2949 conditions, 696 events. 418/696 cut-off events. For 4216/4216 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2709 event pairs, 37 based on Foata normal form. 45/585 useless extension candidates. Maximal degree in co-relation 2917. Up to 154 conditions per place. [2025-04-13 19:14:52,161 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 45 selfloop transitions, 25 changer transitions 31/101 dead transitions. [2025-04-13 19:14:52,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 101 transitions, 950 flow [2025-04-13 19:14:52,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:14:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:14:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 103 transitions. [2025-04-13 19:14:52,162 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4458874458874459 [2025-04-13 19:14:52,162 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 370 flow. Second operand 11 states and 103 transitions. [2025-04-13 19:14:52,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 101 transitions, 950 flow [2025-04-13 19:14:52,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 101 transitions, 879 flow, removed 26 selfloop flow, removed 5 redundant places. [2025-04-13 19:14:52,169 INFO L231 Difference]: Finished difference. Result has 70 places, 45 transitions, 469 flow [2025-04-13 19:14:52,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=469, PETRI_PLACES=70, PETRI_TRANSITIONS=45} [2025-04-13 19:14:52,169 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 48 predicate places. [2025-04-13 19:14:52,169 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 45 transitions, 469 flow [2025-04-13 19:14:52,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 19:14:52,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:52,170 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:52,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:14:52,170 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 19:14:52,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:52,170 INFO L85 PathProgramCache]: Analyzing trace with hash -450343527, now seen corresponding path program 1 times [2025-04-13 19:14:52,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:52,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092858904] [2025-04-13 19:14:52,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:52,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:52,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:14:52,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:14:52,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:52,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:52,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:52,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:52,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092858904] [2025-04-13 19:14:52,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092858904] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:14:52,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927117121] [2025-04-13 19:14:52,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:52,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:52,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:14:52,271 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 19:14:52,272 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 19:14:52,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:14:52,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:14:52,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:52,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:52,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:14:52,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:14:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:52,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:14:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:52,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927117121] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:14:52,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:14:52,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 19:14:52,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530745933] [2025-04-13 19:14:52,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:14:52,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 19:14:52,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:52,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 19:14:52,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-13 19:14:52,495 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:14:52,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 45 transitions, 469 flow. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:52,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:52,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:14:52,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:52,851 INFO L116 PetriNetUnfolderBase]: 526/876 cut-off events. [2025-04-13 19:14:52,851 INFO L117 PetriNetUnfolderBase]: For 9161/9161 co-relation queries the response was YES. [2025-04-13 19:14:52,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4259 conditions, 876 events. 526/876 cut-off events. For 9161/9161 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3226 event pairs, 131 based on Foata normal form. 63/735 useless extension candidates. Maximal degree in co-relation 4223. Up to 489 conditions per place. [2025-04-13 19:14:52,875 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 67 selfloop transitions, 17 changer transitions 64/148 dead transitions. [2025-04-13 19:14:52,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 148 transitions, 1529 flow [2025-04-13 19:14:52,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 19:14:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 19:14:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 171 transitions. [2025-04-13 19:14:52,877 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-04-13 19:14:52,877 INFO L175 Difference]: Start difference. First operand has 70 places, 45 transitions, 469 flow. Second operand 19 states and 171 transitions. [2025-04-13 19:14:52,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 148 transitions, 1529 flow [2025-04-13 19:14:52,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 148 transitions, 1430 flow, removed 33 selfloop flow, removed 8 redundant places. [2025-04-13 19:14:52,889 INFO L231 Difference]: Finished difference. Result has 90 places, 51 transitions, 598 flow [2025-04-13 19:14:52,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=598, PETRI_PLACES=90, PETRI_TRANSITIONS=51} [2025-04-13 19:14:52,891 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 68 predicate places. [2025-04-13 19:14:52,891 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 51 transitions, 598 flow [2025-04-13 19:14:52,891 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:52,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:52,891 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:52,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 19:14:53,097 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:53,097 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 19:14:53,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:53,098 INFO L85 PathProgramCache]: Analyzing trace with hash 887573805, now seen corresponding path program 2 times [2025-04-13 19:14:53,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:53,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849481287] [2025-04-13 19:14:53,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:14:53,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:53,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 19:14:53,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:14:53,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:14:53,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:53,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:53,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849481287] [2025-04-13 19:14:53,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849481287] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:14:53,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736680231] [2025-04-13 19:14:53,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:14:53,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:53,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:14:53,181 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 19:14:53,182 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 19:14:53,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 19:14:53,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:14:53,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:14:53,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:53,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:14:53,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:14:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:53,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:14:53,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:53,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736680231] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:14:53,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:14:53,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 19:14:53,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101323587] [2025-04-13 19:14:53,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:14:53,345 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 19:14:53,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:53,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 19:14:53,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-04-13 19:14:53,357 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:14:53,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 51 transitions, 598 flow. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 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 19:14:53,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:53,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:14:53,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:53,848 INFO L116 PetriNetUnfolderBase]: 814/1353 cut-off events. [2025-04-13 19:14:53,848 INFO L117 PetriNetUnfolderBase]: For 33781/33781 co-relation queries the response was YES. [2025-04-13 19:14:53,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8664 conditions, 1353 events. 814/1353 cut-off events. For 33781/33781 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5706 event pairs, 57 based on Foata normal form. 72/1095 useless extension candidates. Maximal degree in co-relation 8618. Up to 304 conditions per place. [2025-04-13 19:14:53,857 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 88 selfloop transitions, 47 changer transitions 74/209 dead transitions. [2025-04-13 19:14:53,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 209 transitions, 2776 flow [2025-04-13 19:14:53,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 19:14:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-13 19:14:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 247 transitions. [2025-04-13 19:14:53,859 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43562610229276894 [2025-04-13 19:14:53,859 INFO L175 Difference]: Start difference. First operand has 90 places, 51 transitions, 598 flow. Second operand 27 states and 247 transitions. [2025-04-13 19:14:53,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 209 transitions, 2776 flow [2025-04-13 19:14:53,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 209 transitions, 2232 flow, removed 261 selfloop flow, removed 12 redundant places. [2025-04-13 19:14:53,884 INFO L231 Difference]: Finished difference. Result has 116 places, 67 transitions, 1001 flow [2025-04-13 19:14:53,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1001, PETRI_PLACES=116, PETRI_TRANSITIONS=67} [2025-04-13 19:14:53,884 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 94 predicate places. [2025-04-13 19:14:53,884 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 67 transitions, 1001 flow [2025-04-13 19:14:53,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 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 19:14:53,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:53,885 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:53,890 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 19:14:54,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-13 19:14:54,085 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 19:14:54,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:54,086 INFO L85 PathProgramCache]: Analyzing trace with hash -2129966344, now seen corresponding path program 1 times [2025-04-13 19:14:54,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:54,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825296578] [2025-04-13 19:14:54,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:54,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:54,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:14:54,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:14:54,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:54,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:54,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:54,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825296578] [2025-04-13 19:14:54,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825296578] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:14:54,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813648132] [2025-04-13 19:14:54,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:14:54,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:54,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:14:54,174 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 19:14:54,175 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 19:14:54,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:14:54,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:14:54,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:54,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:54,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 19:14:54,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:14:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:54,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:14:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:54,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813648132] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:14:54,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:14:54,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 19:14:54,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618238811] [2025-04-13 19:14:54,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:14:54,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 19:14:54,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:54,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 19:14:54,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-04-13 19:14:54,374 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:14:54,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 67 transitions, 1001 flow. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:54,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:54,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:14:54,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:54,895 INFO L116 PetriNetUnfolderBase]: 1048/1758 cut-off events. [2025-04-13 19:14:54,895 INFO L117 PetriNetUnfolderBase]: For 80930/80930 co-relation queries the response was YES. [2025-04-13 19:14:54,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13918 conditions, 1758 events. 1048/1758 cut-off events. For 80930/80930 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7983 event pairs, 131 based on Foata normal form. 63/1377 useless extension candidates. Maximal degree in co-relation 13860. Up to 490 conditions per place. [2025-04-13 19:14:54,908 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 99 selfloop transitions, 51 changer transitions 65/215 dead transitions. [2025-04-13 19:14:54,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 215 transitions, 3605 flow [2025-04-13 19:14:54,909 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 19:14:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 19:14:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 232 transitions. [2025-04-13 19:14:54,911 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4419047619047619 [2025-04-13 19:14:54,911 INFO L175 Difference]: Start difference. First operand has 116 places, 67 transitions, 1001 flow. Second operand 25 states and 232 transitions. [2025-04-13 19:14:54,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 215 transitions, 3605 flow [2025-04-13 19:14:54,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 215 transitions, 3025 flow, removed 274 selfloop flow, removed 15 redundant places. [2025-04-13 19:14:54,961 INFO L231 Difference]: Finished difference. Result has 132 places, 78 transitions, 1287 flow [2025-04-13 19:14:54,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1287, PETRI_PLACES=132, PETRI_TRANSITIONS=78} [2025-04-13 19:14:54,962 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 110 predicate places. [2025-04-13 19:14:54,962 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 78 transitions, 1287 flow [2025-04-13 19:14:54,963 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:54,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:54,963 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:54,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 19:14:55,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:55,163 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 19:14:55,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash -866930206, now seen corresponding path program 2 times [2025-04-13 19:14:55,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:55,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027301764] [2025-04-13 19:14:55,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:14:55,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:55,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 19:14:55,171 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:14:55,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:14:55,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:55,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:55,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027301764] [2025-04-13 19:14:55,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027301764] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:14:55,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951145550] [2025-04-13 19:14:55,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:14:55,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:55,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:14:55,265 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 19:14:55,267 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 19:14:55,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 19:14:55,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:14:55,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:14:55,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:55,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 19:14:55,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:14:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:55,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:14:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:55,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951145550] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:14:55,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:14:55,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 19:14:55,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897553119] [2025-04-13 19:14:55,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:14:55,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 19:14:55,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:55,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 19:14:55,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-13 19:14:55,443 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:14:55,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 78 transitions, 1287 flow. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 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 19:14:55,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:55,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:14:55,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:56,116 INFO L116 PetriNetUnfolderBase]: 1129/1929 cut-off events. [2025-04-13 19:14:56,117 INFO L117 PetriNetUnfolderBase]: For 122643/122643 co-relation queries the response was YES. [2025-04-13 19:14:56,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16173 conditions, 1929 events. 1129/1929 cut-off events. For 122643/122643 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 8893 event pairs, 25 based on Foata normal form. 126/1551 useless extension candidates. Maximal degree in co-relation 16108. Up to 472 conditions per place. [2025-04-13 19:14:56,133 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 89 selfloop transitions, 76 changer transitions 87/252 dead transitions. [2025-04-13 19:14:56,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 252 transitions, 4849 flow [2025-04-13 19:14:56,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 19:14:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-13 19:14:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 255 transitions. [2025-04-13 19:14:56,135 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4336734693877551 [2025-04-13 19:14:56,135 INFO L175 Difference]: Start difference. First operand has 132 places, 78 transitions, 1287 flow. Second operand 28 states and 255 transitions. [2025-04-13 19:14:56,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 252 transitions, 4849 flow [2025-04-13 19:14:56,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 252 transitions, 4110 flow, removed 336 selfloop flow, removed 18 redundant places. [2025-04-13 19:14:56,257 INFO L231 Difference]: Finished difference. Result has 151 places, 97 transitions, 1848 flow [2025-04-13 19:14:56,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1848, PETRI_PLACES=151, PETRI_TRANSITIONS=97} [2025-04-13 19:14:56,257 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 129 predicate places. [2025-04-13 19:14:56,257 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 97 transitions, 1848 flow [2025-04-13 19:14:56,258 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 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 19:14:56,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:56,258 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:56,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 19:14:56,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:56,459 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 19:14:56,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:56,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2000096558, now seen corresponding path program 3 times [2025-04-13 19:14:56,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:56,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152268136] [2025-04-13 19:14:56,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:14:56,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:56,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-04-13 19:14:56,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:14:56,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 19:14:56,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:56,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:14:56,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152268136] [2025-04-13 19:14:56,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152268136] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:14:56,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100706161] [2025-04-13 19:14:56,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:14:56,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:14:56,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:14:56,611 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 19:14:56,612 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 19:14:56,645 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-04-13 19:14:56,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:14:56,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 19:14:56,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:14:56,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 19:14:56,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:14:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:56,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:14:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:14:56,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100706161] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:14:56,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:14:56,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-04-13 19:14:56,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659815763] [2025-04-13 19:14:56,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:14:56,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 19:14:56,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:14:56,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 19:14:56,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-04-13 19:14:56,820 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:14:56,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 97 transitions, 1848 flow. Second operand has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:56,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:14:56,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:14:56,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:14:57,619 INFO L116 PetriNetUnfolderBase]: 1363/2289 cut-off events. [2025-04-13 19:14:57,619 INFO L117 PetriNetUnfolderBase]: For 177490/177490 co-relation queries the response was YES. [2025-04-13 19:14:57,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20765 conditions, 2289 events. 1363/2289 cut-off events. For 177490/177490 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 10342 event pairs, 19 based on Foata normal form. 54/1755 useless extension candidates. Maximal degree in co-relation 20692. Up to 550 conditions per place. [2025-04-13 19:14:57,638 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 114 selfloop transitions, 98 changer transitions 85/297 dead transitions. [2025-04-13 19:14:57,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 297 transitions, 6104 flow [2025-04-13 19:14:57,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 19:14:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-04-13 19:14:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 309 transitions. [2025-04-13 19:14:57,640 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4327731092436975 [2025-04-13 19:14:57,640 INFO L175 Difference]: Start difference. First operand has 151 places, 97 transitions, 1848 flow. Second operand 34 states and 309 transitions. [2025-04-13 19:14:57,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 297 transitions, 6104 flow [2025-04-13 19:14:57,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 297 transitions, 5108 flow, removed 468 selfloop flow, removed 19 redundant places. [2025-04-13 19:14:57,750 INFO L231 Difference]: Finished difference. Result has 174 places, 119 transitions, 2414 flow [2025-04-13 19:14:57,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1386, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2414, PETRI_PLACES=174, PETRI_TRANSITIONS=119} [2025-04-13 19:14:57,751 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 152 predicate places. [2025-04-13 19:14:57,751 INFO L485 AbstractCegarLoop]: Abstraction has has 174 places, 119 transitions, 2414 flow [2025-04-13 19:14:57,751 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:14:57,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:14:57,751 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:14:57,756 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 19:14:57,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 19:14:57,952 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 19:14:57,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:14:57,952 INFO L85 PathProgramCache]: Analyzing trace with hash -61837922, now seen corresponding path program 4 times [2025-04-13 19:14:57,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:14:57,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342980138] [2025-04-13 19:14:57,952 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:14:57,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:14:57,956 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 19:14:57,962 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 19:14:57,962 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:14:57,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:14:57,963 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:14:57,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 19:14:57,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 19:14:57,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:14:57,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:14:57,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:14:57,992 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:14:57,992 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 19:14:57,994 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 19:14:57,994 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 19:14:57,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 19:14:57,994 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1] [2025-04-13 19:14:58,056 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:14:58,057 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:14:58,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:14:58 BasicIcfg [2025-04-13 19:14:58,061 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:14:58,061 INFO L158 Benchmark]: Toolchain (without parser) took 8876.03ms. Allocated memory was 155.2MB in the beginning and 339.7MB in the end (delta: 184.5MB). Free memory was 108.9MB in the beginning and 212.9MB in the end (delta: -104.1MB). Peak memory consumption was 78.5MB. Max. memory is 8.0GB. [2025-04-13 19:14:58,061 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:14:58,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.56ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 86.5MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 19:14:58,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.14ms. Allocated memory is still 155.2MB. Free memory was 86.5MB in the beginning and 84.7MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:14:58,062 INFO L158 Benchmark]: Boogie Preprocessor took 29.66ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 82.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:14:58,062 INFO L158 Benchmark]: RCFGBuilder took 291.42ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 62.5MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 19:14:58,062 INFO L158 Benchmark]: TraceAbstraction took 8213.33ms. Allocated memory was 155.2MB in the beginning and 339.7MB in the end (delta: 184.5MB). Free memory was 61.9MB in the beginning and 212.9MB in the end (delta: -151.0MB). Peak memory consumption was 36.5MB. Max. memory is 8.0GB. [2025-04-13 19:14:58,065 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.19ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.56ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 86.5MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.14ms. Allocated memory is still 155.2MB. Free memory was 86.5MB in the beginning and 84.7MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.66ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 82.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 291.42ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 62.5MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 8213.33ms. Allocated memory was 155.2MB in the beginning and 339.7MB in the end (delta: 184.5MB). Free memory was 61.9MB in the beginning and 212.9MB in the end (delta: -151.0MB). Peak memory consumption was 36.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, argc=51, i=3, id1=-1, j=6] [L696] 1 int k = 0; [L696] COND TRUE 1 k < 5 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:50}, \at(argc, Pre)=51, arg={0:0}, argc=51, i=3, id1=-1, id2=0, j=6, k=0] [L704] 2 int k = 0; [L704] COND TRUE 2 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ [L696] COND TRUE 1 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L716] 0 int condI = i >= (2*5 +6); VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=7, id1=-1, id2=0, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ [L704] COND TRUE 2 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ [L696] COND TRUE 1 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ [L704] COND TRUE 2 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ [L696] COND TRUE 1 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ [L704] COND TRUE 2 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ [L696] COND TRUE 1 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ [L704] COND TRUE 2 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L719] 0 int condJ = j >= (2*5 +6); VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] [L721] COND TRUE 0 condI || condJ [L722] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 28 locations, 33 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: 8.1s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1669 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1649 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2814 IncrementalHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 7 mSDtfsCounter, 2814 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2414occurred in iteration=11, InterpolantAutomatonStates: 189, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 1234 SizeOfPredicates, 27 NumberOfNonLiveVariables, 475 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 0/105 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 proved your program to be incorrect! [2025-04-13 19:14:58,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...