/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread/fib_safe-11.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:44:14,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:44:14,462 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 23:44:14,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:44:14,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:44:14,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:44:14,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:44:14,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:44:14,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:44:14,487 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:44:14,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:44:14,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:44:14,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:44:14,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:44:14,488 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:44:14,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:44:14,488 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:44:14,488 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:44:14,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:44:14,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:44:14,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:44:14,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:44:14,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:44:14,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:44:14,488 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:44:14,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:44:14,490 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:44:14,490 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:44:14,490 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:44:14,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:44:14,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:44:14,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:44:14,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:44:14,491 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:44:14,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:44:14,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:44:14,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:44:14,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:44:14,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:44:14,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:44:14,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:44:14,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:44:14,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:44:14,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:44:14,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:44:14,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:44:14,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:44:14,492 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:44:14,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:44:14,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:44:14,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:44:14,711 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:44:14,712 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:44:14,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_safe-11.i [2025-04-13 23:44:15,964 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/118645cfa/740c7228a7b74449855ce52b36741273/FLAG53c7def14 [2025-04-13 23:44:16,195 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:44:16,195 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-11.i [2025-04-13 23:44:16,208 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/118645cfa/740c7228a7b74449855ce52b36741273/FLAG53c7def14 [2025-04-13 23:44:17,015 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/118645cfa/740c7228a7b74449855ce52b36741273 [2025-04-13 23:44:17,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:44:17,018 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:44:17,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:44:17,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:44:17,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:44:17,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@395699c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17, skipping insertion in model container [2025-04-13 23:44:17,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:44:17,321 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/fib_safe-11.i[30241,30254] [2025-04-13 23:44:17,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:44:17,351 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:44:17,405 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/fib_safe-11.i[30241,30254] [2025-04-13 23:44:17,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:44:17,433 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:44:17,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17 WrapperNode [2025-04-13 23:44:17,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:44:17,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:44:17,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:44:17,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:44:17,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,471 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-04-13 23:44:17,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:44:17,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:44:17,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:44:17,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:44:17,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,489 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 23:44:17,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:44:17,499 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:44:17,499 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:44:17,499 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:44:17,500 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:44:17,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:17,522 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 23:44:17,524 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 23:44:17,540 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 23:44:17,540 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 23:44:17,541 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 23:44:17,541 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 23:44:17,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:44:17,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:44:17,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:44:17,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:44:17,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:44:17,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:44:17,542 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:44:17,640 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:44:17,641 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:44:17,748 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:44:17,749 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:44:17,749 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:44:17,835 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:44:17,841 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:44:17,845 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:44:17,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:44:17 BoogieIcfgContainer [2025-04-13 23:44:17,846 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:44:17,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:44:17,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:44:17,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:44:17,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:44:17" (1/3) ... [2025-04-13 23:44:17,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2c37e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:44:17, skipping insertion in model container [2025-04-13 23:44:17,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (2/3) ... [2025-04-13 23:44:17,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2c37e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:44:17, skipping insertion in model container [2025-04-13 23:44:17,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:44:17" (3/3) ... [2025-04-13 23:44:17,852 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_safe-11.i [2025-04-13 23:44:17,862 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:44:17,863 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_safe-11.i that has 3 procedures, 21 locations, 23 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 23:44:17,863 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:44:17,902 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:44:17,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 58 flow [2025-04-13 23:44:17,954 INFO L116 PetriNetUnfolderBase]: 5/23 cut-off events. [2025-04-13 23:44:17,955 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:44:17,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 23 events. 5/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-04-13 23:44:17,956 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 25 transitions, 58 flow [2025-04-13 23:44:17,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 23 transitions, 52 flow [2025-04-13 23:44:17,965 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:44:17,977 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;@548221a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:44:17,977 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:44:17,983 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:44:17,983 INFO L116 PetriNetUnfolderBase]: 5/21 cut-off events. [2025-04-13 23:44:17,983 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:44:17,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:17,984 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:17,984 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 23:44:17,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:17,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1578653316, now seen corresponding path program 1 times [2025-04-13 23:44:17,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:17,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612723668] [2025-04-13 23:44:18,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:18,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:18,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:44:18,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:44:18,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:18,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:18,196 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 23:44:18,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:18,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612723668] [2025-04-13 23:44:18,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612723668] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:44:18,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:44:18,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:44:18,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382494222] [2025-04-13 23:44:18,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:44:18,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:44:18,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:18,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:44:18,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:44:18,223 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:18,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 23:44:18,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:18,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:18,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:18,341 INFO L116 PetriNetUnfolderBase]: 233/357 cut-off events. [2025-04-13 23:44:18,341 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:44:18,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 357 events. 233/357 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 986 event pairs, 39 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 712. Up to 257 conditions per place. [2025-04-13 23:44:18,350 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 27 selfloop transitions, 2 changer transitions 1/30 dead transitions. [2025-04-13 23:44:18,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 30 transitions, 126 flow [2025-04-13 23:44:18,352 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:44:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:44:18,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-13 23:44:18,360 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2025-04-13 23:44:18,361 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 52 flow. Second operand 3 states and 41 transitions. [2025-04-13 23:44:18,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 30 transitions, 126 flow [2025-04-13 23:44:18,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:44:18,366 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 56 flow [2025-04-13 23:44:18,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2025-04-13 23:44:18,373 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2025-04-13 23:44:18,373 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 56 flow [2025-04-13 23:44:18,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 23:44:18,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:18,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:18,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:44:18,373 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 23:44:18,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:18,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1693576751, now seen corresponding path program 1 times [2025-04-13 23:44:18,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:18,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094779042] [2025-04-13 23:44:18,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:18,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:18,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:44:18,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:44:18,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:18,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:18,483 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 23:44:18,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:18,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094779042] [2025-04-13 23:44:18,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094779042] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:44:18,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510039512] [2025-04-13 23:44:18,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:18,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:18,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:18,487 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 23:44:18,488 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 23:44:18,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:44:18,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:44:18,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:18,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:18,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 23:44:18,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:44:18,580 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 23:44:18,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:44:18,602 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 23:44:18,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510039512] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:44:18,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:44:18,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 23:44:18,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798267766] [2025-04-13 23:44:18,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:44:18,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:44:18,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:18,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:44:18,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:44:18,603 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:18,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 56 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:18,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:18,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:18,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:18,730 INFO L116 PetriNetUnfolderBase]: 297/453 cut-off events. [2025-04-13 23:44:18,730 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-13 23:44:18,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 453 events. 297/453 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1244 event pairs, 39 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1016. Up to 209 conditions per place. [2025-04-13 23:44:18,735 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 51 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2025-04-13 23:44:18,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 56 transitions, 244 flow [2025-04-13 23:44:18,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:44:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 23:44:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2025-04-13 23:44:18,737 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2025-04-13 23:44:18,737 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 56 flow. Second operand 6 states and 71 transitions. [2025-04-13 23:44:18,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 56 transitions, 244 flow [2025-04-13 23:44:18,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 56 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:44:18,738 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 90 flow [2025-04-13 23:44:18,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2025-04-13 23:44:18,738 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2025-04-13 23:44:18,739 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 90 flow [2025-04-13 23:44:18,739 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:18,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:18,739 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:18,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 23:44:18,939 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:18,939 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 23:44:18,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:18,940 INFO L85 PathProgramCache]: Analyzing trace with hash 328624452, now seen corresponding path program 2 times [2025-04-13 23:44:18,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:18,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987932935] [2025-04-13 23:44:18,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:44:18,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:18,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 23:44:18,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:44:18,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:44:18,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:19,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:19,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:19,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987932935] [2025-04-13 23:44:19,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987932935] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:44:19,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438443119] [2025-04-13 23:44:19,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:44:19,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:19,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:19,057 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 23:44:19,061 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 23:44:19,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 23:44:19,117 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:44:19,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:44:19,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:19,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:44:19,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:44:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:19,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:44:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:19,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438443119] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:44:19,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:44:19,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 23:44:19,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476133591] [2025-04-13 23:44:19,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:44:19,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:44:19,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:19,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:44:19,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:44:19,201 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:19,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 90 flow. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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 23:44:19,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:19,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:19,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:19,383 INFO L116 PetriNetUnfolderBase]: 489/741 cut-off events. [2025-04-13 23:44:19,384 INFO L117 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2025-04-13 23:44:19,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 741 events. 489/741 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2115 event pairs, 39 based on Foata normal form. 96/715 useless extension candidates. Maximal degree in co-relation 1944. Up to 209 conditions per place. [2025-04-13 23:44:19,387 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 99 selfloop transitions, 11 changer transitions 0/110 dead transitions. [2025-04-13 23:44:19,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 110 transitions, 506 flow [2025-04-13 23:44:19,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:44:19,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 23:44:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2025-04-13 23:44:19,389 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-13 23:44:19,389 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 90 flow. Second operand 12 states and 140 transitions. [2025-04-13 23:44:19,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 110 transitions, 506 flow [2025-04-13 23:44:19,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 110 transitions, 492 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 23:44:19,393 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 160 flow [2025-04-13 23:44:19,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=160, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2025-04-13 23:44:19,394 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 23 predicate places. [2025-04-13 23:44:19,394 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 160 flow [2025-04-13 23:44:19,394 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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 23:44:19,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:19,394 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:19,400 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 23:44:19,594 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,SelfDestructingSolverStorable2 [2025-04-13 23:44:19,595 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 23:44:19,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:19,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2090552988, now seen corresponding path program 3 times [2025-04-13 23:44:19,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:19,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130601536] [2025-04-13 23:44:19,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:44:19,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:19,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 23:44:19,630 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:44:19,630 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 23:44:19,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:19,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:19,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130601536] [2025-04-13 23:44:19,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130601536] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:44:19,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160341470] [2025-04-13 23:44:19,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:44:19,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:19,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:19,799 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 23:44:19,801 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 23:44:19,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 23:44:19,859 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:44:19,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 23:44:19,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:19,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:44:19,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:44:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:19,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:44:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:20,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160341470] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:44:20,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:44:20,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-04-13 23:44:20,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628366836] [2025-04-13 23:44:20,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:44:20,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 23:44:20,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:20,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 23:44:20,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:44:20,074 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:20,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 160 flow. Second operand has 25 states, 25 states have (on average 3.4) internal successors, (85), 25 states have internal predecessors, (85), 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 23:44:20,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:20,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:20,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:20,475 INFO L116 PetriNetUnfolderBase]: 873/1317 cut-off events. [2025-04-13 23:44:20,475 INFO L117 PetriNetUnfolderBase]: For 7492/7492 co-relation queries the response was YES. [2025-04-13 23:44:20,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3972 conditions, 1317 events. 873/1317 cut-off events. For 7492/7492 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3837 event pairs, 39 based on Foata normal form. 192/1291 useless extension candidates. Maximal degree in co-relation 3944. Up to 337 conditions per place. [2025-04-13 23:44:20,484 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 195 selfloop transitions, 23 changer transitions 0/218 dead transitions. [2025-04-13 23:44:20,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 218 transitions, 1044 flow [2025-04-13 23:44:20,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 23:44:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 23:44:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 278 transitions. [2025-04-13 23:44:20,486 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4633333333333333 [2025-04-13 23:44:20,486 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 160 flow. Second operand 24 states and 278 transitions. [2025-04-13 23:44:20,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 218 transitions, 1044 flow [2025-04-13 23:44:20,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 218 transitions, 972 flow, removed 31 selfloop flow, removed 5 redundant places. [2025-04-13 23:44:20,499 INFO L231 Difference]: Finished difference. Result has 78 places, 42 transitions, 280 flow [2025-04-13 23:44:20,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=280, PETRI_PLACES=78, PETRI_TRANSITIONS=42} [2025-04-13 23:44:20,500 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 53 predicate places. [2025-04-13 23:44:20,500 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 42 transitions, 280 flow [2025-04-13 23:44:20,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.4) internal successors, (85), 25 states have internal predecessors, (85), 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 23:44:20,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:20,500 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:20,507 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 23:44:20,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:20,701 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 23:44:20,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:20,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1826129500, now seen corresponding path program 4 times [2025-04-13 23:44:20,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:20,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190750356] [2025-04-13 23:44:20,702 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:44:20,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:20,710 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 23:44:20,723 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:44:20,723 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:44:20,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:21,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:21,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190750356] [2025-04-13 23:44:21,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190750356] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:44:21,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018674746] [2025-04-13 23:44:21,129 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:44:21,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:21,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:21,131 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 23:44:21,133 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 23:44:21,169 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 23:44:21,196 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:44:21,196 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:44:21,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:21,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 23:44:21,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:44:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:21,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:44:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:21,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018674746] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:44:21,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:44:21,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 26 [2025-04-13 23:44:21,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331059790] [2025-04-13 23:44:21,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:44:21,535 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 23:44:21,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:21,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 23:44:21,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:44:21,536 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:21,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 42 transitions, 280 flow. Second operand has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 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 23:44:21,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:21,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:21,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:21,913 INFO L116 PetriNetUnfolderBase]: 937/1413 cut-off events. [2025-04-13 23:44:21,913 INFO L117 PetriNetUnfolderBase]: For 9892/9892 co-relation queries the response was YES. [2025-04-13 23:44:21,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4464 conditions, 1413 events. 937/1413 cut-off events. For 9892/9892 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4128 event pairs, 39 based on Foata normal form. 32/1211 useless extension candidates. Maximal degree in co-relation 4424. Up to 273 conditions per place. [2025-04-13 23:44:21,920 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 211 selfloop transitions, 25 changer transitions 0/236 dead transitions. [2025-04-13 23:44:21,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 236 transitions, 1152 flow [2025-04-13 23:44:21,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 23:44:21,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-13 23:44:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 290 transitions. [2025-04-13 23:44:21,922 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2025-04-13 23:44:21,922 INFO L175 Difference]: Start difference. First operand has 78 places, 42 transitions, 280 flow. Second operand 26 states and 290 transitions. [2025-04-13 23:44:21,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 236 transitions, 1152 flow [2025-04-13 23:44:21,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 236 transitions, 1052 flow, removed 39 selfloop flow, removed 11 redundant places. [2025-04-13 23:44:21,933 INFO L231 Difference]: Finished difference. Result has 94 places, 44 transitions, 256 flow [2025-04-13 23:44:21,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=256, PETRI_PLACES=94, PETRI_TRANSITIONS=44} [2025-04-13 23:44:21,933 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 69 predicate places. [2025-04-13 23:44:21,933 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 44 transitions, 256 flow [2025-04-13 23:44:21,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 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 23:44:21,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:21,934 INFO L206 CegarLoopForPetriNet]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:21,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 23:44:22,134 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:22,134 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 23:44:22,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:22,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1730029316, now seen corresponding path program 5 times [2025-04-13 23:44:22,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:22,135 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804678499] [2025-04-13 23:44:22,135 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:44:22,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:22,144 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 13 equivalence classes. [2025-04-13 23:44:22,208 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 23:44:22,208 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-04-13 23:44:22,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:23,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:23,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804678499] [2025-04-13 23:44:23,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804678499] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:44:23,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300884208] [2025-04-13 23:44:23,695 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:44:23,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:23,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:23,697 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 23:44:23,698 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 23:44:23,739 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 13 equivalence classes. [2025-04-13 23:44:23,773 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 23:44:23,773 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-04-13 23:44:23,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:23,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-04-13 23:44:23,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:44:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 253 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:25,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:44:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:26,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300884208] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:44:26,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:44:26,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2025-04-13 23:44:26,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796897863] [2025-04-13 23:44:26,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:44:26,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2025-04-13 23:44:26,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:26,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2025-04-13 23:44:26,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1161, Invalid=6495, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 23:44:26,710 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:26,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 44 transitions, 256 flow. Second operand has 88 states, 88 states have (on average 3.1931818181818183) internal successors, (281), 88 states have internal predecessors, (281), 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 23:44:26,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:26,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:26,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:46:45,023 INFO L116 PetriNetUnfolderBase]: 93910/141883 cut-off events. [2025-04-13 23:46:45,024 INFO L117 PetriNetUnfolderBase]: For 746448/746448 co-relation queries the response was YES. [2025-04-13 23:46:45,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427291 conditions, 141883 events. 93910/141883 cut-off events. For 746448/746448 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 973118 event pairs, 855 based on Foata normal form. 2092/125630 useless extension candidates. Maximal degree in co-relation 427249. Up to 22423 conditions per place. [2025-04-13 23:46:46,036 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 2379 selfloop transitions, 6586 changer transitions 1706/10671 dead transitions. [2025-04-13 23:46:46,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 822 places, 10671 transitions, 86141 flow [2025-04-13 23:46:46,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 729 states. [2025-04-13 23:46:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2025-04-13 23:46:46,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 6964 transitions. [2025-04-13 23:46:46,059 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3821124828532236 [2025-04-13 23:46:46,059 INFO L175 Difference]: Start difference. First operand has 94 places, 44 transitions, 256 flow. Second operand 729 states and 6964 transitions. [2025-04-13 23:46:46,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 822 places, 10671 transitions, 86141 flow [2025-04-13 23:46:50,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 799 places, 10671 transitions, 71647 flow, removed 2419 selfloop flow, removed 23 redundant places. [2025-04-13 23:46:50,264 INFO L231 Difference]: Finished difference. Result has 1177 places, 6704 transitions, 41981 flow [2025-04-13 23:46:50,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=729, PETRI_FLOW=41981, PETRI_PLACES=1177, PETRI_TRANSITIONS=6704} [2025-04-13 23:46:50,265 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 1152 predicate places. [2025-04-13 23:46:50,265 INFO L485 AbstractCegarLoop]: Abstraction has has 1177 places, 6704 transitions, 41981 flow [2025-04-13 23:46:50,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 3.1931818181818183) internal successors, (281), 88 states have internal predecessors, (281), 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 23:46:50,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:46:50,265 INFO L206 CegarLoopForPetriNet]: trace histogram [24, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:46:50,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 23:46:50,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:46:50,470 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 23:46:50,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:46:50,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1883627043, now seen corresponding path program 1 times [2025-04-13 23:46:50,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:46:50,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664122665] [2025-04-13 23:46:50,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:46:50,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:46:50,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 23:46:50,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 23:46:50,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:46:50,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:46:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:46:51,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:46:51,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664122665] [2025-04-13 23:46:51,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664122665] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:46:51,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673240789] [2025-04-13 23:46:51,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:46:51,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:46:51,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:46:51,716 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:46:51,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 23:46:51,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 23:46:51,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 23:46:51,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:46:51,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:46:51,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-04-13 23:46:51,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:46:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 253 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:46:52,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:46:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:46:54,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673240789] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:46:54,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:46:54,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2025-04-13 23:46:54,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080289479] [2025-04-13 23:46:54,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:46:54,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2025-04-13 23:46:54,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:46:54,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2025-04-13 23:46:54,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1257, Invalid=7673, Unknown=0, NotChecked=0, Total=8930 [2025-04-13 23:46:54,391 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:46:54,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1177 places, 6704 transitions, 41981 flow. Second operand has 95 states, 95 states have (on average 3.231578947368421) internal successors, (307), 95 states have internal predecessors, (307), 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 23:46:54,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:46:54,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:46:54,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand