/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-theta/unwind2-1.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:47:02,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:47:02,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:47:02,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:47:02,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:47:02,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:47:02,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:47:02,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:47:02,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:47:02,809 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:47:02,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:47:02,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:47:02,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:47:02,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:47:02,812 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:47:02,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:47:02,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:47:02,812 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:47:02,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:47:02,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:47:02,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:47:02,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:47:02,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:47:02,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:47:02,812 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:47:02,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:47:02,812 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:47:02,812 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:47:02,813 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:47:02,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:47:02,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:47:02,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:47:02,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:47:02,813 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:47:02,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:47:02,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:47:02,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:47:02,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:47:02,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:47:02,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:47:02,813 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:47:02,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:47:02,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:47:02,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:47:02,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:47:02,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:47:02,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:47:02,813 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:47:03,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:47:03,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:47:03,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:47:03,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:47:03,063 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:47:03,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/unwind2-1.i [2025-04-14 01:47:04,407 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7bdc8b8/fc7acea73da14bed99dd7cd401a38cf1/FLAGe29fba34d [2025-04-14 01:47:04,638 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:47:04,639 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind2-1.i [2025-04-14 01:47:04,655 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7bdc8b8/fc7acea73da14bed99dd7cd401a38cf1/FLAGe29fba34d [2025-04-14 01:47:05,457 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7bdc8b8/fc7acea73da14bed99dd7cd401a38cf1 [2025-04-14 01:47:05,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:47:05,460 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:47:05,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:47:05,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:47:05,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:47:05,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:47:05" (1/1) ... [2025-04-14 01:47:05,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@272f6a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:05, skipping insertion in model container [2025-04-14 01:47:05,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:47:05" (1/1) ... [2025-04-14 01:47:05,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:47:05,802 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-theta/unwind2-1.i[33026,33039] [2025-04-14 01:47:05,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:47:05,831 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:47:05,888 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-theta/unwind2-1.i[33026,33039] [2025-04-14 01:47:05,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:47:05,917 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:47:05,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:05 WrapperNode [2025-04-14 01:47:05,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:47:05,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:47:05,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:47:05,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:47:05,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:05" (1/1) ... [2025-04-14 01:47:05,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:05" (1/1) ... [2025-04-14 01:47:05,950 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2025-04-14 01:47:05,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:47:05,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:47:05,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:47:05,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:47:05,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:05" (1/1) ... [2025-04-14 01:47:05,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:05" (1/1) ... [2025-04-14 01:47:05,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:05" (1/1) ... [2025-04-14 01:47:05,972 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 01:47:05,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:05" (1/1) ... [2025-04-14 01:47:05,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:05" (1/1) ... [2025-04-14 01:47:05,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:05" (1/1) ... [2025-04-14 01:47:05,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:05" (1/1) ... [2025-04-14 01:47:05,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:05" (1/1) ... [2025-04-14 01:47:05,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:05" (1/1) ... [2025-04-14 01:47:05,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:47:05,980 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:47:05,980 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:47:05,980 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:47:05,981 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:05" (1/1) ... [2025-04-14 01:47:05,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:47:05,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:06,003 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 01:47:06,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 01:47:06,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:47:06,021 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-14 01:47:06,021 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-14 01:47:06,021 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-14 01:47:06,021 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-14 01:47:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:47:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:47:06,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:47:06,023 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:47:06,117 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:47:06,118 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:47:06,212 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:47:06,213 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:47:06,213 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:47:06,323 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:47:06,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:47:06 BoogieIcfgContainer [2025-04-14 01:47:06,324 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:47:06,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:47:06,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:47:06,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:47:06,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:47:05" (1/3) ... [2025-04-14 01:47:06,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331de6c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:47:06, skipping insertion in model container [2025-04-14 01:47:06,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:47:05" (2/3) ... [2025-04-14 01:47:06,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331de6c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:47:06, skipping insertion in model container [2025-04-14 01:47:06,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:47:06" (3/3) ... [2025-04-14 01:47:06,334 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-1.i [2025-04-14 01:47:06,344 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:47:06,345 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-1.i that has 3 procedures, 21 locations, 20 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-14 01:47:06,345 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:47:06,375 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 01:47:06,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 22 transitions, 58 flow [2025-04-14 01:47:06,418 INFO L116 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-04-14 01:47:06,419 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:47:06,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 2/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 21 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-14 01:47:06,421 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 22 transitions, 58 flow [2025-04-14 01:47:06,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 45 flow [2025-04-14 01:47:06,427 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:47:06,435 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;@66bfa906, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:47:06,435 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-14 01:47:06,443 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:47:06,443 INFO L116 PetriNetUnfolderBase]: 1/10 cut-off events. [2025-04-14 01:47:06,443 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 01:47:06,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:06,444 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 01:47:06,444 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:06,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:06,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1446625350, now seen corresponding path program 1 times [2025-04-14 01:47:06,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:06,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192111250] [2025-04-14 01:47:06,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:06,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:06,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 01:47:06,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 01:47:06,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:06,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:06,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:06,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192111250] [2025-04-14 01:47:06,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192111250] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:06,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:06,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:47:06,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595980384] [2025-04-14 01:47:06,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:06,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:47:06,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:06,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:47:06,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:47:06,734 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:06,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 45 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-14 01:47:06,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:06,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:06,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:06,935 INFO L116 PetriNetUnfolderBase]: 211/360 cut-off events. [2025-04-14 01:47:06,935 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-14 01:47:06,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 360 events. 211/360 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1351 event pairs, 26 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 690. Up to 153 conditions per place. [2025-04-14 01:47:06,940 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 49 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2025-04-14 01:47:06,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 57 transitions, 249 flow [2025-04-14 01:47:06,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:47:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:47:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2025-04-14 01:47:06,949 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.487012987012987 [2025-04-14 01:47:06,950 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 45 flow. Second operand 7 states and 75 transitions. [2025-04-14 01:47:06,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 57 transitions, 249 flow [2025-04-14 01:47:06,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 57 transitions, 239 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 01:47:06,959 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 93 flow [2025-04-14 01:47:06,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=93, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2025-04-14 01:47:06,963 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 6 predicate places. [2025-04-14 01:47:06,963 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 93 flow [2025-04-14 01:47:06,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-14 01:47:06,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:06,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:06,964 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:47:06,964 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:06,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:06,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1895713045, now seen corresponding path program 1 times [2025-04-14 01:47:06,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:06,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362367304] [2025-04-14 01:47:06,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:06,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:06,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 01:47:06,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 01:47:06,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:06,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:07,088 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-14 01:47:07,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:07,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362367304] [2025-04-14 01:47:07,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362367304] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:07,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839423311] [2025-04-14 01:47:07,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:07,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:07,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:07,090 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:07,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 01:47:07,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 01:47:07,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 01:47:07,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:07,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:07,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-14 01:47:07,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:07,192 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-14 01:47:07,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:07,227 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-14 01:47:07,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839423311] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:07,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:07,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-04-14 01:47:07,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507191435] [2025-04-14 01:47:07,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:07,228 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:47:07,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:07,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:47:07,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:47:07,229 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:07,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 93 flow. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:07,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:07,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:07,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:07,447 INFO L116 PetriNetUnfolderBase]: 289/476 cut-off events. [2025-04-14 01:47:07,447 INFO L117 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-04-14 01:47:07,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 476 events. 289/476 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1796 event pairs, 25 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 1242. Up to 210 conditions per place. [2025-04-14 01:47:07,453 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 44 selfloop transitions, 9 changer transitions 0/53 dead transitions. [2025-04-14 01:47:07,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 53 transitions, 288 flow [2025-04-14 01:47:07,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:47:07,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:47:07,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2025-04-14 01:47:07,455 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2025-04-14 01:47:07,455 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 93 flow. Second operand 6 states and 63 transitions. [2025-04-14 01:47:07,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 53 transitions, 288 flow [2025-04-14 01:47:07,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 53 transitions, 276 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-14 01:47:07,458 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 141 flow [2025-04-14 01:47:07,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2025-04-14 01:47:07,458 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 11 predicate places. [2025-04-14 01:47:07,458 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 141 flow [2025-04-14 01:47:07,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:07,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:07,458 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:07,465 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-14 01:47:07,659 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-14 01:47:07,659 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:07,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:07,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1379861324, now seen corresponding path program 1 times [2025-04-14 01:47:07,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:07,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183789932] [2025-04-14 01:47:07,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:07,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:07,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 01:47:07,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 01:47:07,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:07,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:07,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:07,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183789932] [2025-04-14 01:47:07,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183789932] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:07,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:07,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:47:07,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223640015] [2025-04-14 01:47:07,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:07,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:47:07,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:07,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:47:07,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:47:07,740 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:07,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:07,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:07,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:07,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:07,896 INFO L116 PetriNetUnfolderBase]: 343/564 cut-off events. [2025-04-14 01:47:07,896 INFO L117 PetriNetUnfolderBase]: For 1191/1191 co-relation queries the response was YES. [2025-04-14 01:47:07,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1910 conditions, 564 events. 343/564 cut-off events. For 1191/1191 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2139 event pairs, 66 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 1669. Up to 225 conditions per place. [2025-04-14 01:47:07,902 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 63 selfloop transitions, 10 changer transitions 0/73 dead transitions. [2025-04-14 01:47:07,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 73 transitions, 590 flow [2025-04-14 01:47:07,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:47:07,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:47:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2025-04-14 01:47:07,905 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2025-04-14 01:47:07,905 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 141 flow. Second operand 7 states and 72 transitions. [2025-04-14 01:47:07,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 73 transitions, 590 flow [2025-04-14 01:47:07,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 73 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:47:07,909 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 201 flow [2025-04-14 01:47:07,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=201, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2025-04-14 01:47:07,910 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 18 predicate places. [2025-04-14 01:47:07,910 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 201 flow [2025-04-14 01:47:07,910 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:07,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:07,910 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:07,910 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:47:07,910 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:07,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:07,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1362437594, now seen corresponding path program 2 times [2025-04-14 01:47:07,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:07,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888282588] [2025-04-14 01:47:07,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:47:07,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:07,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-04-14 01:47:07,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 01:47:07,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:47:07,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:08,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:08,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888282588] [2025-04-14 01:47:08,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888282588] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:08,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960704629] [2025-04-14 01:47:08,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:47:08,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:08,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:08,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:08,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 01:47:08,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-04-14 01:47:08,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 01:47:08,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:47:08,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:08,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:47:08,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:08,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:47:08,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960704629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:08,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:47:08,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-04-14 01:47:08,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128114583] [2025-04-14 01:47:08,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:08,072 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:47:08,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:08,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:47:08,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:47:08,072 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:08,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 201 flow. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-14 01:47:08,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:08,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:08,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:08,275 INFO L116 PetriNetUnfolderBase]: 290/504 cut-off events. [2025-04-14 01:47:08,275 INFO L117 PetriNetUnfolderBase]: For 955/955 co-relation queries the response was YES. [2025-04-14 01:47:08,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 504 events. 290/504 cut-off events. For 955/955 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1995 event pairs, 53 based on Foata normal form. 26/460 useless extension candidates. Maximal degree in co-relation 1896. Up to 224 conditions per place. [2025-04-14 01:47:08,278 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 63 selfloop transitions, 13 changer transitions 6/82 dead transitions. [2025-04-14 01:47:08,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 617 flow [2025-04-14 01:47:08,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:47:08,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:47:08,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2025-04-14 01:47:08,281 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2025-04-14 01:47:08,281 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 201 flow. Second operand 10 states and 92 transitions. [2025-04-14 01:47:08,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 617 flow [2025-04-14 01:47:08,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 82 transitions, 584 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-04-14 01:47:08,288 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 240 flow [2025-04-14 01:47:08,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=240, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2025-04-14 01:47:08,289 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 26 predicate places. [2025-04-14 01:47:08,289 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 240 flow [2025-04-14 01:47:08,290 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-14 01:47:08,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:08,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:08,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 01:47:08,491 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,SelfDestructingSolverStorable3 [2025-04-14 01:47:08,491 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:08,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:08,491 INFO L85 PathProgramCache]: Analyzing trace with hash 173972077, now seen corresponding path program 1 times [2025-04-14 01:47:08,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:08,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945605593] [2025-04-14 01:47:08,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:08,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:08,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-14 01:47:08,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 01:47:08,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:08,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:08,564 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-14 01:47:08,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:08,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945605593] [2025-04-14 01:47:08,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945605593] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:08,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859486593] [2025-04-14 01:47:08,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:08,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:08,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:08,566 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:08,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 01:47:08,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-14 01:47:08,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 01:47:08,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:08,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:08,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:47:08,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:08,641 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-14 01:47:08,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:08,675 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-14 01:47:08,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859486593] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:08,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:08,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-04-14 01:47:08,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583145507] [2025-04-14 01:47:08,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:08,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:47:08,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:08,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:47:08,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:47:08,676 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:08,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 240 flow. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:08,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:08,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:08,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:08,853 INFO L116 PetriNetUnfolderBase]: 339/588 cut-off events. [2025-04-14 01:47:08,853 INFO L117 PetriNetUnfolderBase]: For 1571/1571 co-relation queries the response was YES. [2025-04-14 01:47:08,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 588 events. 339/588 cut-off events. For 1571/1571 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2420 event pairs, 75 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 2137. Up to 261 conditions per place. [2025-04-14 01:47:08,857 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 66 selfloop transitions, 15 changer transitions 1/82 dead transitions. [2025-04-14 01:47:08,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 82 transitions, 761 flow [2025-04-14 01:47:08,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:47:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:47:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2025-04-14 01:47:08,858 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-04-14 01:47:08,858 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 240 flow. Second operand 9 states and 88 transitions. [2025-04-14 01:47:08,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 82 transitions, 761 flow [2025-04-14 01:47:08,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 82 transitions, 741 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-14 01:47:08,862 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 296 flow [2025-04-14 01:47:08,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=296, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2025-04-14 01:47:08,863 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 33 predicate places. [2025-04-14 01:47:08,863 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 296 flow [2025-04-14 01:47:08,863 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:08,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:08,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:08,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 01:47:09,063 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:09,064 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:09,064 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:09,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1654644805, now seen corresponding path program 1 times [2025-04-14 01:47:09,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:09,064 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091353427] [2025-04-14 01:47:09,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:09,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:09,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 01:47:09,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:47:09,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:09,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:09,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:09,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:09,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091353427] [2025-04-14 01:47:09,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091353427] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:09,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:09,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:47:09,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21122242] [2025-04-14 01:47:09,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:09,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:47:09,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:09,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:47:09,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:47:09,117 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:09,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 296 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-14 01:47:09,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:09,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:09,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:09,225 INFO L116 PetriNetUnfolderBase]: 321/558 cut-off events. [2025-04-14 01:47:09,226 INFO L117 PetriNetUnfolderBase]: For 1566/1566 co-relation queries the response was YES. [2025-04-14 01:47:09,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2611 conditions, 558 events. 321/558 cut-off events. For 1566/1566 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2215 event pairs, 81 based on Foata normal form. 12/504 useless extension candidates. Maximal degree in co-relation 2336. Up to 325 conditions per place. [2025-04-14 01:47:09,229 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 44 selfloop transitions, 12 changer transitions 1/57 dead transitions. [2025-04-14 01:47:09,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 561 flow [2025-04-14 01:47:09,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:47:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:47:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2025-04-14 01:47:09,230 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-04-14 01:47:09,230 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 296 flow. Second operand 6 states and 55 transitions. [2025-04-14 01:47:09,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 561 flow [2025-04-14 01:47:09,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 57 transitions, 512 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-04-14 01:47:09,235 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 285 flow [2025-04-14 01:47:09,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2025-04-14 01:47:09,235 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 33 predicate places. [2025-04-14 01:47:09,235 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 285 flow [2025-04-14 01:47:09,235 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-14 01:47:09,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:09,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:09,236 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:47:09,236 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:09,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:09,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1650002983, now seen corresponding path program 1 times [2025-04-14 01:47:09,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:09,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462538689] [2025-04-14 01:47:09,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:09,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:09,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 01:47:09,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:47:09,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:09,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:09,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:09,297 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462538689] [2025-04-14 01:47:09,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462538689] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:09,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:09,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:47:09,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398595847] [2025-04-14 01:47:09,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:09,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:47:09,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:09,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:47:09,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:47:09,298 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:09,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 285 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-14 01:47:09,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:09,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:09,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:09,414 INFO L116 PetriNetUnfolderBase]: 332/578 cut-off events. [2025-04-14 01:47:09,414 INFO L117 PetriNetUnfolderBase]: For 1746/1746 co-relation queries the response was YES. [2025-04-14 01:47:09,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2594 conditions, 578 events. 332/578 cut-off events. For 1746/1746 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2311 event pairs, 83 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 2480. Up to 347 conditions per place. [2025-04-14 01:47:09,417 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 48 selfloop transitions, 12 changer transitions 2/62 dead transitions. [2025-04-14 01:47:09,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 62 transitions, 566 flow [2025-04-14 01:47:09,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:47:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:47:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2025-04-14 01:47:09,418 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-04-14 01:47:09,418 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 285 flow. Second operand 6 states and 60 transitions. [2025-04-14 01:47:09,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 62 transitions, 566 flow [2025-04-14 01:47:09,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 537 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-14 01:47:09,422 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 304 flow [2025-04-14 01:47:09,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=304, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2025-04-14 01:47:09,423 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 35 predicate places. [2025-04-14 01:47:09,423 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 304 flow [2025-04-14 01:47:09,423 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-14 01:47:09,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:09,423 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:09,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:47:09,424 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:09,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:09,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1098167252, now seen corresponding path program 2 times [2025-04-14 01:47:09,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:09,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906355953] [2025-04-14 01:47:09,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:47:09,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:09,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-14 01:47:09,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:47:09,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:47:09,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:09,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:09,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906355953] [2025-04-14 01:47:09,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906355953] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:09,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419211689] [2025-04-14 01:47:09,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:47:09,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:09,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:09,518 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:47:09,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 01:47:09,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-14 01:47:09,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:47:09,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:47:09,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:09,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-14 01:47:09,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:09,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:09,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419211689] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:09,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:09,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-14 01:47:09,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079384636] [2025-04-14 01:47:09,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:09,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 01:47:09,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:09,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 01:47:09,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-04-14 01:47:09,761 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2025-04-14 01:47:09,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 304 flow. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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-14 01:47:09,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:09,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2025-04-14 01:47:09,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:10,056 INFO L116 PetriNetUnfolderBase]: 424/736 cut-off events. [2025-04-14 01:47:10,056 INFO L117 PetriNetUnfolderBase]: For 2756/2756 co-relation queries the response was YES. [2025-04-14 01:47:10,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3523 conditions, 736 events. 424/736 cut-off events. For 2756/2756 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3211 event pairs, 58 based on Foata normal form. 0/637 useless extension candidates. Maximal degree in co-relation 3182. Up to 207 conditions per place. [2025-04-14 01:47:10,061 INFO L140 encePairwiseOnDemand]: 14/22 looper letters, 89 selfloop transitions, 19 changer transitions 13/121 dead transitions. [2025-04-14 01:47:10,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 121 transitions, 1199 flow [2025-04-14 01:47:10,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:47:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:47:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 124 transitions. [2025-04-14 01:47:10,062 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43356643356643354 [2025-04-14 01:47:10,062 INFO L175 Difference]: Start difference. First operand has 58 places, 38 transitions, 304 flow. Second operand 13 states and 124 transitions. [2025-04-14 01:47:10,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 121 transitions, 1199 flow [2025-04-14 01:47:10,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 121 transitions, 1161 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-14 01:47:10,069 INFO L231 Difference]: Finished difference. Result has 71 places, 42 transitions, 398 flow [2025-04-14 01:47:10,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=398, PETRI_PLACES=71, PETRI_TRANSITIONS=42} [2025-04-14 01:47:10,072 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 48 predicate places. [2025-04-14 01:47:10,072 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 42 transitions, 398 flow [2025-04-14 01:47:10,072 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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-14 01:47:10,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:10,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:10,079 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-14 01:47:10,273 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:10,273 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 01:47:10,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:10,274 INFO L85 PathProgramCache]: Analyzing trace with hash 389515240, now seen corresponding path program 1 times [2025-04-14 01:47:10,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:10,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974786056] [2025-04-14 01:47:10,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:10,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:10,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:47:10,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:47:10,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:10,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:47:10,280 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 01:47:10,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:47:10,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:47:10,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:10,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:47:10,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 01:47:10,297 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 01:47:10,297 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-14 01:47:10,298 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-14 01:47:10,298 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-14 01:47:10,299 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-14 01:47:10,299 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-14 01:47:10,299 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-14 01:47:10,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:47:10,299 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-04-14 01:47:10,333 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:47:10,333 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:47:10,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:47:10 BasicIcfg [2025-04-14 01:47:10,336 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:47:10,338 INFO L158 Benchmark]: Toolchain (without parser) took 4877.30ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 84.5MB in the end (delta: 12.8MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. [2025-04-14 01:47:10,338 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 155.2MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:47:10,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.16ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 74.0MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 01:47:10,340 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.62ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 72.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:47:10,341 INFO L158 Benchmark]: Boogie Preprocessor took 28.95ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 70.5MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:47:10,341 INFO L158 Benchmark]: IcfgBuilder took 343.75ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 47.7MB in the end (delta: 22.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 01:47:10,341 INFO L158 Benchmark]: TraceAbstraction took 4011.65ms. Allocated memory is still 142.6MB. Free memory was 47.1MB in the beginning and 84.5MB in the end (delta: -37.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:47:10,342 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.29ms. Allocated memory is still 155.2MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 457.16ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 74.0MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.62ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 72.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.95ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 70.5MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 343.75ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 47.7MB in the end (delta: 22.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4011.65ms. Allocated memory is still 142.6MB. Free memory was 47.1MB in the beginning and 84.5MB in the end (delta: -37.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = 1 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=1, limit=0, t1=-1] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\at(arg, Pre)={0:0}, _N=1, arg={0:0}, lim=1, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=1, limit=0, t1=-1, t2=0] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\at(arg, Pre)={0:0}, _N=1, arg={0:0}, lim=2, limit=0] [L768] 2 limit = lim VAL [\at(arg, Pre)={0:0}, _N=1, arg={0:0}, lim=2, limit=2] [L759] 1 limit = lim VAL [\at(arg, Pre)={0:0}, _N=1, arg={0:0}, lim=1, limit=1] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\at(arg, Pre)={0:0}, _N=1, arg={0:0}, bound=1, i=0, lim=2, limit=1] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\at(arg, Pre)={0:0}, _N=1, arg={0:0}, bound=1, i=1, lim=2, limit=1] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression [L753] 2 reach_error() VAL [\at(expression, Pre)=0, _N=1, expression=0, limit=1] - UnprovableResult [Line: 778]: 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: 779]: 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: 753]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 35 locations, 38 edges, 6 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: 3.9s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 632 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 632 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1182 IncrementalHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 0 mSDtfsCounter, 1182 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=398occurred in iteration=8, InterpolantAutomatonStates: 64, 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.0s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 503 SizeOfPredicates, 9 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 5/21 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-14 01:47:10,359 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...