/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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:10:08,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:10:08,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:10:08,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:10:08,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:10:08,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:10:08,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:10:08,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:10:08,811 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:10:08,811 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:10:08,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:10:08,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:10:08,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:10:08,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:10:08,812 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:10:08,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:10:08,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:10:08,812 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:10:08,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:10:08,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:10:08,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:10:08,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:10:08,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:10:08,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:10:08,812 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:10:08,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:10:08,813 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:10:08,813 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:10:08,813 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:10:08,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:08,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:08,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:08,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:08,813 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:10:08,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:08,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:08,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:08,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:08,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:10:08,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:10:08,814 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:10:08,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:10:08,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:10:08,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:10:08,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:10:08,814 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:10:08,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:10:08,814 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:10:09,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:10:09,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:10:09,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:10:09,086 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:10:09,088 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:10:09,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-14 00:10:10,537 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03027c380/c1b5d1e1825147009d5edf49c8cc7a25/FLAG68a266a0f [2025-04-14 00:10:10,853 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:10:10,854 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-14 00:10:10,869 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03027c380/c1b5d1e1825147009d5edf49c8cc7a25/FLAG68a266a0f [2025-04-14 00:10:11,535 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03027c380/c1b5d1e1825147009d5edf49c8cc7a25 [2025-04-14 00:10:11,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:10:11,539 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:10:11,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:10:11,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:10:11,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:10:11,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:10:11" (1/1) ... [2025-04-14 00:10:11,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ff1663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:11, skipping insertion in model container [2025-04-14 00:10:11,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:10:11" (1/1) ... [2025-04-14 00:10:11,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:10:11,749 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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2025-04-14 00:10:12,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:10:12,029 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:10:12,052 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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2025-04-14 00:10:12,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:10:12,158 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:10:12,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:12 WrapperNode [2025-04-14 00:10:12,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:10:12,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:10:12,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:10:12,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:10:12,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:12" (1/1) ... [2025-04-14 00:10:12,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:12" (1/1) ... [2025-04-14 00:10:12,213 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2025-04-14 00:10:12,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:10:12,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:10:12,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:10:12,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:10:12,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:12" (1/1) ... [2025-04-14 00:10:12,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:12" (1/1) ... [2025-04-14 00:10:12,224 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:12" (1/1) ... [2025-04-14 00:10:12,259 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 00:10:12,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:12" (1/1) ... [2025-04-14 00:10:12,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:12" (1/1) ... [2025-04-14 00:10:12,272 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:12" (1/1) ... [2025-04-14 00:10:12,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:12" (1/1) ... [2025-04-14 00:10:12,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:12" (1/1) ... [2025-04-14 00:10:12,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:12" (1/1) ... [2025-04-14 00:10:12,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:10:12,283 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:10:12,283 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:10:12,283 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:10:12,284 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:12" (1/1) ... [2025-04-14 00:10:12,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:12,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:10:12,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:10:12,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:10:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:10:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:10:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-14 00:10:12,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-14 00:10:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-14 00:10:12,341 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-14 00:10:12,341 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-14 00:10:12,341 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-14 00:10:12,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:10:12,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:10:12,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:10:12,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:10:12,342 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:10:12,461 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:10:12,462 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:10:12,860 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:10:12,861 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:10:12,861 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:10:13,195 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:10:13,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:10:13 BoogieIcfgContainer [2025-04-14 00:10:13,196 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:10:13,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:10:13,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:10:13,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:10:13,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:10:11" (1/3) ... [2025-04-14 00:10:13,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162f4502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:10:13, skipping insertion in model container [2025-04-14 00:10:13,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:12" (2/3) ... [2025-04-14 00:10:13,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162f4502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:10:13, skipping insertion in model container [2025-04-14 00:10:13,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:10:13" (3/3) ... [2025-04-14 00:10:13,205 INFO L128 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-14 00:10:13,216 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:10:13,217 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 37 locations, 33 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-14 00:10:13,217 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:10:13,303 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:10:13,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 36 transitions, 84 flow [2025-04-14 00:10:13,359 INFO L116 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-04-14 00:10:13,361 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:10:13,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-14 00:10:13,363 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 36 transitions, 84 flow [2025-04-14 00:10:13,367 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2025-04-14 00:10:13,373 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:10:13,382 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;@6c1b31fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:10:13,382 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-14 00:10:13,390 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:10:13,390 INFO L116 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-04-14 00:10:13,391 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:10:13,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:13,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 00:10:13,392 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:13,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:13,398 INFO L85 PathProgramCache]: Analyzing trace with hash 285997653, now seen corresponding path program 1 times [2025-04-14 00:10:13,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:13,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692072548] [2025-04-14 00:10:13,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:13,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:13,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 00:10:13,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 00:10:13,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:13,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:13,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:13,833 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692072548] [2025-04-14 00:10:13,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692072548] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:13,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:13,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:10:13,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800822458] [2025-04-14 00:10:13,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:13,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:10:13,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:13,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:10:13,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:10:13,890 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:10:13,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:13,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:13,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:10:13,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:15,355 INFO L116 PetriNetUnfolderBase]: 4991/7113 cut-off events. [2025-04-14 00:10:15,356 INFO L117 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-04-14 00:10:15,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14324 conditions, 7113 events. 4991/7113 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 37566 event pairs, 551 based on Foata normal form. 0/6853 useless extension candidates. Maximal degree in co-relation 14313. Up to 6191 conditions per place. [2025-04-14 00:10:15,399 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 45 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2025-04-14 00:10:15,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 214 flow [2025-04-14 00:10:15,401 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:10:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:10:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-04-14 00:10:15,412 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2025-04-14 00:10:15,414 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 68 transitions. [2025-04-14 00:10:15,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 214 flow [2025-04-14 00:10:15,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 210 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:10:15,422 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 72 flow [2025-04-14 00:10:15,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2025-04-14 00:10:15,428 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-04-14 00:10:15,428 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 72 flow [2025-04-14 00:10:15,428 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:15,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:15,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:15,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:10:15,428 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:15,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:15,429 INFO L85 PathProgramCache]: Analyzing trace with hash -652917353, now seen corresponding path program 1 times [2025-04-14 00:10:15,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:15,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887783708] [2025-04-14 00:10:15,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:15,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:15,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:10:15,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:10:15,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:15,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:15,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:15,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887783708] [2025-04-14 00:10:15,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887783708] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:15,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:15,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:10:15,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054570375] [2025-04-14 00:10:15,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:15,844 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:10:15,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:15,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:10:15,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:10:15,845 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:10:15,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:15,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:15,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:10:15,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:16,958 INFO L116 PetriNetUnfolderBase]: 3619/5345 cut-off events. [2025-04-14 00:10:16,959 INFO L117 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2025-04-14 00:10:16,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11033 conditions, 5345 events. 3619/5345 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 27790 event pairs, 661 based on Foata normal form. 252/5584 useless extension candidates. Maximal degree in co-relation 11023. Up to 2841 conditions per place. [2025-04-14 00:10:17,000 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 57 selfloop transitions, 5 changer transitions 1/66 dead transitions. [2025-04-14 00:10:17,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 66 transitions, 276 flow [2025-04-14 00:10:17,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:10:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:10:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-04-14 00:10:17,003 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6180555555555556 [2025-04-14 00:10:17,003 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 72 flow. Second operand 4 states and 89 transitions. [2025-04-14 00:10:17,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 66 transitions, 276 flow [2025-04-14 00:10:17,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 66 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:10:17,007 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 102 flow [2025-04-14 00:10:17,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2025-04-14 00:10:17,008 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2025-04-14 00:10:17,008 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 102 flow [2025-04-14 00:10:17,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:17,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:17,009 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:17,009 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:10:17,009 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:17,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:17,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1889799984, now seen corresponding path program 1 times [2025-04-14 00:10:17,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:17,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504755139] [2025-04-14 00:10:17,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:17,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:17,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:10:17,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:10:17,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:17,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:17,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:17,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:17,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504755139] [2025-04-14 00:10:17,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504755139] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:17,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:17,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:10:17,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474155687] [2025-04-14 00:10:17,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:17,674 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:10:17,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:17,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:10:17,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:10:17,675 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:10:17,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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:10:17,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:17,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:10:17,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:18,513 INFO L116 PetriNetUnfolderBase]: 2091/3177 cut-off events. [2025-04-14 00:10:18,514 INFO L117 PetriNetUnfolderBase]: For 646/646 co-relation queries the response was YES. [2025-04-14 00:10:18,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7437 conditions, 3177 events. 2091/3177 cut-off events. For 646/646 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 15203 event pairs, 427 based on Foata normal form. 172/3336 useless extension candidates. Maximal degree in co-relation 7425. Up to 1128 conditions per place. [2025-04-14 00:10:18,537 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 73 selfloop transitions, 8 changer transitions 1/85 dead transitions. [2025-04-14 00:10:18,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 85 transitions, 389 flow [2025-04-14 00:10:18,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:10:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:10:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-04-14 00:10:18,542 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-04-14 00:10:18,542 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 102 flow. Second operand 5 states and 114 transitions. [2025-04-14 00:10:18,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 85 transitions, 389 flow [2025-04-14 00:10:18,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 85 transitions, 379 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:10:18,548 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 142 flow [2025-04-14 00:10:18,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-04-14 00:10:18,550 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2025-04-14 00:10:18,551 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 142 flow [2025-04-14 00:10:18,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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:10:18,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:18,551 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] [2025-04-14 00:10:18,552 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:10:18,552 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:18,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:18,553 INFO L85 PathProgramCache]: Analyzing trace with hash -799501326, now seen corresponding path program 1 times [2025-04-14 00:10:18,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:18,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309114085] [2025-04-14 00:10:18,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:18,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:18,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:10:18,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:10:18,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:18,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:19,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:19,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309114085] [2025-04-14 00:10:19,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309114085] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:19,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:19,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:10:19,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131645228] [2025-04-14 00:10:19,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:19,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:10:19,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:19,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:10:19,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:10:19,102 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:10:19,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:19,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:19,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:10:19,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:19,791 INFO L116 PetriNetUnfolderBase]: 1343/2057 cut-off events. [2025-04-14 00:10:19,791 INFO L117 PetriNetUnfolderBase]: For 1232/1232 co-relation queries the response was YES. [2025-04-14 00:10:19,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5159 conditions, 2057 events. 1343/2057 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9197 event pairs, 385 based on Foata normal form. 60/2104 useless extension candidates. Maximal degree in co-relation 5145. Up to 788 conditions per place. [2025-04-14 00:10:19,805 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 61 selfloop transitions, 11 changer transitions 1/76 dead transitions. [2025-04-14 00:10:19,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 376 flow [2025-04-14 00:10:19,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:10:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:10:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2025-04-14 00:10:19,808 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2025-04-14 00:10:19,808 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 142 flow. Second operand 6 states and 111 transitions. [2025-04-14 00:10:19,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 376 flow [2025-04-14 00:10:19,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 76 transitions, 351 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-14 00:10:19,822 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 156 flow [2025-04-14 00:10:19,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2025-04-14 00:10:19,824 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2025-04-14 00:10:19,824 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 156 flow [2025-04-14 00:10:19,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:19,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:19,824 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] [2025-04-14 00:10:19,824 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:10:19,824 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:19,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:19,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1444379333, now seen corresponding path program 1 times [2025-04-14 00:10:19,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:19,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8221336] [2025-04-14 00:10:19,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:19,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:19,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:10:20,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:10:20,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:20,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:24,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:24,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8221336] [2025-04-14 00:10:24,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8221336] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:24,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:24,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:10:24,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543328220] [2025-04-14 00:10:24,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:24,292 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:10:24,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:24,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:10:24,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:10:24,293 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:10:24,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 156 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:24,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:24,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:10:24,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:26,106 INFO L116 PetriNetUnfolderBase]: 2008/3059 cut-off events. [2025-04-14 00:10:26,106 INFO L117 PetriNetUnfolderBase]: For 2146/2146 co-relation queries the response was YES. [2025-04-14 00:10:26,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7763 conditions, 3059 events. 2008/3059 cut-off events. For 2146/2146 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14491 event pairs, 164 based on Foata normal form. 8/3061 useless extension candidates. Maximal degree in co-relation 7748. Up to 1320 conditions per place. [2025-04-14 00:10:26,142 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 71 selfloop transitions, 8 changer transitions 42/124 dead transitions. [2025-04-14 00:10:26,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 124 transitions, 732 flow [2025-04-14 00:10:26,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:10:26,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:10:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2025-04-14 00:10:26,153 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-04-14 00:10:26,153 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 156 flow. Second operand 8 states and 152 transitions. [2025-04-14 00:10:26,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 124 transitions, 732 flow [2025-04-14 00:10:26,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 124 transitions, 571 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-04-14 00:10:26,188 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 150 flow [2025-04-14 00:10:26,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=150, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2025-04-14 00:10:26,189 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2025-04-14 00:10:26,189 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 150 flow [2025-04-14 00:10:26,189 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:26,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:26,189 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] [2025-04-14 00:10:26,189 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:10:26,189 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:26,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:26,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1507883389, now seen corresponding path program 2 times [2025-04-14 00:10:26,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:26,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48523454] [2025-04-14 00:10:26,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:10:26,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:26,232 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:10:26,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:10:26,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:10:26,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:27,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:27,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48523454] [2025-04-14 00:10:27,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48523454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:27,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:27,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:10:27,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550815271] [2025-04-14 00:10:27,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:27,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:10:27,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:27,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:10:27,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:10:27,240 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:10:27,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 150 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:27,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:27,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:10:27,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:28,419 INFO L116 PetriNetUnfolderBase]: 2232/3494 cut-off events. [2025-04-14 00:10:28,419 INFO L117 PetriNetUnfolderBase]: For 1254/1257 co-relation queries the response was YES. [2025-04-14 00:10:28,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8897 conditions, 3494 events. 2232/3494 cut-off events. For 1254/1257 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 17765 event pairs, 384 based on Foata normal form. 8/3493 useless extension candidates. Maximal degree in co-relation 8881. Up to 1427 conditions per place. [2025-04-14 00:10:28,475 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 68 selfloop transitions, 12 changer transitions 46/129 dead transitions. [2025-04-14 00:10:28,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 129 transitions, 694 flow [2025-04-14 00:10:28,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:10:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:10:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2025-04-14 00:10:28,480 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2025-04-14 00:10:28,480 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 150 flow. Second operand 8 states and 145 transitions. [2025-04-14 00:10:28,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 129 transitions, 694 flow [2025-04-14 00:10:28,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 129 transitions, 652 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-04-14 00:10:28,490 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 213 flow [2025-04-14 00:10:28,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2025-04-14 00:10:28,496 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2025-04-14 00:10:28,496 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 213 flow [2025-04-14 00:10:28,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:28,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:28,497 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] [2025-04-14 00:10:28,497 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:10:28,497 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:28,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:28,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1028551633, now seen corresponding path program 3 times [2025-04-14 00:10:28,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:28,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331728958] [2025-04-14 00:10:28,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:10:28,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:28,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:10:28,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:10:28,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:10:28,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:31,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:31,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331728958] [2025-04-14 00:10:31,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331728958] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:31,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:31,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:10:31,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944043896] [2025-04-14 00:10:31,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:31,799 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:10:31,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:31,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:10:31,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:10:31,799 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:10:31,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 213 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:31,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:31,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:10:31,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:33,029 INFO L116 PetriNetUnfolderBase]: 1974/3092 cut-off events. [2025-04-14 00:10:33,029 INFO L117 PetriNetUnfolderBase]: For 1716/1716 co-relation queries the response was YES. [2025-04-14 00:10:33,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8690 conditions, 3092 events. 1974/3092 cut-off events. For 1716/1716 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14898 event pairs, 528 based on Foata normal form. 8/3099 useless extension candidates. Maximal degree in co-relation 8671. Up to 1763 conditions per place. [2025-04-14 00:10:33,039 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 55 selfloop transitions, 9 changer transitions 46/113 dead transitions. [2025-04-14 00:10:33,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 113 transitions, 663 flow [2025-04-14 00:10:33,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:10:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:10:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2025-04-14 00:10:33,041 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4618055555555556 [2025-04-14 00:10:33,041 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 213 flow. Second operand 8 states and 133 transitions. [2025-04-14 00:10:33,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 113 transitions, 663 flow [2025-04-14 00:10:33,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 113 transitions, 648 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-14 00:10:33,047 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 255 flow [2025-04-14 00:10:33,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=255, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2025-04-14 00:10:33,048 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2025-04-14 00:10:33,048 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 255 flow [2025-04-14 00:10:33,048 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:33,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:33,048 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] [2025-04-14 00:10:33,048 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:10:33,048 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:33,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:33,049 INFO L85 PathProgramCache]: Analyzing trace with hash 536008197, now seen corresponding path program 4 times [2025-04-14 00:10:33,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:33,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553748157] [2025-04-14 00:10:33,049 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:10:33,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:33,062 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:10:33,129 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:10:33,129 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:10:33,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:36,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:36,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:36,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553748157] [2025-04-14 00:10:36,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553748157] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:36,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:36,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 00:10:36,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663211341] [2025-04-14 00:10:36,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:36,052 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 00:10:36,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:36,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 00:10:36,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-14 00:10:36,052 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:10:36,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 255 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:36,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:36,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:10:36,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:36,860 INFO L116 PetriNetUnfolderBase]: 1717/2709 cut-off events. [2025-04-14 00:10:36,861 INFO L117 PetriNetUnfolderBase]: For 2068/2071 co-relation queries the response was YES. [2025-04-14 00:10:36,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7816 conditions, 2709 events. 1717/2709 cut-off events. For 2068/2071 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12827 event pairs, 249 based on Foata normal form. 10/2717 useless extension candidates. Maximal degree in co-relation 7795. Up to 825 conditions per place. [2025-04-14 00:10:36,872 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 56 selfloop transitions, 6 changer transitions 62/127 dead transitions. [2025-04-14 00:10:36,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 127 transitions, 781 flow [2025-04-14 00:10:36,873 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 00:10:36,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 00:10:36,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2025-04-14 00:10:36,873 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45987654320987653 [2025-04-14 00:10:36,874 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 255 flow. Second operand 9 states and 149 transitions. [2025-04-14 00:10:36,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 127 transitions, 781 flow [2025-04-14 00:10:36,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 127 transitions, 755 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-04-14 00:10:36,878 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 249 flow [2025-04-14 00:10:36,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=249, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2025-04-14 00:10:36,879 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2025-04-14 00:10:36,879 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 249 flow [2025-04-14 00:10:36,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:36,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:36,879 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] [2025-04-14 00:10:36,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:10:36,879 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:36,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:36,880 INFO L85 PathProgramCache]: Analyzing trace with hash -242809091, now seen corresponding path program 5 times [2025-04-14 00:10:36,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:36,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578965483] [2025-04-14 00:10:36,880 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:10:36,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:36,889 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:10:36,984 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:10:36,984 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:10:36,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:38,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:38,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578965483] [2025-04-14 00:10:38,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578965483] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:38,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:38,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:10:38,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901515086] [2025-04-14 00:10:38,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:38,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:10:38,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:38,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:10:38,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:10:38,144 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:10:38,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 249 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:38,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:38,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:10:38,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:38,598 INFO L116 PetriNetUnfolderBase]: 1168/1890 cut-off events. [2025-04-14 00:10:38,598 INFO L117 PetriNetUnfolderBase]: For 1984/1984 co-relation queries the response was YES. [2025-04-14 00:10:38,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5593 conditions, 1890 events. 1168/1890 cut-off events. For 1984/1984 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 8243 event pairs, 398 based on Foata normal form. 8/1897 useless extension candidates. Maximal degree in co-relation 5569. Up to 980 conditions per place. [2025-04-14 00:10:38,606 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 39 selfloop transitions, 2 changer transitions 61/105 dead transitions. [2025-04-14 00:10:38,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 105 transitions, 649 flow [2025-04-14 00:10:38,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:10:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:10:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2025-04-14 00:10:38,608 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2025-04-14 00:10:38,608 INFO L175 Difference]: Start difference. First operand has 70 places, 49 transitions, 249 flow. Second operand 8 states and 129 transitions. [2025-04-14 00:10:38,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 105 transitions, 649 flow [2025-04-14 00:10:38,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 105 transitions, 607 flow, removed 11 selfloop flow, removed 9 redundant places. [2025-04-14 00:10:38,614 INFO L231 Difference]: Finished difference. Result has 68 places, 41 transitions, 177 flow [2025-04-14 00:10:38,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=177, PETRI_PLACES=68, PETRI_TRANSITIONS=41} [2025-04-14 00:10:38,616 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2025-04-14 00:10:38,616 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 41 transitions, 177 flow [2025-04-14 00:10:38,616 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:38,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:38,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] [2025-04-14 00:10:38,616 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:10:38,616 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:38,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1089802919, now seen corresponding path program 6 times [2025-04-14 00:10:38,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:38,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552077426] [2025-04-14 00:10:38,617 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:10:38,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:38,629 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:10:38,719 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:10:38,719 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:10:38,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:10:40,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:40,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552077426] [2025-04-14 00:10:40,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552077426] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:40,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:40,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:10:40,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207749319] [2025-04-14 00:10:40,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:40,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:10:40,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:40,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:10:40,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:10:40,117 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-04-14 00:10:40,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 41 transitions, 177 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:40,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:40,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-04-14 00:10:40,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:40,539 INFO L116 PetriNetUnfolderBase]: 1021/1613 cut-off events. [2025-04-14 00:10:40,540 INFO L117 PetriNetUnfolderBase]: For 1354/1354 co-relation queries the response was YES. [2025-04-14 00:10:40,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4664 conditions, 1613 events. 1021/1613 cut-off events. For 1354/1354 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6667 event pairs, 278 based on Foata normal form. 8/1620 useless extension candidates. Maximal degree in co-relation 4641. Up to 884 conditions per place. [2025-04-14 00:10:40,548 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 46 selfloop transitions, 4 changer transitions 32/85 dead transitions. [2025-04-14 00:10:40,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 85 transitions, 513 flow [2025-04-14 00:10:40,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:10:40,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:10:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2025-04-14 00:10:40,552 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-04-14 00:10:40,552 INFO L175 Difference]: Start difference. First operand has 68 places, 41 transitions, 177 flow. Second operand 7 states and 105 transitions. [2025-04-14 00:10:40,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 85 transitions, 513 flow [2025-04-14 00:10:40,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 85 transitions, 485 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-04-14 00:10:40,558 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 175 flow [2025-04-14 00:10:40,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=175, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2025-04-14 00:10:40,560 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2025-04-14 00:10:40,560 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 175 flow [2025-04-14 00:10:40,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:40,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:40,560 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] [2025-04-14 00:10:40,560 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:10:40,560 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:40,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:40,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1829368275, now seen corresponding path program 7 times [2025-04-14 00:10:40,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:40,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925667926] [2025-04-14 00:10:40,562 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:10:40,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:40,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:10:40,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:10:40,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:40,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:10:40,660 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:10:40,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:10:40,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:10:40,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:40,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:10:40,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:10:40,806 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:10:40,806 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-14 00:10:40,808 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-14 00:10:40,808 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-14 00:10:40,808 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-14 00:10:40,808 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-14 00:10:40,808 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-14 00:10:40,808 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:10:40,808 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1] [2025-04-14 00:10:40,888 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:10:40,888 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:10:40,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:10:40 BasicIcfg [2025-04-14 00:10:40,892 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:10:40,893 INFO L158 Benchmark]: Toolchain (without parser) took 29354.05ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 99.3MB in the beginning and 238.1MB in the end (delta: -138.7MB). Peak memory consumption was 447.5MB. Max. memory is 8.0GB. [2025-04-14 00:10:40,893 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 167.8MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:10:40,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 619.92ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 70.0MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-14 00:10:40,893 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.47ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 67.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:10:40,894 INFO L158 Benchmark]: Boogie Preprocessor took 68.94ms. Allocated memory is still 142.6MB. Free memory was 67.1MB in the beginning and 62.7MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:10:40,894 INFO L158 Benchmark]: IcfgBuilder took 912.64ms. Allocated memory is still 142.6MB. Free memory was 62.4MB in the beginning and 33.5MB in the end (delta: 28.9MB). Peak memory consumption was 45.3MB. Max. memory is 8.0GB. [2025-04-14 00:10:40,894 INFO L158 Benchmark]: TraceAbstraction took 27695.10ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 32.8MB in the beginning and 238.1MB in the end (delta: -205.3MB). Peak memory consumption was 381.3MB. Max. memory is 8.0GB. [2025-04-14 00:10:40,895 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.28ms. Allocated memory is still 167.8MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 619.92ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 70.0MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.47ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 67.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 68.94ms. Allocated memory is still 142.6MB. Free memory was 67.1MB in the beginning and 62.7MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 912.64ms. Allocated memory is still 142.6MB. Free memory was 62.4MB in the beginning and 33.5MB in the end (delta: 28.9MB). Peak memory consumption was 45.3MB. Max. memory is 8.0GB. * TraceAbstraction took 27695.10ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 32.8MB in the beginning and 238.1MB in the end (delta: -205.3MB). Peak memory consumption was 381.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=-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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=-1, t2322=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321=-1, t2322=0, t2323=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)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_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L796] 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_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L813] 3 __unbuffered_p2_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L832] 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) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 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}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L744] 1 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=-1, t2322=0, t2323=1, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 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) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 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 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=-1, t2322=0, t2323=1, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321=-1, t2322=0, t2323=1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, 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=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 855]: 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: 859]: 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 7 procedures, 63 locations, 59 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 673 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 673 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2369 IncrementalHoareTripleChecker+Invalid, 2496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 0 mSDtfsCounter, 2369 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255occurred in iteration=7, InterpolantAutomatonStates: 66, 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, 1.5s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 215 ConstructedInterpolants, 0 QuantifiedInterpolants, 2160 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:10:40,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...