/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/mix036_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:04:27,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:04:27,938 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:04:27,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:04:27,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:04:27,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:04:27,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:04:27,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:04:27,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:04:27,959 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:04:27,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:04:27,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:04:27,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:04:27,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:04:27,959 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:04:27,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:04:27,959 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:04:27,959 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:04:27,959 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:04:27,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:04:27,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:04:27,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:04:27,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:04:27,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:04:27,960 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:04:27,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:04:27,960 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:04:27,960 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:04:27,960 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:04:27,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:04:27,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:04:27,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:04:27,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:04:27,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:04:27,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:04:27,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:04:27,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:04:27,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:04:27,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:04:27,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:04:27,961 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:04:27,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:04:27,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:04:27,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:04:27,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:04:27,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:04:27,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:04:27,961 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:04:28,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:04:28,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:04:28,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:04:28,174 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:04:28,175 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:04:28,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i [2025-04-14 00:04:29,410 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/637e6440c/066cdd4e0043468fbd8251befdef0d64/FLAG01cd577c7 [2025-04-14 00:04:29,644 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:04:29,645 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i [2025-04-14 00:04:29,655 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/637e6440c/066cdd4e0043468fbd8251befdef0d64/FLAG01cd577c7 [2025-04-14 00:04:30,612 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/637e6440c/066cdd4e0043468fbd8251befdef0d64 [2025-04-14 00:04:30,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:04:30,615 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:04:30,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:04:30,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:04:30,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:04:30,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:04:30" (1/1) ... [2025-04-14 00:04:30,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ebd106e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:04:30, skipping insertion in model container [2025-04-14 00:04:30,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:04:30" (1/1) ... [2025-04-14 00:04:30,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:04:30,784 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/mix036_power.opt_rmo.opt.i[958,971] [2025-04-14 00:04:30,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:04:30,907 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:04:30,923 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/mix036_power.opt_rmo.opt.i[958,971] [2025-04-14 00:04:30,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:04:30,998 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:04:30,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:04:30 WrapperNode [2025-04-14 00:04:30,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:04:30,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:04:30,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:04:31,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:04:31,004 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:04:30" (1/1) ... [2025-04-14 00:04:31,015 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:04:30" (1/1) ... [2025-04-14 00:04:31,038 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2025-04-14 00:04:31,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:04:31,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:04:31,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:04:31,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:04:31,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:04:30" (1/1) ... [2025-04-14 00:04:31,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:04:30" (1/1) ... [2025-04-14 00:04:31,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:04:30" (1/1) ... [2025-04-14 00:04:31,076 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:04:31,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:04:30" (1/1) ... [2025-04-14 00:04:31,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:04:30" (1/1) ... [2025-04-14 00:04:31,084 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:04:30" (1/1) ... [2025-04-14 00:04:31,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:04:30" (1/1) ... [2025-04-14 00:04:31,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:04:30" (1/1) ... [2025-04-14 00:04:31,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:04:30" (1/1) ... [2025-04-14 00:04:31,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:04:31,099 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:04:31,099 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:04:31,099 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:04:31,100 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:04:30" (1/1) ... [2025-04-14 00:04:31,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:04:31,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:04:31,122 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:04:31,123 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:04:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:04:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:04:31,137 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-14 00:04:31,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-14 00:04:31,138 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-14 00:04:31,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-14 00:04:31,138 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-14 00:04:31,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-14 00:04:31,138 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-04-14 00:04:31,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-04-14 00:04:31,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:04:31,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:04:31,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:04:31,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:04:31,139 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:04:31,252 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:04:31,254 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:04:31,514 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:04:31,515 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:04:31,515 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:04:31,735 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:04:31,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:04:31 BoogieIcfgContainer [2025-04-14 00:04:31,736 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:04:31,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:04:31,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:04:31,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:04:31,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:04:30" (1/3) ... [2025-04-14 00:04:31,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45df7195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:04:31, skipping insertion in model container [2025-04-14 00:04:31,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:04:30" (2/3) ... [2025-04-14 00:04:31,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45df7195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:04:31, skipping insertion in model container [2025-04-14 00:04:31,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:04:31" (3/3) ... [2025-04-14 00:04:31,744 INFO L128 eAbstractionObserver]: Analyzing ICFG mix036_power.opt_rmo.opt.i [2025-04-14 00:04:31,753 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:04:31,754 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix036_power.opt_rmo.opt.i that has 5 procedures, 47 locations, 42 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-14 00:04:31,754 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:04:31,799 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:04:31,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 46 transitions, 108 flow [2025-04-14 00:04:31,849 INFO L116 PetriNetUnfolderBase]: 0/42 cut-off events. [2025-04-14 00:04:31,852 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:04:31,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-14 00:04:31,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 46 transitions, 108 flow [2025-04-14 00:04:31,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 42 transitions, 96 flow [2025-04-14 00:04:31,865 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:04:31,875 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;@4dc01bd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:04:31,875 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-14 00:04:31,882 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:04:31,882 INFO L116 PetriNetUnfolderBase]: 0/17 cut-off events. [2025-04-14 00:04:31,882 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:04:31,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:04:31,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:04:31,883 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:04:31,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:04:31,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1811653889, now seen corresponding path program 1 times [2025-04-14 00:04:31,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:04:31,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914321074] [2025-04-14 00:04:31,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:04:31,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:04:31,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 00:04:31,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 00:04:31,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:04:31,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:04:32,253 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:04:32,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:04:32,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914321074] [2025-04-14 00:04:32,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914321074] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:04:32,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:04:32,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:04:32,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064963654] [2025-04-14 00:04:32,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:04:32,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:04:32,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:04:32,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:04:32,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:04:32,282 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2025-04-14 00:04:32,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:04:32,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:04:32,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2025-04-14 00:04:32,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:04:35,870 INFO L116 PetriNetUnfolderBase]: 46139/60509 cut-off events. [2025-04-14 00:04:35,870 INFO L117 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-04-14 00:04:35,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121513 conditions, 60509 events. 46139/60509 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 1760. Compared 347820 event pairs, 5819 based on Foata normal form. 0/58740 useless extension candidates. Maximal degree in co-relation 121501. Up to 52201 conditions per place. [2025-04-14 00:04:36,162 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 59 selfloop transitions, 2 changer transitions 2/67 dead transitions. [2025-04-14 00:04:36,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 275 flow [2025-04-14 00:04:36,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:04:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:04:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-04-14 00:04:36,172 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2025-04-14 00:04:36,173 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 96 flow. Second operand 3 states and 88 transitions. [2025-04-14 00:04:36,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 275 flow [2025-04-14 00:04:36,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 270 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:04:36,184 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 92 flow [2025-04-14 00:04:36,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2025-04-14 00:04:36,188 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2025-04-14 00:04:36,188 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 92 flow [2025-04-14 00:04:36,188 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:04:36,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:04:36,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:04:36,188 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:04:36,188 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:04:36,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:04:36,189 INFO L85 PathProgramCache]: Analyzing trace with hash -769165520, now seen corresponding path program 1 times [2025-04-14 00:04:36,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:04:36,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615194197] [2025-04-14 00:04:36,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:04:36,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:04:36,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:04:36,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:04:36,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:04:36,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:04:36,423 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:04:36,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:04:36,423 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615194197] [2025-04-14 00:04:36,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615194197] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:04:36,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:04:36,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:04:36,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845526496] [2025-04-14 00:04:36,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:04:36,424 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:04:36,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:04:36,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:04:36,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:04:36,424 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2025-04-14 00:04:36,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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:04:36,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:04:36,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2025-04-14 00:04:36,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:04:39,160 INFO L116 PetriNetUnfolderBase]: 37115/49577 cut-off events. [2025-04-14 00:04:39,161 INFO L117 PetriNetUnfolderBase]: For 1896/1896 co-relation queries the response was YES. [2025-04-14 00:04:39,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101531 conditions, 49577 events. 37115/49577 cut-off events. For 1896/1896 co-relation queries the response was YES. Maximal size of possible extension queue 1557. Compared 289332 event pairs, 5075 based on Foata normal form. 1728/51259 useless extension candidates. Maximal degree in co-relation 101521. Up to 28201 conditions per place. [2025-04-14 00:04:39,327 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 77 selfloop transitions, 6 changer transitions 1/88 dead transitions. [2025-04-14 00:04:39,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 88 transitions, 366 flow [2025-04-14 00:04:39,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:04:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:04:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2025-04-14 00:04:39,330 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6413043478260869 [2025-04-14 00:04:39,330 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 4 states and 118 transitions. [2025-04-14 00:04:39,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 88 transitions, 366 flow [2025-04-14 00:04:39,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 88 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:04:39,335 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 130 flow [2025-04-14 00:04:39,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2025-04-14 00:04:39,336 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2025-04-14 00:04:39,336 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 130 flow [2025-04-14 00:04:39,337 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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:04:39,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:04:39,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:04:39,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:04:39,337 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:04:39,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:04:39,337 INFO L85 PathProgramCache]: Analyzing trace with hash -257202754, now seen corresponding path program 1 times [2025-04-14 00:04:39,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:04:39,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042677930] [2025-04-14 00:04:39,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:04:39,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:04:39,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:04:39,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:04:39,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:04:39,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:04:39,494 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:04:39,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:04:39,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042677930] [2025-04-14 00:04:39,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042677930] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:04:39,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:04:39,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:04:39,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544254784] [2025-04-14 00:04:39,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:04:39,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:04:39,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:04:39,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:04:39,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:04:39,495 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2025-04-14 00:04:39,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:04:39,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:04:39,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2025-04-14 00:04:39,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:04:40,947 INFO L116 PetriNetUnfolderBase]: 23963/32521 cut-off events. [2025-04-14 00:04:40,951 INFO L117 PetriNetUnfolderBase]: For 6790/6790 co-relation queries the response was YES. [2025-04-14 00:04:41,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74681 conditions, 32521 events. 23963/32521 cut-off events. For 6790/6790 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 182712 event pairs, 2975 based on Foata normal form. 1344/33819 useless extension candidates. Maximal degree in co-relation 74669. Up to 12361 conditions per place. [2025-04-14 00:04:41,173 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 100 selfloop transitions, 10 changer transitions 1/115 dead transitions. [2025-04-14 00:04:41,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 115 transitions, 523 flow [2025-04-14 00:04:41,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:04:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:04:41,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2025-04-14 00:04:41,178 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6652173913043479 [2025-04-14 00:04:41,178 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 130 flow. Second operand 5 states and 153 transitions. [2025-04-14 00:04:41,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 115 transitions, 523 flow [2025-04-14 00:04:41,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 115 transitions, 512 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:04:41,192 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 182 flow [2025-04-14 00:04:41,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2025-04-14 00:04:41,193 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2025-04-14 00:04:41,193 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 182 flow [2025-04-14 00:04:41,194 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:04:41,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:04:41,194 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, 1, 1, 1] [2025-04-14 00:04:41,194 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:04:41,194 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:04:41,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:04:41,195 INFO L85 PathProgramCache]: Analyzing trace with hash 208546610, now seen corresponding path program 1 times [2025-04-14 00:04:41,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:04:41,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142825136] [2025-04-14 00:04:41,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:04:41,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:04:41,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:04:41,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:04:41,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:04:41,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:04:41,439 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:04:41,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:04:41,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142825136] [2025-04-14 00:04:41,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142825136] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:04:41,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:04:41,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:04:41,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039385491] [2025-04-14 00:04:41,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:04:41,440 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:04:41,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:04:41,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:04:41,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:04:41,440 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2025-04-14 00:04:41,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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:04:41,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:04:41,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2025-04-14 00:04:41,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:04:43,283 INFO L116 PetriNetUnfolderBase]: 14779/20233 cut-off events. [2025-04-14 00:04:43,284 INFO L117 PetriNetUnfolderBase]: For 12838/12838 co-relation queries the response was YES. [2025-04-14 00:04:43,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50213 conditions, 20233 events. 14779/20233 cut-off events. For 12838/12838 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 107206 event pairs, 2591 based on Foata normal form. 640/20827 useless extension candidates. Maximal degree in co-relation 50199. Up to 6144 conditions per place. [2025-04-14 00:04:43,406 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 121 selfloop transitions, 14 changer transitions 1/140 dead transitions. [2025-04-14 00:04:43,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 140 transitions, 686 flow [2025-04-14 00:04:43,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:04:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:04:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2025-04-14 00:04:43,408 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6739130434782609 [2025-04-14 00:04:43,408 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 182 flow. Second operand 6 states and 186 transitions. [2025-04-14 00:04:43,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 140 transitions, 686 flow [2025-04-14 00:04:43,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 140 transitions, 656 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-14 00:04:43,613 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 232 flow [2025-04-14 00:04:43,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2025-04-14 00:04:43,615 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2025-04-14 00:04:43,615 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 232 flow [2025-04-14 00:04:43,615 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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:04:43,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:04:43,616 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:04:43,616 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:04:43,616 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:04:43,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:04:43,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1851398332, now seen corresponding path program 1 times [2025-04-14 00:04:43,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:04:43,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66838929] [2025-04-14 00:04:43,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:04:43,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:04:43,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:04:43,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:04:43,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:04:43,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:04:44,141 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:04:44,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:04:44,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66838929] [2025-04-14 00:04:44,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66838929] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:04:44,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:04:44,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:04:44,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330139111] [2025-04-14 00:04:44,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:04:44,142 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:04:44,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:04:44,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:04:44,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:04:44,143 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2025-04-14 00:04:44,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:04:44,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:04:44,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2025-04-14 00:04:44,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:04:45,598 INFO L116 PetriNetUnfolderBase]: 11683/15937 cut-off events. [2025-04-14 00:04:45,598 INFO L117 PetriNetUnfolderBase]: For 12446/12446 co-relation queries the response was YES. [2025-04-14 00:04:45,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40502 conditions, 15937 events. 11683/15937 cut-off events. For 12446/12446 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 82897 event pairs, 2399 based on Foata normal form. 160/16051 useless extension candidates. Maximal degree in co-relation 40487. Up to 6144 conditions per place. [2025-04-14 00:04:45,665 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 104 selfloop transitions, 18 changer transitions 1/127 dead transitions. [2025-04-14 00:04:45,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 127 transitions, 644 flow [2025-04-14 00:04:45,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:04:45,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:04:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2025-04-14 00:04:45,667 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.562111801242236 [2025-04-14 00:04:45,667 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 232 flow. Second operand 7 states and 181 transitions. [2025-04-14 00:04:45,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 127 transitions, 644 flow [2025-04-14 00:04:45,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 127 transitions, 598 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-04-14 00:04:45,890 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 242 flow [2025-04-14 00:04:45,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=242, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2025-04-14 00:04:45,891 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2025-04-14 00:04:45,891 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 242 flow [2025-04-14 00:04:45,891 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:04:45,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:04:45,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:04:45,892 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:04:45,892 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:04:45,892 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:04:45,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1056190118, now seen corresponding path program 1 times [2025-04-14 00:04:45,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:04:45,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177502099] [2025-04-14 00:04:45,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:04:45,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:04:45,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:04:45,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:04:45,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:04:45,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:04:46,670 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:04:46,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:04:46,670 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177502099] [2025-04-14 00:04:46,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177502099] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:04:46,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:04:46,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:04:46,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938826693] [2025-04-14 00:04:46,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:04:46,671 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:04:46,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:04:46,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:04:46,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:04:46,671 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2025-04-14 00:04:46,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 242 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:04:46,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:04:46,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2025-04-14 00:04:46,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:04:47,948 INFO L116 PetriNetUnfolderBase]: 15347/20912 cut-off events. [2025-04-14 00:04:47,949 INFO L117 PetriNetUnfolderBase]: For 15708/15708 co-relation queries the response was YES. [2025-04-14 00:04:48,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53414 conditions, 20912 events. 15347/20912 cut-off events. For 15708/15708 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 112586 event pairs, 3859 based on Foata normal form. 16/20921 useless extension candidates. Maximal degree in co-relation 53398. Up to 13684 conditions per place. [2025-04-14 00:04:48,148 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 115 selfloop transitions, 11 changer transitions 12/142 dead transitions. [2025-04-14 00:04:48,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 142 transitions, 894 flow [2025-04-14 00:04:48,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:04:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:04:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2025-04-14 00:04:48,149 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5688405797101449 [2025-04-14 00:04:48,149 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 242 flow. Second operand 6 states and 157 transitions. [2025-04-14 00:04:48,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 142 transitions, 894 flow [2025-04-14 00:04:48,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 142 transitions, 669 flow, removed 34 selfloop flow, removed 10 redundant places. [2025-04-14 00:04:48,452 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 223 flow [2025-04-14 00:04:48,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2025-04-14 00:04:48,453 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2025-04-14 00:04:48,453 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 223 flow [2025-04-14 00:04:48,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:04:48,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:04:48,454 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:04:48,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:04:48,454 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:04:48,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:04:48,454 INFO L85 PathProgramCache]: Analyzing trace with hash 513328556, now seen corresponding path program 2 times [2025-04-14 00:04:48,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:04:48,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319472354] [2025-04-14 00:04:48,458 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:04:48,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:04:48,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:04:48,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:04:48,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:04:48,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:04:48,861 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:04:48,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:04:48,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319472354] [2025-04-14 00:04:48,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319472354] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:04:48,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:04:48,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:04:48,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507278573] [2025-04-14 00:04:48,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:04:48,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:04:48,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:04:48,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:04:48,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:04:48,862 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2025-04-14 00:04:48,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:04:48,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:04:48,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2025-04-14 00:04:48,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:04:50,935 INFO L116 PetriNetUnfolderBase]: 23997/32826 cut-off events. [2025-04-14 00:04:50,935 INFO L117 PetriNetUnfolderBase]: For 14798/14798 co-relation queries the response was YES. [2025-04-14 00:04:51,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82915 conditions, 32826 events. 23997/32826 cut-off events. For 14798/14798 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 187497 event pairs, 4715 based on Foata normal form. 16/32825 useless extension candidates. Maximal degree in co-relation 82900. Up to 17384 conditions per place. [2025-04-14 00:04:51,074 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 82 selfloop transitions, 1 changer transitions 55/142 dead transitions. [2025-04-14 00:04:51,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 142 transitions, 787 flow [2025-04-14 00:04:51,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:04:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:04:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-04-14 00:04:51,083 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5695652173913044 [2025-04-14 00:04:51,083 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 223 flow. Second operand 5 states and 131 transitions. [2025-04-14 00:04:51,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 142 transitions, 787 flow [2025-04-14 00:04:51,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 142 transitions, 785 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:04:51,096 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 227 flow [2025-04-14 00:04:51,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2025-04-14 00:04:51,100 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 13 predicate places. [2025-04-14 00:04:51,100 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 227 flow [2025-04-14 00:04:51,100 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:04:51,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:04:51,100 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:04:51,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:04:51,100 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:04:51,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:04:51,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1245803060, now seen corresponding path program 3 times [2025-04-14 00:04:51,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:04:51,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612560508] [2025-04-14 00:04:51,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:04:51,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:04:51,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:04:51,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:04:51,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:04:51,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:04:51,767 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:04:51,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:04:51,768 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612560508] [2025-04-14 00:04:51,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612560508] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:04:51,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:04:51,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:04:51,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120396252] [2025-04-14 00:04:51,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:04:51,768 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:04:51,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:04:51,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:04:51,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:04:51,769 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2025-04-14 00:04:51,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 227 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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:04:51,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:04:51,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2025-04-14 00:04:51,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:04:53,479 INFO L116 PetriNetUnfolderBase]: 18997/26262 cut-off events. [2025-04-14 00:04:53,479 INFO L117 PetriNetUnfolderBase]: For 15882/15882 co-relation queries the response was YES. [2025-04-14 00:04:53,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67056 conditions, 26262 events. 18997/26262 cut-off events. For 15882/15882 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 149380 event pairs, 2545 based on Foata normal form. 16/26271 useless extension candidates. Maximal degree in co-relation 67038. Up to 11486 conditions per place. [2025-04-14 00:04:53,576 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 86 selfloop transitions, 14 changer transitions 130/234 dead transitions. [2025-04-14 00:04:53,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 234 transitions, 1317 flow [2025-04-14 00:04:53,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 00:04:53,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 00:04:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 296 transitions. [2025-04-14 00:04:53,580 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49498327759197325 [2025-04-14 00:04:53,580 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 227 flow. Second operand 13 states and 296 transitions. [2025-04-14 00:04:53,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 234 transitions, 1317 flow [2025-04-14 00:04:53,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 234 transitions, 1300 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-14 00:04:53,590 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 272 flow [2025-04-14 00:04:53,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=272, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2025-04-14 00:04:53,591 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 25 predicate places. [2025-04-14 00:04:53,592 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 272 flow [2025-04-14 00:04:53,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 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:04:53,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:04:53,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:04:53,592 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:04:53,592 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:04:53,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:04:53,592 INFO L85 PathProgramCache]: Analyzing trace with hash 848224606, now seen corresponding path program 4 times [2025-04-14 00:04:53,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:04:53,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546523836] [2025-04-14 00:04:53,593 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:04:53,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:04:53,604 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-14 00:04:53,633 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:04:53,633 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:04:53,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:04:53,774 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:04:53,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:04:53,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546523836] [2025-04-14 00:04:53,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546523836] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:04:53,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:04:53,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:04:53,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290017823] [2025-04-14 00:04:53,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:04:53,776 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:04:53,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:04:53,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:04:53,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:04:53,776 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2025-04-14 00:04:53,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:04:53,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:04:53,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2025-04-14 00:04:53,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:04:54,732 INFO L116 PetriNetUnfolderBase]: 12235/17242 cut-off events. [2025-04-14 00:04:54,732 INFO L117 PetriNetUnfolderBase]: For 13318/13318 co-relation queries the response was YES. [2025-04-14 00:04:54,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47330 conditions, 17242 events. 12235/17242 cut-off events. For 13318/13318 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 96348 event pairs, 3395 based on Foata normal form. 16/17252 useless extension candidates. Maximal degree in co-relation 47308. Up to 8792 conditions per place. [2025-04-14 00:04:54,767 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 59 selfloop transitions, 1 changer transitions 78/142 dead transitions. [2025-04-14 00:04:54,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 142 transitions, 865 flow [2025-04-14 00:04:54,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:04:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:04:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2025-04-14 00:04:54,768 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5260869565217391 [2025-04-14 00:04:54,768 INFO L175 Difference]: Start difference. First operand has 80 places, 66 transitions, 272 flow. Second operand 5 states and 121 transitions. [2025-04-14 00:04:54,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 142 transitions, 865 flow [2025-04-14 00:04:54,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 142 transitions, 833 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-04-14 00:04:54,772 INFO L231 Difference]: Finished difference. Result has 74 places, 60 transitions, 231 flow [2025-04-14 00:04:54,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=74, PETRI_TRANSITIONS=60} [2025-04-14 00:04:54,772 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 19 predicate places. [2025-04-14 00:04:54,773 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 60 transitions, 231 flow [2025-04-14 00:04:54,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:04:54,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:04:54,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:04:54,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:04:54,773 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:04:54,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:04:54,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1598440, now seen corresponding path program 5 times [2025-04-14 00:04:54,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:04:54,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983456989] [2025-04-14 00:04:54,773 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:04:54,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:04:54,781 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:04:54,811 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:04:54,812 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:04:54,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:04:55,368 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:04:55,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:04:55,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983456989] [2025-04-14 00:04:55,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983456989] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:04:55,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:04:55,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:04:55,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486105575] [2025-04-14 00:04:55,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:04:55,369 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:04:55,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:04:55,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:04:55,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:04:55,371 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2025-04-14 00:04:55,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 60 transitions, 231 flow. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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:04:55,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:04:55,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2025-04-14 00:04:55,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:04:56,177 INFO L116 PetriNetUnfolderBase]: 8393/11971 cut-off events. [2025-04-14 00:04:56,177 INFO L117 PetriNetUnfolderBase]: For 6991/6991 co-relation queries the response was YES. [2025-04-14 00:04:56,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31281 conditions, 11971 events. 8393/11971 cut-off events. For 6991/6991 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 63676 event pairs, 2733 based on Foata normal form. 16/11978 useless extension candidates. Maximal degree in co-relation 31261. Up to 5150 conditions per place. [2025-04-14 00:04:56,208 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 58 selfloop transitions, 4 changer transitions 75/141 dead transitions. [2025-04-14 00:04:56,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 141 transitions, 781 flow [2025-04-14 00:04:56,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:04:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:04:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2025-04-14 00:04:56,210 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4429347826086957 [2025-04-14 00:04:56,210 INFO L175 Difference]: Start difference. First operand has 74 places, 60 transitions, 231 flow. Second operand 8 states and 163 transitions. [2025-04-14 00:04:56,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 141 transitions, 781 flow [2025-04-14 00:04:56,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 141 transitions, 763 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-04-14 00:04:56,215 INFO L231 Difference]: Finished difference. Result has 77 places, 56 transitions, 221 flow [2025-04-14 00:04:56,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=221, PETRI_PLACES=77, PETRI_TRANSITIONS=56} [2025-04-14 00:04:56,215 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 22 predicate places. [2025-04-14 00:04:56,215 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 56 transitions, 221 flow [2025-04-14 00:04:56,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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:04:56,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:04:56,216 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:04:56,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:04:56,216 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-14 00:04:56,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:04:56,216 INFO L85 PathProgramCache]: Analyzing trace with hash 314029014, now seen corresponding path program 6 times [2025-04-14 00:04:56,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:04:56,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994051593] [2025-04-14 00:04:56,216 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:04:56,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:04:56,226 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:04:56,262 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:04:56,262 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:04:56,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:04:56,262 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:04:56,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:04:56,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:04:56,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:04:56,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:04:56,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:04:56,329 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:04:56,329 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-14 00:04:56,330 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-14 00:04:56,330 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-14 00:04:56,330 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-14 00:04:56,331 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-14 00:04:56,331 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-14 00:04:56,331 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-14 00:04:56,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:04:56,331 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2025-04-14 00:04:56,421 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:04:56,421 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:04:56,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:04:56 BasicIcfg [2025-04-14 00:04:56,427 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:04:56,427 INFO L158 Benchmark]: Toolchain (without parser) took 25812.95ms. Allocated memory was 155.2MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 108.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-04-14 00:04:56,428 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:04:56,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.44ms. Allocated memory is still 155.2MB. Free memory was 108.5MB in the beginning and 82.3MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 00:04:56,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.48ms. Allocated memory is still 155.2MB. Free memory was 82.3MB in the beginning and 79.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:04:56,429 INFO L158 Benchmark]: Boogie Preprocessor took 59.05ms. Allocated memory is still 155.2MB. Free memory was 79.5MB in the beginning and 76.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:04:56,429 INFO L158 Benchmark]: IcfgBuilder took 637.55ms. Allocated memory is still 155.2MB. Free memory was 76.1MB in the beginning and 80.8MB in the end (delta: -4.8MB). Peak memory consumption was 57.9MB. Max. memory is 8.0GB. [2025-04-14 00:04:56,430 INFO L158 Benchmark]: TraceAbstraction took 24688.40ms. Allocated memory was 155.2MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 80.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-04-14 00:04:56,431 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.80ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 382.44ms. Allocated memory is still 155.2MB. Free memory was 108.5MB in the beginning and 82.3MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.48ms. Allocated memory is still 155.2MB. Free memory was 82.3MB in the beginning and 79.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.05ms. Allocated memory is still 155.2MB. Free memory was 79.5MB in the beginning and 76.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 637.55ms. Allocated memory is still 155.2MB. Free memory was 76.1MB in the beginning and 80.8MB in the end (delta: -4.8MB). Peak memory consumption was 57.9MB. Max. memory is 8.0GB. * TraceAbstraction took 24688.40ms. Allocated memory was 155.2MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 80.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L731] 0 _Bool y$flush_delayed; [L732] 0 int y$mem_tmp; [L733] 0 _Bool y$r_buff0_thd0; [L734] 0 _Bool y$r_buff0_thd1; [L735] 0 _Bool y$r_buff0_thd2; [L736] 0 _Bool y$r_buff0_thd3; [L737] 0 _Bool y$r_buff0_thd4; [L738] 0 _Bool y$r_buff1_thd0; [L739] 0 _Bool y$r_buff1_thd1; [L740] 0 _Bool y$r_buff1_thd2; [L741] 0 _Bool y$r_buff1_thd3; [L742] 0 _Bool y$r_buff1_thd4; [L743] 0 _Bool y$read_delayed; [L744] 0 int *y$read_delayed_var; [L745] 0 int y$w_buff0; [L746] 0 _Bool y$w_buff0_used; [L747] 0 int y$w_buff1; [L748] 0 _Bool y$w_buff1_used; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L863] 0 pthread_t t941; [L864] FCALL, FORK 0 pthread_create(&t941, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L865] 0 pthread_t t942; [L866] FCALL, FORK 0 pthread_create(&t942, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941=-1, t942=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L867] 0 pthread_t t943; [L868] FCALL, FORK 0 pthread_create(&t943, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941=-1, t942=0, t943=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L869] 0 pthread_t t944; [L870] FCALL, FORK 0 pthread_create(&t944, ((void *)0), P3, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941=-1, t942=0, t943=1, t944=2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L799] 3 y$w_buff1 = y$w_buff0 [L800] 3 y$w_buff0 = 1 [L801] 3 y$w_buff1_used = y$w_buff0_used [L802] 3 y$w_buff0_used = (_Bool)1 [L803] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L803] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L804] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L805] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L806] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L807] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L808] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L809] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L812] 3 __unbuffered_p2_EAX = z VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L829] 4 z = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L832] 4 a = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L835] 4 __unbuffered_p3_EAX = a VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L838] 4 __unbuffered_p3_EBX = b VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 b = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L759] 1 __unbuffered_p0_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L771] 2 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EAX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L841] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L843] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L844] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L845] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t941=-1, t942=0, t943=1, t944=2, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L878] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L879] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L880] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t941=-1, t942=0, t943=1, t944=2, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t941=-1, t942=0, t943=1, t944=2, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L885] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: 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: 864]: 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: 870]: 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: 868]: 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: 866]: 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 9 procedures, 82 locations, 77 edges, 7 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: 24.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 937 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 937 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2235 IncrementalHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 0 mSDtfsCounter, 2235 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=8, InterpolantAutomatonStates: 62, 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.6s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 1970 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:04:56,450 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...