/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-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:10:45,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:10:45,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:10:45,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:10:45,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:10:45,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:10:45,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:10:45,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:10:45,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:10:45,964 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:10:45,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:10:45,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:10:45,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:10:45,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:10:45,964 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:10:45,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:10:45,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:10:45,966 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:10:45,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:10:45,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:10:45,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:10:45,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:10:45,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:10:45,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:10:45,967 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:10:45,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:10:45,967 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:10:45,967 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:10:45,967 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:10:45,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:45,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:45,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:45,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:45,967 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:10:45,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:45,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:45,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:45,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:45,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:10:45,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:10:45,968 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:10:45,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:10:45,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:10:45,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:10:45,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:10:45,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:10:45,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:10:45,968 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:10:46,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:10:46,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:10:46,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:10:46,215 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:10:46,217 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:10:46,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-14 00:10:47,485 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e27a73d2/f967e24b81644628b219cc2458e382c1/FLAG018e47ab7 [2025-04-14 00:10:47,733 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:10:47,734 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-14 00:10:47,744 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e27a73d2/f967e24b81644628b219cc2458e382c1/FLAG018e47ab7 [2025-04-14 00:10:48,687 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e27a73d2/f967e24b81644628b219cc2458e382c1 [2025-04-14 00:10:48,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:10:48,690 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:10:48,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:10:48,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:10:48,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:10:48,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:10:48" (1/1) ... [2025-04-14 00:10:48,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c7d0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:48, skipping insertion in model container [2025-04-14 00:10:48,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:10:48" (1/1) ... [2025-04-14 00:10:48,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:10:48,889 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-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2025-04-14 00:10:49,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:10:49,091 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:10:49,113 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-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2025-04-14 00:10:49,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:10:49,208 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:10:49,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:49 WrapperNode [2025-04-14 00:10:49,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:10:49,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:10:49,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:10:49,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:10:49,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:49" (1/1) ... [2025-04-14 00:10:49,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:49" (1/1) ... [2025-04-14 00:10:49,260 INFO L138 Inliner]: procedures = 174, calls = 35, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 103 [2025-04-14 00:10:49,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:10:49,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:10:49,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:10:49,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:10:49,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:49" (1/1) ... [2025-04-14 00:10:49,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:49" (1/1) ... [2025-04-14 00:10:49,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:49" (1/1) ... [2025-04-14 00:10:49,297 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 00:10:49,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:49" (1/1) ... [2025-04-14 00:10:49,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:49" (1/1) ... [2025-04-14 00:10:49,303 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:49" (1/1) ... [2025-04-14 00:10:49,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:49" (1/1) ... [2025-04-14 00:10:49,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:49" (1/1) ... [2025-04-14 00:10:49,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:49" (1/1) ... [2025-04-14 00:10:49,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:10:49,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:10:49,321 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:10:49,321 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:10:49,322 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:49" (1/1) ... [2025-04-14 00:10:49,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:49,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:10:49,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:10:49,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:10:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:10:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:10:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-14 00:10:49,378 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-14 00:10:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-14 00:10:49,378 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-14 00:10:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:10:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:10:49,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:10:49,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:10:49,379 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:10:49,498 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:10:49,499 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:10:49,697 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:10:49,698 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:10:49,698 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:10:49,925 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:10:49,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:10:49 BoogieIcfgContainer [2025-04-14 00:10:49,926 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:10:49,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:10:49,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:10:49,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:10:49,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:10:48" (1/3) ... [2025-04-14 00:10:49,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6152a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:10:49, skipping insertion in model container [2025-04-14 00:10:49,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:49" (2/3) ... [2025-04-14 00:10:49,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6152a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:10:49, skipping insertion in model container [2025-04-14 00:10:49,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:10:49" (3/3) ... [2025-04-14 00:10:49,935 INFO L128 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-14 00:10:49,947 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:10:49,948 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 3 procedures, 28 locations, 25 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-14 00:10:49,948 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:10:49,982 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:10:50,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 62 flow [2025-04-14 00:10:50,041 INFO L116 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-04-14 00:10:50,043 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:10:50,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-14 00:10:50,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 27 transitions, 62 flow [2025-04-14 00:10:50,048 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 56 flow [2025-04-14 00:10:50,057 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:10:50,067 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;@3e2e8906, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:10:50,067 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 00:10:50,076 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:10:50,076 INFO L116 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-04-14 00:10:50,076 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:10:50,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:50,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 00:10:50,077 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:10:50,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:50,083 INFO L85 PathProgramCache]: Analyzing trace with hash 457263149, now seen corresponding path program 1 times [2025-04-14 00:10:50,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:50,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821649864] [2025-04-14 00:10:50,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:50,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:50,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 00:10:50,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 00:10:50,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:50,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:50,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:50,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821649864] [2025-04-14 00:10:50,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821649864] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:50,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:50,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:10:50,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646804129] [2025-04-14 00:10:50,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:50,521 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:10:50,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:50,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:10:50,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:10:50,541 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-14 00:10:50,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:50,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:50,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-14 00:10:50,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:50,768 INFO L116 PetriNetUnfolderBase]: 539/893 cut-off events. [2025-04-14 00:10:50,768 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-14 00:10:50,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1803 conditions, 893 events. 539/893 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3872 event pairs, 54 based on Foata normal form. 0/848 useless extension candidates. Maximal degree in co-relation 1793. Up to 766 conditions per place. [2025-04-14 00:10:50,777 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 31 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2025-04-14 00:10:50,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 150 flow [2025-04-14 00:10:50,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:10:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:10:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-04-14 00:10:50,790 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2025-04-14 00:10:50,791 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 3 states and 48 transitions. [2025-04-14 00:10:50,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 150 flow [2025-04-14 00:10:50,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:10:50,796 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 54 flow [2025-04-14 00:10:50,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2025-04-14 00:10:50,801 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2025-04-14 00:10:50,802 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 54 flow [2025-04-14 00:10:50,802 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:50,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:50,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:50,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:10:50,803 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:10:50,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:50,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1498741559, now seen corresponding path program 1 times [2025-04-14 00:10:50,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:50,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167440168] [2025-04-14 00:10:50,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:50,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:50,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 00:10:50,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 00:10:50,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:50,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:51,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:51,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:51,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167440168] [2025-04-14 00:10:51,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167440168] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:51,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:51,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:10:51,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890902901] [2025-04-14 00:10:51,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:51,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:10:51,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:51,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:10:51,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:10:51,039 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-14 00:10:51,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:51,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:51,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-14 00:10:51,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:51,240 INFO L116 PetriNetUnfolderBase]: 479/822 cut-off events. [2025-04-14 00:10:51,241 INFO L117 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-04-14 00:10:51,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1713 conditions, 822 events. 479/822 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3733 event pairs, 62 based on Foata normal form. 42/862 useless extension candidates. Maximal degree in co-relation 1703. Up to 536 conditions per place. [2025-04-14 00:10:51,248 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 34 selfloop transitions, 4 changer transitions 1/41 dead transitions. [2025-04-14 00:10:51,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 41 transitions, 174 flow [2025-04-14 00:10:51,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:10:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:10:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-14 00:10:51,250 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-04-14 00:10:51,250 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 54 flow. Second operand 4 states and 57 transitions. [2025-04-14 00:10:51,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 41 transitions, 174 flow [2025-04-14 00:10:51,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:10:51,253 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 76 flow [2025-04-14 00:10:51,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2025-04-14 00:10:51,253 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2025-04-14 00:10:51,253 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 76 flow [2025-04-14 00:10:51,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:51,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:51,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:51,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:10:51,254 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:10:51,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2102515414, now seen corresponding path program 1 times [2025-04-14 00:10:51,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:51,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653631713] [2025-04-14 00:10:51,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:51,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:51,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:10:51,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:10:51,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:51,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:51,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:51,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653631713] [2025-04-14 00:10:51,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653631713] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:51,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:51,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:10:51,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180992055] [2025-04-14 00:10:51,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:51,429 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:10:51,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:51,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:10:51,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:10:51,430 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-14 00:10:51,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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 00:10:51,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:51,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-14 00:10:51,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:51,591 INFO L116 PetriNetUnfolderBase]: 313/565 cut-off events. [2025-04-14 00:10:51,592 INFO L117 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2025-04-14 00:10:51,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 565 events. 313/565 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2330 event pairs, 78 based on Foata normal form. 40/602 useless extension candidates. Maximal degree in co-relation 1327. Up to 266 conditions per place. [2025-04-14 00:10:51,595 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 42 selfloop transitions, 4 changer transitions 1/49 dead transitions. [2025-04-14 00:10:51,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 49 transitions, 231 flow [2025-04-14 00:10:51,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:10:51,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:10:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-04-14 00:10:51,597 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-04-14 00:10:51,597 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 76 flow. Second operand 4 states and 63 transitions. [2025-04-14 00:10:51,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 49 transitions, 231 flow [2025-04-14 00:10:51,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 49 transitions, 222 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:10:51,599 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 95 flow [2025-04-14 00:10:51,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2025-04-14 00:10:51,599 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2025-04-14 00:10:51,599 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 95 flow [2025-04-14 00:10:51,599 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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 00:10:51,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:51,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:51,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:10:51,600 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:10:51,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:51,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1829054174, now seen corresponding path program 1 times [2025-04-14 00:10:51,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:51,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967195123] [2025-04-14 00:10:51,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:51,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:51,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 00:10:51,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:10:51,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:51,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:51,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:51,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967195123] [2025-04-14 00:10:51,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967195123] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:51,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:51,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:10:51,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391443273] [2025-04-14 00:10:51,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:51,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:10:51,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:51,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:10:51,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:10:51,807 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-14 00:10:51,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 00:10:51,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:51,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-14 00:10:51,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:51,934 INFO L116 PetriNetUnfolderBase]: 160/304 cut-off events. [2025-04-14 00:10:51,934 INFO L117 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2025-04-14 00:10:51,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 304 events. 160/304 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1015 event pairs, 56 based on Foata normal form. 22/323 useless extension candidates. Maximal degree in co-relation 763. Up to 131 conditions per place. [2025-04-14 00:10:51,936 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 34 selfloop transitions, 6 changer transitions 1/43 dead transitions. [2025-04-14 00:10:51,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 219 flow [2025-04-14 00:10:51,937 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:10:51,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:10:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-04-14 00:10:51,937 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2025-04-14 00:10:51,937 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 95 flow. Second operand 5 states and 61 transitions. [2025-04-14 00:10:51,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 219 flow [2025-04-14 00:10:51,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 206 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-14 00:10:51,942 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 108 flow [2025-04-14 00:10:51,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2025-04-14 00:10:51,943 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2025-04-14 00:10:51,943 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 108 flow [2025-04-14 00:10:51,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 00:10:51,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:51,943 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:51,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:10:51,943 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:10:51,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:51,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1946192799, now seen corresponding path program 1 times [2025-04-14 00:10:51,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:51,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414354324] [2025-04-14 00:10:51,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:51,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:51,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:10:52,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:10:52,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:52,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:52,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:52,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414354324] [2025-04-14 00:10:52,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414354324] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:52,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:52,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:10:52,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318493989] [2025-04-14 00:10:52,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:52,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:10:52,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:52,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:10:52,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:10:52,235 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-14 00:10:52,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:52,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:52,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-14 00:10:52,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:52,365 INFO L116 PetriNetUnfolderBase]: 201/387 cut-off events. [2025-04-14 00:10:52,365 INFO L117 PetriNetUnfolderBase]: For 248/248 co-relation queries the response was YES. [2025-04-14 00:10:52,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1017 conditions, 387 events. 201/387 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1420 event pairs, 91 based on Foata normal form. 4/388 useless extension candidates. Maximal degree in co-relation 1001. Up to 229 conditions per place. [2025-04-14 00:10:52,367 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 25 selfloop transitions, 2 changer transitions 15/44 dead transitions. [2025-04-14 00:10:52,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 262 flow [2025-04-14 00:10:52,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:10:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:10:52,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-04-14 00:10:52,368 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 00:10:52,368 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 108 flow. Second operand 4 states and 54 transitions. [2025-04-14 00:10:52,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 262 flow [2025-04-14 00:10:52,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 205 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-04-14 00:10:52,370 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 80 flow [2025-04-14 00:10:52,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2025-04-14 00:10:52,371 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2025-04-14 00:10:52,371 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 80 flow [2025-04-14 00:10:52,371 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:52,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:52,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:52,371 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:10:52,372 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:10:52,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:52,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1454216539, now seen corresponding path program 2 times [2025-04-14 00:10:52,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:52,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204498991] [2025-04-14 00:10:52,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:10:52,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:52,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:10:52,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:10:52,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:10:52,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:52,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:52,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204498991] [2025-04-14 00:10:52,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204498991] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:52,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:52,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:10:52,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067956674] [2025-04-14 00:10:52,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:52,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:10:52,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:52,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:10:52,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:10:52,961 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-14 00:10:52,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:52,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:52,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-14 00:10:52,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:53,129 INFO L116 PetriNetUnfolderBase]: 123/248 cut-off events. [2025-04-14 00:10:53,130 INFO L117 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-04-14 00:10:53,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 248 events. 123/248 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 744 event pairs, 54 based on Foata normal form. 4/251 useless extension candidates. Maximal degree in co-relation 568. Up to 107 conditions per place. [2025-04-14 00:10:53,132 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 22 selfloop transitions, 4 changer transitions 24/52 dead transitions. [2025-04-14 00:10:53,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 252 flow [2025-04-14 00:10:53,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:10:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:10:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2025-04-14 00:10:53,134 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36574074074074076 [2025-04-14 00:10:53,134 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 80 flow. Second operand 8 states and 79 transitions. [2025-04-14 00:10:53,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 252 flow [2025-04-14 00:10:53,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 232 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-14 00:10:53,136 INFO L231 Difference]: Finished difference. Result has 44 places, 25 transitions, 90 flow [2025-04-14 00:10:53,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=90, PETRI_PLACES=44, PETRI_TRANSITIONS=25} [2025-04-14 00:10:53,137 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2025-04-14 00:10:53,137 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 25 transitions, 90 flow [2025-04-14 00:10:53,137 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:53,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:53,138 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:53,138 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:10:53,139 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:10:53,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:53,139 INFO L85 PathProgramCache]: Analyzing trace with hash -29486381, now seen corresponding path program 3 times [2025-04-14 00:10:53,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:53,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786902953] [2025-04-14 00:10:53,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:10:53,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:53,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:10:53,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:10:53,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:10:53,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:10:53,196 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:10:53,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:10:53,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:10:53,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:53,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:10:53,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:10:53,255 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:10:53,255 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-14 00:10:53,257 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-14 00:10:53,257 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-14 00:10:53,257 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-14 00:10:53,257 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-14 00:10:53,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:10:53,257 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-04-14 00:10:53,333 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:10:53,334 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:10:53,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:10:53 BasicIcfg [2025-04-14 00:10:53,342 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:10:53,345 INFO L158 Benchmark]: Toolchain (without parser) took 4652.16ms. Allocated memory was 155.2MB in the beginning and 373.3MB in the end (delta: 218.1MB). Free memory was 107.4MB in the beginning and 230.7MB in the end (delta: -123.3MB). Peak memory consumption was 93.6MB. Max. memory is 8.0GB. [2025-04-14 00:10:53,346 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:10:53,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.34ms. Allocated memory is still 155.2MB. Free memory was 107.4MB in the beginning and 81.9MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 00:10:53,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.15ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 79.7MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:10:53,346 INFO L158 Benchmark]: Boogie Preprocessor took 56.21ms. Allocated memory is still 155.2MB. Free memory was 79.7MB in the beginning and 77.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:10:53,346 INFO L158 Benchmark]: IcfgBuilder took 604.97ms. Allocated memory is still 155.2MB. Free memory was 77.1MB in the beginning and 101.1MB in the end (delta: -24.0MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. [2025-04-14 00:10:53,347 INFO L158 Benchmark]: TraceAbstraction took 3414.77ms. Allocated memory was 155.2MB in the beginning and 373.3MB in the end (delta: 218.1MB). Free memory was 100.4MB in the beginning and 230.7MB in the end (delta: -130.4MB). Peak memory consumption was 86.6MB. Max. memory is 8.0GB. [2025-04-14 00:10:53,350 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.17ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 517.34ms. Allocated memory is still 155.2MB. Free memory was 107.4MB in the beginning and 81.9MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.15ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 79.7MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.21ms. Allocated memory is still 155.2MB. Free memory was 79.7MB in the beginning and 77.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 604.97ms. Allocated memory is still 155.2MB. Free memory was 77.1MB in the beginning and 101.1MB in the end (delta: -24.0MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3414.77ms. Allocated memory was 155.2MB in the beginning and 373.3MB in the end (delta: 218.1MB). Free memory was 100.4MB in the beginning and 230.7MB in the end (delta: -130.4MB). Peak memory consumption was 86.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L803] 0 pthread_t t2561; [L804] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2561=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L805] 0 pthread_t t2562; [L806] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2561=-2, t2562=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 1 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L778] 2 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L737] 1 y = 2 VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 x$flush_delayed = weak$$choice2 [L745] 1 x$mem_tmp = x [L746] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L747] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L748] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L749] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L750] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L752] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EAX = x [L754] 1 x = x$flush_delayed ? x$mem_tmp : x [L755] 1 x$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L781] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561=-2, t2562=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L810] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L810] RET 0 assume_abort_if_not(main$tmp_guard0) [L812] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L813] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L814] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L815] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L816] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561=-2, t2562=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561=-2, t2562=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: 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. - UnprovableResult [Line: 804]: 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: 806]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 46 locations, 43 edges, 5 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.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 154 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 414 IncrementalHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 0 mSDtfsCounter, 414 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=4, InterpolantAutomatonStates: 28, 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.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 343 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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 00:10:53,364 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...