/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:30:59,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:30:59,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:30:59,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:30:59,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:30:59,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:30:59,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:30:59,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:30:59,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:30:59,910 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:30:59,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:30:59,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:30:59,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:30:59,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:30:59,912 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:30:59,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:30:59,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:30:59,913 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:30:59,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:30:59,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:30:59,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:30:59,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:30:59,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:30:59,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:30:59,913 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:30:59,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:30:59,913 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:30:59,913 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:30:59,913 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:30:59,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:30:59,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:30:59,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:30:59,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:30:59,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:30:59,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:30:59,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:30:59,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:30:59,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:30:59,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:30:59,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:30:59,914 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:30:59,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:30:59,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:30:59,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:30:59,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:30:59,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:30:59,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:30:59,915 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 [2025-04-13 19:31:00,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:31:00,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:31:00,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:31:00,159 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:31:00,159 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:31:00,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i [2025-04-13 19:31:01,479 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c4668885/b531743f087148a889f7948efc864cfe/FLAGebf929447 [2025-04-13 19:31:01,696 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:31:01,696 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_pso.opt_rmo.opt.i [2025-04-13 19:31:01,708 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c4668885/b531743f087148a889f7948efc864cfe/FLAGebf929447 [2025-04-13 19:31:02,681 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c4668885/b531743f087148a889f7948efc864cfe [2025-04-13 19:31:02,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:31:02,684 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:31:02,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:31:02,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:31:02,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:31:02,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:31:02" (1/1) ... [2025-04-13 19:31:02,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a42801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:31:02, skipping insertion in model container [2025-04-13 19:31:02,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:31:02" (1/1) ... [2025-04-13 19:31:02,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:31:02,866 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/mix026_pso.opt_rmo.opt.i[956,969] [2025-04-13 19:31:02,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:31:03,006 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:31:03,023 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/mix026_pso.opt_rmo.opt.i[956,969] [2025-04-13 19:31:03,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:31:03,111 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:31:03,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:31:03 WrapperNode [2025-04-13 19:31:03,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:31:03,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:31:03,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:31:03,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:31:03,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:31:03" (1/1) ... [2025-04-13 19:31:03,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:31:03" (1/1) ... [2025-04-13 19:31:03,147 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2025-04-13 19:31:03,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:31:03,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:31:03,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:31:03,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:31:03,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:31:03" (1/1) ... [2025-04-13 19:31:03,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:31:03" (1/1) ... [2025-04-13 19:31:03,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:31:03" (1/1) ... [2025-04-13 19:31:03,171 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 19:31:03,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:31:03" (1/1) ... [2025-04-13 19:31:03,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:31:03" (1/1) ... [2025-04-13 19:31:03,177 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:31:03" (1/1) ... [2025-04-13 19:31:03,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:31:03" (1/1) ... [2025-04-13 19:31:03,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:31:03" (1/1) ... [2025-04-13 19:31:03,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:31:03" (1/1) ... [2025-04-13 19:31:03,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:31:03" (1/1) ... [2025-04-13 19:31:03,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:31:03,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:31:03,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:31:03,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:31:03,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:31:03" (1/1) ... [2025-04-13 19:31:03,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:31:03,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:31:03,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:31:03,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:31:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:31:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:31:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 19:31:03,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 19:31:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 19:31:03,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 19:31:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 19:31:03,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 19:31:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-04-13 19:31:03,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-04-13 19:31:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:31:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:31:03,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:31:03,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:31:03,240 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:31:03,352 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:31:03,353 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:31:03,588 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:31:03,589 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:31:03,589 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:31:03,813 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:31:03,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:31:03 BoogieIcfgContainer [2025-04-13 19:31:03,814 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:31:03,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:31:03,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:31:03,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:31:03,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:31:02" (1/3) ... [2025-04-13 19:31:03,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b74d7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:31:03, skipping insertion in model container [2025-04-13 19:31:03,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:31:03" (2/3) ... [2025-04-13 19:31:03,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b74d7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:31:03, skipping insertion in model container [2025-04-13 19:31:03,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:31:03" (3/3) ... [2025-04-13 19:31:03,823 INFO L128 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt_rmo.opt.i [2025-04-13 19:31:03,834 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:31:03,836 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix026_pso.opt_rmo.opt.i that has 5 procedures, 46 locations, 41 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-13 19:31:03,837 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:31:03,885 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:31:03,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 45 transitions, 106 flow [2025-04-13 19:31:03,938 INFO L116 PetriNetUnfolderBase]: 0/41 cut-off events. [2025-04-13 19:31:03,939 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:31:03,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 89 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-13 19:31:03,940 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 45 transitions, 106 flow [2025-04-13 19:31:03,944 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 41 transitions, 94 flow [2025-04-13 19:31:03,950 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:31:03,962 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;@7df6d70f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:31:03,962 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:31:03,969 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:31:03,969 INFO L116 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-04-13 19:31:03,969 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:31:03,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:31:03,970 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:31:03,970 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:31:03,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:31:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2123008226, now seen corresponding path program 1 times [2025-04-13 19:31:03,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:31:03,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498654796] [2025-04-13 19:31:03,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:31:03,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:31:04,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:31:04,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:31:04,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:31:04,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:31:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:31:04,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:31:04,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498654796] [2025-04-13 19:31:04,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498654796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:31:04,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:31:04,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:31:04,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098075123] [2025-04-13 19:31:04,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:31:04,390 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:31:04,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:31:04,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:31:04,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:31:04,408 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 45 [2025-04-13 19:31:04,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:04,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:31:04,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 45 [2025-04-13 19:31:04,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:31:04,834 INFO L116 PetriNetUnfolderBase]: 1153/1939 cut-off events. [2025-04-13 19:31:04,834 INFO L117 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-04-13 19:31:04,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3661 conditions, 1939 events. 1153/1939 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 12885 event pairs, 355 based on Foata normal form. 0/1819 useless extension candidates. Maximal degree in co-relation 3649. Up to 1303 conditions per place. [2025-04-13 19:31:04,856 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 29 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2025-04-13 19:31:04,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 185 flow [2025-04-13 19:31:04,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:31:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:31:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-04-13 19:31:04,867 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.762962962962963 [2025-04-13 19:31:04,868 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 94 flow. Second operand 3 states and 103 transitions. [2025-04-13 19:31:04,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 185 flow [2025-04-13 19:31:04,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 180 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 19:31:04,873 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 90 flow [2025-04-13 19:31:04,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-04-13 19:31:04,878 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-04-13 19:31:04,878 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 90 flow [2025-04-13 19:31:04,878 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:04,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:31:04,878 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:31:04,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:31:04,879 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:31:04,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:31:04,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1758676116, now seen corresponding path program 1 times [2025-04-13 19:31:04,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:31:04,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677164811] [2025-04-13 19:31:04,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:31:04,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:31:04,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:31:04,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:31:04,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:31:04,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:31:05,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:31:05,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:31:05,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677164811] [2025-04-13 19:31:05,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677164811] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:31:05,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:31:05,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:31:05,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488441202] [2025-04-13 19:31:05,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:31:05,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:31:05,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:31:05,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:31:05,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:31:05,125 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2025-04-13 19:31:05,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:05,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:31:05,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2025-04-13 19:31:05,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:31:05,552 INFO L116 PetriNetUnfolderBase]: 1593/2625 cut-off events. [2025-04-13 19:31:05,553 INFO L117 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-04-13 19:31:05,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5145 conditions, 2625 events. 1593/2625 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 18616 event pairs, 365 based on Foata normal form. 96/2667 useless extension candidates. Maximal degree in co-relation 5135. Up to 1573 conditions per place. [2025-04-13 19:31:05,570 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 29 selfloop transitions, 2 changer transitions 16/64 dead transitions. [2025-04-13 19:31:05,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 64 transitions, 240 flow [2025-04-13 19:31:05,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:31:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:31:05,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-04-13 19:31:05,574 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6844444444444444 [2025-04-13 19:31:05,574 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 5 states and 154 transitions. [2025-04-13 19:31:05,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 64 transitions, 240 flow [2025-04-13 19:31:05,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 64 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:31:05,579 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 98 flow [2025-04-13 19:31:05,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2025-04-13 19:31:05,579 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2025-04-13 19:31:05,579 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 98 flow [2025-04-13 19:31:05,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:05,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:31:05,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:31:05,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:31:05,580 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:31:05,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:31:05,581 INFO L85 PathProgramCache]: Analyzing trace with hash 978262658, now seen corresponding path program 1 times [2025-04-13 19:31:05,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:31:05,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732240110] [2025-04-13 19:31:05,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:31:05,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:31:05,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:31:05,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:31:05,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:31:05,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:31:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:31:05,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:31:05,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732240110] [2025-04-13 19:31:05,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732240110] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:31:05,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:31:05,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:31:05,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676429901] [2025-04-13 19:31:05,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:31:05,771 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:31:05,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:31:05,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:31:05,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:31:05,776 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-04-13 19:31:05,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:05,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:31:05,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-04-13 19:31:05,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:31:06,402 INFO L116 PetriNetUnfolderBase]: 4629/6675 cut-off events. [2025-04-13 19:31:06,402 INFO L117 PetriNetUnfolderBase]: For 684/684 co-relation queries the response was YES. [2025-04-13 19:31:06,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13942 conditions, 6675 events. 4629/6675 cut-off events. For 684/684 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 42398 event pairs, 663 based on Foata normal form. 240/6867 useless extension candidates. Maximal degree in co-relation 13929. Up to 3569 conditions per place. [2025-04-13 19:31:06,433 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 46 selfloop transitions, 6 changer transitions 1/67 dead transitions. [2025-04-13 19:31:06,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 266 flow [2025-04-13 19:31:06,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:31:06,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:31:06,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2025-04-13 19:31:06,434 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7055555555555556 [2025-04-13 19:31:06,434 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 98 flow. Second operand 4 states and 127 transitions. [2025-04-13 19:31:06,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 266 flow [2025-04-13 19:31:06,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 258 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 19:31:06,472 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 132 flow [2025-04-13 19:31:06,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2025-04-13 19:31:06,473 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2025-04-13 19:31:06,473 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 132 flow [2025-04-13 19:31:06,474 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:06,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:31:06,474 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] [2025-04-13 19:31:06,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:31:06,474 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:31:06,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:31:06,475 INFO L85 PathProgramCache]: Analyzing trace with hash -2146219829, now seen corresponding path program 1 times [2025-04-13 19:31:06,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:31:06,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629043868] [2025-04-13 19:31:06,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:31:06,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:31:06,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:31:06,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:31:06,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:31:06,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:31:06,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:31:06,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:31:06,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629043868] [2025-04-13 19:31:06,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629043868] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:31:06,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:31:06,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:31:06,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435967294] [2025-04-13 19:31:06,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:31:06,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:31:06,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:31:06,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:31:06,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:31:06,635 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-04-13 19:31:06,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:06,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:31:06,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-04-13 19:31:06,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:31:07,106 INFO L116 PetriNetUnfolderBase]: 3853/5607 cut-off events. [2025-04-13 19:31:07,107 INFO L117 PetriNetUnfolderBase]: For 1604/1604 co-relation queries the response was YES. [2025-04-13 19:31:07,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13568 conditions, 5607 events. 3853/5607 cut-off events. For 1604/1604 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 34318 event pairs, 249 based on Foata normal form. 228/5795 useless extension candidates. Maximal degree in co-relation 13555. Up to 2561 conditions per place. [2025-04-13 19:31:07,133 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 59 selfloop transitions, 10 changer transitions 1/84 dead transitions. [2025-04-13 19:31:07,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 383 flow [2025-04-13 19:31:07,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:31:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:31:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-04-13 19:31:07,135 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.72 [2025-04-13 19:31:07,136 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 132 flow. Second operand 5 states and 162 transitions. [2025-04-13 19:31:07,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 383 flow [2025-04-13 19:31:07,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 84 transitions, 372 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 19:31:07,140 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 184 flow [2025-04-13 19:31:07,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2025-04-13 19:31:07,142 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2025-04-13 19:31:07,142 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 184 flow [2025-04-13 19:31:07,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:07,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:31:07,143 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] [2025-04-13 19:31:07,143 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:31:07,143 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:31:07,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:31:07,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1006429787, now seen corresponding path program 1 times [2025-04-13 19:31:07,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:31:07,143 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687684974] [2025-04-13 19:31:07,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:31:07,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:31:07,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 19:31:07,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:31:07,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:31:07,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:31:07,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:31:07,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:31:07,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687684974] [2025-04-13 19:31:07,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687684974] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:31:07,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:31:07,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:31:07,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314907160] [2025-04-13 19:31:07,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:31:07,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:31:07,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:31:07,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:31:07,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:31:07,308 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-04-13 19:31:07,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:07,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:31:07,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-04-13 19:31:07,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:31:07,784 INFO L116 PetriNetUnfolderBase]: 2645/3883 cut-off events. [2025-04-13 19:31:07,784 INFO L117 PetriNetUnfolderBase]: For 3362/3362 co-relation queries the response was YES. [2025-04-13 19:31:07,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10532 conditions, 3883 events. 2645/3883 cut-off events. For 3362/3362 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 21749 event pairs, 115 based on Foata normal form. 172/4020 useless extension candidates. Maximal degree in co-relation 10517. Up to 1100 conditions per place. [2025-04-13 19:31:07,807 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 70 selfloop transitions, 14 changer transitions 1/99 dead transitions. [2025-04-13 19:31:07,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 99 transitions, 506 flow [2025-04-13 19:31:07,810 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:31:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:31:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2025-04-13 19:31:07,814 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2025-04-13 19:31:07,816 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 184 flow. Second operand 6 states and 195 transitions. [2025-04-13 19:31:07,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 99 transitions, 506 flow [2025-04-13 19:31:07,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 99 transitions, 476 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-13 19:31:07,824 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 234 flow [2025-04-13 19:31:07,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2025-04-13 19:31:07,825 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2025-04-13 19:31:07,825 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 234 flow [2025-04-13 19:31:07,825 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:07,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:31:07,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:31:07,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:31:07,825 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:31:07,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:31:07,826 INFO L85 PathProgramCache]: Analyzing trace with hash 347568117, now seen corresponding path program 1 times [2025-04-13 19:31:07,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:31:07,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850370834] [2025-04-13 19:31:07,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:31:07,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:31:07,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 19:31:07,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 19:31:07,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:31:07,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:31:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:31:08,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:31:08,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850370834] [2025-04-13 19:31:08,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850370834] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:31:08,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:31:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:31:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886442597] [2025-04-13 19:31:08,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:31:08,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:31:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:31:08,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:31:08,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:31:08,138 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2025-04-13 19:31:08,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:08,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:31:08,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2025-04-13 19:31:08,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:31:09,150 INFO L116 PetriNetUnfolderBase]: 8902/14032 cut-off events. [2025-04-13 19:31:09,150 INFO L117 PetriNetUnfolderBase]: For 8308/9291 co-relation queries the response was YES. [2025-04-13 19:31:09,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34107 conditions, 14032 events. 8902/14032 cut-off events. For 8308/9291 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 97308 event pairs, 1590 based on Foata normal form. 463/13898 useless extension candidates. Maximal degree in co-relation 34091. Up to 4479 conditions per place. [2025-04-13 19:31:09,209 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 92 selfloop transitions, 15 changer transitions 33/164 dead transitions. [2025-04-13 19:31:09,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 164 transitions, 802 flow [2025-04-13 19:31:09,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 19:31:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 19:31:09,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 304 transitions. [2025-04-13 19:31:09,211 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6755555555555556 [2025-04-13 19:31:09,211 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 234 flow. Second operand 10 states and 304 transitions. [2025-04-13 19:31:09,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 164 transitions, 802 flow [2025-04-13 19:31:09,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 164 transitions, 751 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-04-13 19:31:09,261 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 317 flow [2025-04-13 19:31:09,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=317, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2025-04-13 19:31:09,261 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2025-04-13 19:31:09,262 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 317 flow [2025-04-13 19:31:09,262 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:09,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:31:09,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:31:09,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:31:09,262 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:31:09,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:31:09,262 INFO L85 PathProgramCache]: Analyzing trace with hash 523919187, now seen corresponding path program 2 times [2025-04-13 19:31:09,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:31:09,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087597381] [2025-04-13 19:31:09,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:31:09,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:31:09,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-04-13 19:31:09,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 19:31:09,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:31:09,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:31:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:31:09,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:31:09,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087597381] [2025-04-13 19:31:09,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087597381] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:31:09,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:31:09,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:31:09,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488422889] [2025-04-13 19:31:09,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:31:09,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:31:09,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:31:09,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:31:09,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:31:09,501 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2025-04-13 19:31:09,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 317 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:09,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:31:09,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2025-04-13 19:31:09,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:31:11,250 INFO L116 PetriNetUnfolderBase]: 14439/22853 cut-off events. [2025-04-13 19:31:11,250 INFO L117 PetriNetUnfolderBase]: For 20180/21238 co-relation queries the response was YES. [2025-04-13 19:31:11,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61878 conditions, 22853 events. 14439/22853 cut-off events. For 20180/21238 co-relation queries the response was YES. Maximal size of possible extension queue 1073. Compared 172924 event pairs, 3098 based on Foata normal form. 746/22441 useless extension candidates. Maximal degree in co-relation 61854. Up to 8021 conditions per place. [2025-04-13 19:31:11,353 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 90 selfloop transitions, 24 changer transitions 23/162 dead transitions. [2025-04-13 19:31:11,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 162 transitions, 997 flow [2025-04-13 19:31:11,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:31:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:31:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 229 transitions. [2025-04-13 19:31:11,357 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.726984126984127 [2025-04-13 19:31:11,357 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 317 flow. Second operand 7 states and 229 transitions. [2025-04-13 19:31:11,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 162 transitions, 997 flow [2025-04-13 19:31:11,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 162 transitions, 973 flow, removed 12 selfloop flow, removed 3 redundant places. [2025-04-13 19:31:11,614 INFO L231 Difference]: Finished difference. Result has 77 places, 79 transitions, 499 flow [2025-04-13 19:31:11,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=499, PETRI_PLACES=77, PETRI_TRANSITIONS=79} [2025-04-13 19:31:11,614 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 23 predicate places. [2025-04-13 19:31:11,614 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 499 flow [2025-04-13 19:31:11,617 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:11,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:31:11,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:31:11,617 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:31:11,617 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:31:11,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:31:11,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1490482673, now seen corresponding path program 1 times [2025-04-13 19:31:11,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:31:11,618 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024056632] [2025-04-13 19:31:11,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:31:11,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:31:11,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 19:31:11,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 19:31:11,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:31:11,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:31:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:31:11,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:31:11,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024056632] [2025-04-13 19:31:11,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024056632] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:31:11,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:31:11,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:31:11,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161686189] [2025-04-13 19:31:11,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:31:11,816 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:31:11,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:31:11,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:31:11,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:31:11,822 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2025-04-13 19:31:11,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 499 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:11,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:31:11,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2025-04-13 19:31:11,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:31:13,937 INFO L116 PetriNetUnfolderBase]: 16408/26490 cut-off events. [2025-04-13 19:31:13,937 INFO L117 PetriNetUnfolderBase]: For 36379/37268 co-relation queries the response was YES. [2025-04-13 19:31:14,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76903 conditions, 26490 events. 16408/26490 cut-off events. For 36379/37268 co-relation queries the response was YES. Maximal size of possible extension queue 1312. Compared 211746 event pairs, 6463 based on Foata normal form. 700/25654 useless extension candidates. Maximal degree in co-relation 76876. Up to 11187 conditions per place. [2025-04-13 19:31:14,094 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 55 selfloop transitions, 18 changer transitions 25/125 dead transitions. [2025-04-13 19:31:14,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 125 transitions, 944 flow [2025-04-13 19:31:14,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:31:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:31:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2025-04-13 19:31:14,095 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6711111111111111 [2025-04-13 19:31:14,095 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 499 flow. Second operand 5 states and 151 transitions. [2025-04-13 19:31:14,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 125 transitions, 944 flow [2025-04-13 19:31:14,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 125 transitions, 940 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 19:31:14,300 INFO L231 Difference]: Finished difference. Result has 82 places, 78 transitions, 557 flow [2025-04-13 19:31:14,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=557, PETRI_PLACES=82, PETRI_TRANSITIONS=78} [2025-04-13 19:31:14,300 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 28 predicate places. [2025-04-13 19:31:14,300 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 557 flow [2025-04-13 19:31:14,301 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:14,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:31:14,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:31:14,301 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:31:14,301 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:31:14,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:31:14,301 INFO L85 PathProgramCache]: Analyzing trace with hash -998427059, now seen corresponding path program 3 times [2025-04-13 19:31:14,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:31:14,301 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744390948] [2025-04-13 19:31:14,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:31:14,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:31:14,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-04-13 19:31:14,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 19:31:14,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:31:14,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:31:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:31:14,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:31:14,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744390948] [2025-04-13 19:31:14,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744390948] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:31:14,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:31:14,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:31:14,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198905981] [2025-04-13 19:31:14,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:31:14,483 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:31:14,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:31:14,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:31:14,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:31:14,501 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-04-13 19:31:14,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 78 transitions, 557 flow. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:14,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:31:14,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-04-13 19:31:14,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:31:15,300 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L832-->L839: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_61 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_18 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_14 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff1_used~0_45 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_62 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_44 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_45) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and .cse2 (not (= 0 (mod v_~y$w_buff1_used~0_44 256)))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_17 256) 0)))) 0 v_~y$r_buff1_thd4~0_14) 256) 0) 0 1) v_~y$r_buff1_thd4~0_13) (= v_~y~0_26 (ite .cse4 v_~y$w_buff0~0_40 (ite .cse0 v_~y$w_buff1~0_27 v_~y~0_27))) (= v_~y$r_buff0_thd4~0_17 (ite (= (mod (ite .cse1 0 v_~y$r_buff0_thd4~0_18) 256) 0) 0 1)) (= (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_62) 256) 0) 0 1) v_~y$w_buff0_used~0_61)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_18, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_27, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_45} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_17, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_61, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_26, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_44} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][75], [42#L864true, Black: 153#(= ~z~0 1), Black: 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 47#L784true, 50#$Ultimate##0true, Black: 113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), Black: 106#true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 172#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 59#true, 6#L839true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, 151#true, 108#(= ~x~0 1), Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 135#(= ~a~0 1), 57#true, 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 35#P0EXITtrue, Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 55#true]) [2025-04-13 19:31:15,300 INFO L286 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-04-13 19:31:15,300 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-13 19:31:15,300 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-13 19:31:15,300 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-13 19:31:15,381 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L832-->L839: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_61 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_18 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_14 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff1_used~0_45 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_62 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_44 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_45) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and .cse2 (not (= 0 (mod v_~y$w_buff1_used~0_44 256)))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_17 256) 0)))) 0 v_~y$r_buff1_thd4~0_14) 256) 0) 0 1) v_~y$r_buff1_thd4~0_13) (= v_~y~0_26 (ite .cse4 v_~y$w_buff0~0_40 (ite .cse0 v_~y$w_buff1~0_27 v_~y~0_27))) (= v_~y$r_buff0_thd4~0_17 (ite (= (mod (ite .cse1 0 v_~y$r_buff0_thd4~0_18) 256) 0) 0 1)) (= (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_62) 256) 0) 0 1) v_~y$w_buff0_used~0_61)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_18, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_27, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_45} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_17, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_61, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_26, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_44} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][75], [42#L864true, Black: 153#(= ~z~0 1), Black: 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 47#L784true, Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 133#true, Black: 113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), Black: 106#true, 23#$Ultimate##0true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 172#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 59#true, 6#L839true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, Black: 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 151#true, 108#(= ~x~0 1), 36#P2EXITtrue, Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 135#(= ~a~0 1), 57#true, Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 55#true]) [2025-04-13 19:31:15,381 INFO L286 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-04-13 19:31:15,381 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-13 19:31:15,381 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-13 19:31:15,381 INFO L289 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-04-13 19:31:15,649 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L832-->L839: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_61 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_18 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_14 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff1_used~0_45 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_62 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_44 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_45) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and .cse2 (not (= 0 (mod v_~y$w_buff1_used~0_44 256)))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_17 256) 0)))) 0 v_~y$r_buff1_thd4~0_14) 256) 0) 0 1) v_~y$r_buff1_thd4~0_13) (= v_~y~0_26 (ite .cse4 v_~y$w_buff0~0_40 (ite .cse0 v_~y$w_buff1~0_27 v_~y~0_27))) (= v_~y$r_buff0_thd4~0_17 (ite (= (mod (ite .cse1 0 v_~y$r_buff0_thd4~0_18) 256) 0) 0 1)) (= (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_62) 256) 0) 0 1) v_~y$w_buff0_used~0_61)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_18, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_27, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_45} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_17, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_61, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_26, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_44} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][75], [42#L864true, Black: 153#(= ~z~0 1), Black: 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 47#L784true, Black: 113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), Black: 106#true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 172#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 59#true, 6#L839true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, 151#true, 108#(= ~x~0 1), Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 135#(= ~a~0 1), 57#true, 27#L806true, 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 35#P0EXITtrue, Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 55#true]) [2025-04-13 19:31:15,649 INFO L286 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-04-13 19:31:15,649 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-13 19:31:15,649 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-13 19:31:15,649 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-13 19:31:15,651 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L832-->L839: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_61 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_18 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_14 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff1_used~0_45 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_62 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_44 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_45) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and .cse2 (not (= 0 (mod v_~y$w_buff1_used~0_44 256)))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_17 256) 0)))) 0 v_~y$r_buff1_thd4~0_14) 256) 0) 0 1) v_~y$r_buff1_thd4~0_13) (= v_~y~0_26 (ite .cse4 v_~y$w_buff0~0_40 (ite .cse0 v_~y$w_buff1~0_27 v_~y~0_27))) (= v_~y$r_buff0_thd4~0_17 (ite (= (mod (ite .cse1 0 v_~y$r_buff0_thd4~0_18) 256) 0) 0 1)) (= (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_62) 256) 0) 0 1) v_~y$w_buff0_used~0_61)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_18, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_27, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_45} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_17, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_61, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_26, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_44} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [42#L864true, Black: 153#(= ~z~0 1), Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 50#$Ultimate##0true, 174#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), 15#L789true, 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 106#true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 59#true, 6#L839true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, 151#true, 108#(= ~x~0 1), Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 135#(= ~a~0 1), 57#true, 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 35#P0EXITtrue, Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 55#true]) [2025-04-13 19:31:15,651 INFO L286 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-04-13 19:31:15,651 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-13 19:31:15,651 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-13 19:31:15,651 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-13 19:31:15,696 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L832-->L839: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_61 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_18 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_14 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff1_used~0_45 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_62 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_44 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_45) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and .cse2 (not (= 0 (mod v_~y$w_buff1_used~0_44 256)))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_17 256) 0)))) 0 v_~y$r_buff1_thd4~0_14) 256) 0) 0 1) v_~y$r_buff1_thd4~0_13) (= v_~y~0_26 (ite .cse4 v_~y$w_buff0~0_40 (ite .cse0 v_~y$w_buff1~0_27 v_~y~0_27))) (= v_~y$r_buff0_thd4~0_17 (ite (= (mod (ite .cse1 0 v_~y$r_buff0_thd4~0_18) 256) 0) 0 1)) (= (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_62) 256) 0) 0 1) v_~y$w_buff0_used~0_61)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_18, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_27, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_45} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_17, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_61, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_26, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_44} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][75], [42#L864true, Black: 153#(= ~z~0 1), Black: 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 47#L784true, Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), 49#L753true, Black: 106#true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 172#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 59#true, 6#L839true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, 36#P2EXITtrue, 151#true, 108#(= ~x~0 1), Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 135#(= ~a~0 1), 57#true, 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 55#true]) [2025-04-13 19:31:15,696 INFO L286 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-04-13 19:31:15,696 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-13 19:31:15,696 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-13 19:31:15,696 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-13 19:31:15,763 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L832-->L839: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_61 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_18 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_14 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff1_used~0_45 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_62 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_44 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_45) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and .cse2 (not (= 0 (mod v_~y$w_buff1_used~0_44 256)))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_17 256) 0)))) 0 v_~y$r_buff1_thd4~0_14) 256) 0) 0 1) v_~y$r_buff1_thd4~0_13) (= v_~y~0_26 (ite .cse4 v_~y$w_buff0~0_40 (ite .cse0 v_~y$w_buff1~0_27 v_~y~0_27))) (= v_~y$r_buff0_thd4~0_17 (ite (= (mod (ite .cse1 0 v_~y$r_buff0_thd4~0_18) 256) 0) 0 1)) (= (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_62) 256) 0) 0 1) v_~y$w_buff0_used~0_61)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_18, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_27, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_45} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_17, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_61, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_26, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_44} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [42#L864true, Black: 153#(= ~z~0 1), Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 133#true, Black: 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 174#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), 15#L789true, 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 106#true, 23#$Ultimate##0true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 59#true, 6#L839true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, Black: 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 151#true, 108#(= ~x~0 1), 36#P2EXITtrue, Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 135#(= ~a~0 1), 57#true, Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 55#true]) [2025-04-13 19:31:15,763 INFO L286 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-04-13 19:31:15,763 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-13 19:31:15,763 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-13 19:31:15,763 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-13 19:31:15,802 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L809-->L816: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse0 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_91 256) 0)))) (.cse1 (and .cse4 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_112 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_90 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_91) 256) 0) 0 1)) (= v_~y~0_102 (ite .cse2 v_~y$w_buff0~0_86 (ite .cse0 v_~y$w_buff1~0_71 v_~y~0_103))) (= (ite (= (mod (ite .cse1 0 v_~y$r_buff0_thd3~0_31) 256) 0) 0 1) v_~y$r_buff0_thd3~0_30) (= (ite (= (mod (ite .cse2 0 v_~y$w_buff0_used~0_112) 256) 0) 0 1) v_~y$w_buff0_used~0_111) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_90 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_20) 256) 0) 0 1) v_~y$r_buff1_thd3~0_19)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_112, ~y$w_buff1~0=v_~y$w_buff1~0_71, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_103, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_91} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_111, ~y$w_buff1~0=v_~y$w_buff1~0_71, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_102, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_90} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][66], [113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), 42#L864true, Black: 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 47#L784true, 153#(= ~z~0 1), Black: 106#true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 172#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 59#true, 14#L832true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 135#(= ~a~0 1), 57#true, 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 35#P0EXITtrue, 12#L816true, Black: 108#(= ~x~0 1), Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 55#true]) [2025-04-13 19:31:15,802 INFO L286 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-04-13 19:31:15,802 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-13 19:31:15,802 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-13 19:31:15,802 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-13 19:31:15,804 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L832-->L839: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_61 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_18 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_14 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff1_used~0_45 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_62 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_44 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_45) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and .cse2 (not (= 0 (mod v_~y$w_buff1_used~0_44 256)))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_17 256) 0)))) 0 v_~y$r_buff1_thd4~0_14) 256) 0) 0 1) v_~y$r_buff1_thd4~0_13) (= v_~y~0_26 (ite .cse4 v_~y$w_buff0~0_40 (ite .cse0 v_~y$w_buff1~0_27 v_~y~0_27))) (= v_~y$r_buff0_thd4~0_17 (ite (= (mod (ite .cse1 0 v_~y$r_buff0_thd4~0_18) 256) 0) 0 1)) (= (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_62) 256) 0) 0 1) v_~y$w_buff0_used~0_61)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_18, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_27, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_45} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_17, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_61, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_26, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_44} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [42#L864true, Black: 153#(= ~z~0 1), Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 50#$Ultimate##0true, 174#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), 21#P1EXITtrue, 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 106#true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 59#true, 6#L839true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, 151#true, 108#(= ~x~0 1), Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 135#(= ~a~0 1), 57#true, 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 35#P0EXITtrue, Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 55#true]) [2025-04-13 19:31:15,804 INFO L286 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-04-13 19:31:15,804 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-13 19:31:15,804 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-13 19:31:15,804 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-13 19:31:15,915 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L832-->L839: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_61 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_18 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_14 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff1_used~0_45 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_62 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_44 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_45) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and .cse2 (not (= 0 (mod v_~y$w_buff1_used~0_44 256)))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_17 256) 0)))) 0 v_~y$r_buff1_thd4~0_14) 256) 0) 0 1) v_~y$r_buff1_thd4~0_13) (= v_~y~0_26 (ite .cse4 v_~y$w_buff0~0_40 (ite .cse0 v_~y$w_buff1~0_27 v_~y~0_27))) (= v_~y$r_buff0_thd4~0_17 (ite (= (mod (ite .cse1 0 v_~y$r_buff0_thd4~0_18) 256) 0) 0 1)) (= (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_62) 256) 0) 0 1) v_~y$w_buff0_used~0_61)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_18, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_27, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_45} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_17, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_61, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_26, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_44} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [42#L864true, Black: 153#(= ~z~0 1), Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 133#true, Black: 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 174#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), 21#P1EXITtrue, 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 106#true, 23#$Ultimate##0true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 59#true, 6#L839true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, Black: 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 151#true, 108#(= ~x~0 1), 36#P2EXITtrue, Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 135#(= ~a~0 1), 57#true, Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 55#true]) [2025-04-13 19:31:15,915 INFO L286 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-04-13 19:31:15,915 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-13 19:31:15,915 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-13 19:31:15,915 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-13 19:31:15,953 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L832-->L839: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_61 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_18 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_14 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff1_used~0_45 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_62 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_44 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_45) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and .cse2 (not (= 0 (mod v_~y$w_buff1_used~0_44 256)))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_17 256) 0)))) 0 v_~y$r_buff1_thd4~0_14) 256) 0) 0 1) v_~y$r_buff1_thd4~0_13) (= v_~y~0_26 (ite .cse4 v_~y$w_buff0~0_40 (ite .cse0 v_~y$w_buff1~0_27 v_~y~0_27))) (= v_~y$r_buff0_thd4~0_17 (ite (= (mod (ite .cse1 0 v_~y$r_buff0_thd4~0_18) 256) 0) 0 1)) (= (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_62) 256) 0) 0 1) v_~y$w_buff0_used~0_61)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_18, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_27, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_45} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_17, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_61, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_26, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_44} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [42#L864true, Black: 153#(= ~z~0 1), Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 174#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), 15#L789true, 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 106#true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 59#true, 6#L839true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, 151#true, 108#(= ~x~0 1), Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 135#(= ~a~0 1), 57#true, 27#L806true, 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 35#P0EXITtrue, Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 55#true]) [2025-04-13 19:31:15,953 INFO L286 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-04-13 19:31:15,953 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:31:15,953 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:31:15,953 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:31:15,962 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L809-->L816: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse0 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_91 256) 0)))) (.cse1 (and .cse4 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_112 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_90 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_91) 256) 0) 0 1)) (= v_~y~0_102 (ite .cse2 v_~y$w_buff0~0_86 (ite .cse0 v_~y$w_buff1~0_71 v_~y~0_103))) (= (ite (= (mod (ite .cse1 0 v_~y$r_buff0_thd3~0_31) 256) 0) 0 1) v_~y$r_buff0_thd3~0_30) (= (ite (= (mod (ite .cse2 0 v_~y$w_buff0_used~0_112) 256) 0) 0 1) v_~y$w_buff0_used~0_111) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_90 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_20) 256) 0) 0 1) v_~y$r_buff1_thd3~0_19)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_112, ~y$w_buff1~0=v_~y$w_buff1~0_71, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_103, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_91} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_111, ~y$w_buff1~0=v_~y$w_buff1~0_71, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_102, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_90} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][87], [113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), 42#L864true, Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 153#(= ~z~0 1), 174#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 15#L789true, 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 106#true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 59#true, 14#L832true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 135#(= ~a~0 1), 57#true, 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 12#L816true, 35#P0EXITtrue, Black: 108#(= ~x~0 1), Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 55#true]) [2025-04-13 19:31:15,962 INFO L286 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-04-13 19:31:15,962 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-04-13 19:31:15,962 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-04-13 19:31:15,962 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-04-13 19:31:16,012 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L832-->L839: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_61 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_18 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_14 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff1_used~0_45 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_62 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_44 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_45) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and .cse2 (not (= 0 (mod v_~y$w_buff1_used~0_44 256)))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_17 256) 0)))) 0 v_~y$r_buff1_thd4~0_14) 256) 0) 0 1) v_~y$r_buff1_thd4~0_13) (= v_~y~0_26 (ite .cse4 v_~y$w_buff0~0_40 (ite .cse0 v_~y$w_buff1~0_27 v_~y~0_27))) (= v_~y$r_buff0_thd4~0_17 (ite (= (mod (ite .cse1 0 v_~y$r_buff0_thd4~0_18) 256) 0) 0 1)) (= (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_62) 256) 0) 0 1) v_~y$w_buff0_used~0_61)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_18, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_27, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_45} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_17, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_61, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_26, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_44} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [42#L864true, Black: 153#(= ~z~0 1), Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 174#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), 15#L789true, 49#L753true, 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 106#true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 59#true, 6#L839true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, 36#P2EXITtrue, 151#true, 108#(= ~x~0 1), Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 135#(= ~a~0 1), 57#true, 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 55#true]) [2025-04-13 19:31:16,013 INFO L286 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-04-13 19:31:16,013 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:31:16,013 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:31:16,013 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:31:16,024 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L758-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][48], [42#L864true, Black: 153#(= ~z~0 1), 32#L761true, Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 47#L784true, Black: 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 174#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 106#true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 59#true, 14#L832true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, Black: 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 151#true, 36#P2EXITtrue, Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 57#true, 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 135#(= ~a~0 1), Black: 108#(= ~x~0 1), Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 55#true]) [2025-04-13 19:31:16,025 INFO L286 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-04-13 19:31:16,025 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:31:16,025 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:31:16,025 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:31:16,092 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L832-->L839: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_61 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_18 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_14 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff1_used~0_45 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_62 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_44 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_45) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and .cse2 (not (= 0 (mod v_~y$w_buff1_used~0_44 256)))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_17 256) 0)))) 0 v_~y$r_buff1_thd4~0_14) 256) 0) 0 1) v_~y$r_buff1_thd4~0_13) (= v_~y~0_26 (ite .cse4 v_~y$w_buff0~0_40 (ite .cse0 v_~y$w_buff1~0_27 v_~y~0_27))) (= v_~y$r_buff0_thd4~0_17 (ite (= (mod (ite .cse1 0 v_~y$r_buff0_thd4~0_18) 256) 0) 0 1)) (= (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_62) 256) 0) 0 1) v_~y$w_buff0_used~0_61)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_18, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_27, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_45} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_17, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_61, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_26, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_44} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [42#L864true, Black: 153#(= ~z~0 1), Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 174#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), 21#P1EXITtrue, 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 106#true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 59#true, 6#L839true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, 151#true, 108#(= ~x~0 1), Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 135#(= ~a~0 1), 57#true, 27#L806true, 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 35#P0EXITtrue, Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 55#true]) [2025-04-13 19:31:16,093 INFO L286 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-04-13 19:31:16,093 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-04-13 19:31:16,093 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-04-13 19:31:16,093 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-04-13 19:31:16,146 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L832-->L839: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_61 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_18 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd4~0_14 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff1_used~0_45 256) 0)) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_62 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_44 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_45) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and .cse2 (not (= 0 (mod v_~y$w_buff1_used~0_44 256)))) (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_17 256) 0)))) 0 v_~y$r_buff1_thd4~0_14) 256) 0) 0 1) v_~y$r_buff1_thd4~0_13) (= v_~y~0_26 (ite .cse4 v_~y$w_buff0~0_40 (ite .cse0 v_~y$w_buff1~0_27 v_~y~0_27))) (= v_~y$r_buff0_thd4~0_17 (ite (= (mod (ite .cse1 0 v_~y$r_buff0_thd4~0_18) 256) 0) 0 1)) (= (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_62) 256) 0) 0 1) v_~y$w_buff0_used~0_61)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_18, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_27, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_45} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_17, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_61, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_26, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_44} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][88], [42#L864true, Black: 153#(= ~z~0 1), Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 174#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), 49#L753true, 21#P1EXITtrue, 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 106#true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 59#true, 6#L839true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, 36#P2EXITtrue, 151#true, 108#(= ~x~0 1), Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 135#(= ~a~0 1), 57#true, 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 55#true]) [2025-04-13 19:31:16,146 INFO L286 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-04-13 19:31:16,146 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-04-13 19:31:16,146 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-04-13 19:31:16,146 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-04-13 19:31:16,156 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L758-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][83], [42#L864true, Black: 153#(= ~z~0 1), 32#L761true, Black: 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), 15#L789true, Black: 106#true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 59#true, 14#L832true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, 36#P2EXITtrue, Black: 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 151#true, Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 97#(< (mod ~main$tmp_guard0~0 256) 1), 57#true, 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 135#(= ~a~0 1), Black: 108#(= ~x~0 1), 176#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 55#true]) [2025-04-13 19:31:16,156 INFO L286 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-04-13 19:31:16,156 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-04-13 19:31:16,156 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-04-13 19:31:16,156 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-04-13 19:31:16,224 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L809-->L816: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse0 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_91 256) 0)))) (.cse1 (and .cse4 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_112 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_90 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_91) 256) 0) 0 1)) (= v_~y~0_102 (ite .cse2 v_~y$w_buff0~0_86 (ite .cse0 v_~y$w_buff1~0_71 v_~y~0_103))) (= (ite (= (mod (ite .cse1 0 v_~y$r_buff0_thd3~0_31) 256) 0) 0 1) v_~y$r_buff0_thd3~0_30) (= (ite (= (mod (ite .cse2 0 v_~y$w_buff0_used~0_112) 256) 0) 0 1) v_~y$w_buff0_used~0_111) (= (ite (= (mod (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_90 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_20) 256) 0) 0 1) v_~y$r_buff1_thd3~0_19)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_112, ~y$w_buff1~0=v_~y$w_buff1~0_71, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_103, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_91} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_111, ~y$w_buff1~0=v_~y$w_buff1~0_71, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_102, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_90} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][87], [113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), 42#L864true, Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 153#(= ~z~0 1), 174#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 21#P1EXITtrue, 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 106#true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 59#true, 14#L832true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 135#(= ~a~0 1), 57#true, 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 35#P0EXITtrue, 12#L816true, Black: 108#(= ~x~0 1), Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 55#true]) [2025-04-13 19:31:16,224 INFO L286 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-04-13 19:31:16,224 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-04-13 19:31:16,224 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-04-13 19:31:16,224 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-04-13 19:31:16,374 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([368] L758-->L761: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][83], [42#L864true, Black: 153#(= ~z~0 1), 32#L761true, Black: 103#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 78#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 121#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 89#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 113#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~x~0 1)), 21#P1EXITtrue, Black: 106#true, Black: 66#(<= ~__unbuffered_p3_EAX~0 0), 59#true, 14#L832true, Black: 140#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 1)), 53#true, Black: 143#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 151#true, 36#P2EXITtrue, Black: 154#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 97#(< (mod ~main$tmp_guard0~0 256) 1), 57#true, 115#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 157#(and (= ~z~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 135#(= ~a~0 1), Black: 108#(= ~x~0 1), Black: 110#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 176#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 55#true]) [2025-04-13 19:31:16,374 INFO L286 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-04-13 19:31:16,374 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:31:16,374 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:31:16,374 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:31:16,802 INFO L116 PetriNetUnfolderBase]: 18849/27370 cut-off events. [2025-04-13 19:31:16,802 INFO L117 PetriNetUnfolderBase]: For 36049/40492 co-relation queries the response was YES. [2025-04-13 19:31:16,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78740 conditions, 27370 events. 18849/27370 cut-off events. For 36049/40492 co-relation queries the response was YES. Maximal size of possible extension queue 1498. Compared 188221 event pairs, 930 based on Foata normal form. 1277/27616 useless extension candidates. Maximal degree in co-relation 78709. Up to 8964 conditions per place. [2025-04-13 19:31:16,903 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 53 selfloop transitions, 18 changer transitions 31/131 dead transitions. [2025-04-13 19:31:16,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 131 transitions, 948 flow [2025-04-13 19:31:16,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:31:16,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:31:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2025-04-13 19:31:16,905 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-13 19:31:16,905 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 557 flow. Second operand 7 states and 210 transitions. [2025-04-13 19:31:16,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 131 transitions, 948 flow [2025-04-13 19:31:17,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 131 transitions, 931 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-04-13 19:31:17,198 INFO L231 Difference]: Finished difference. Result has 87 places, 66 transitions, 460 flow [2025-04-13 19:31:17,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=460, PETRI_PLACES=87, PETRI_TRANSITIONS=66} [2025-04-13 19:31:17,199 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 33 predicate places. [2025-04-13 19:31:17,199 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 66 transitions, 460 flow [2025-04-13 19:31:17,199 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:17,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:31:17,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:31:17,199 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:31:17,199 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:31:17,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:31:17,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1903597469, now seen corresponding path program 1 times [2025-04-13 19:31:17,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:31:17,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071337206] [2025-04-13 19:31:17,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:31:17,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:31:17,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 19:31:17,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:31:17,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:31:17,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:31:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:31:17,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:31:17,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071337206] [2025-04-13 19:31:17,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071337206] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:31:17,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:31:17,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:31:17,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951595299] [2025-04-13 19:31:17,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:31:17,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:31:17,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:31:17,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:31:17,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:31:17,781 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 45 [2025-04-13 19:31:17,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 66 transitions, 460 flow. Second operand has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:17,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:31:17,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 45 [2025-04-13 19:31:17,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:31:18,776 INFO L116 PetriNetUnfolderBase]: 4967/8756 cut-off events. [2025-04-13 19:31:18,776 INFO L117 PetriNetUnfolderBase]: For 9732/10246 co-relation queries the response was YES. [2025-04-13 19:31:18,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24341 conditions, 8756 events. 4967/8756 cut-off events. For 9732/10246 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 70000 event pairs, 1581 based on Foata normal form. 30/7840 useless extension candidates. Maximal degree in co-relation 24308. Up to 3385 conditions per place. [2025-04-13 19:31:18,837 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 43 selfloop transitions, 7 changer transitions 7/102 dead transitions. [2025-04-13 19:31:18,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 682 flow [2025-04-13 19:31:18,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:31:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:31:18,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 234 transitions. [2025-04-13 19:31:18,839 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-04-13 19:31:18,839 INFO L175 Difference]: Start difference. First operand has 87 places, 66 transitions, 460 flow. Second operand 8 states and 234 transitions. [2025-04-13 19:31:18,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 682 flow [2025-04-13 19:31:18,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 102 transitions, 529 flow, removed 34 selfloop flow, removed 14 redundant places. [2025-04-13 19:31:18,936 INFO L231 Difference]: Finished difference. Result has 84 places, 71 transitions, 370 flow [2025-04-13 19:31:18,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=370, PETRI_PLACES=84, PETRI_TRANSITIONS=71} [2025-04-13 19:31:18,937 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 30 predicate places. [2025-04-13 19:31:18,937 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 370 flow [2025-04-13 19:31:18,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:31:18,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:31:18,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:31:18,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:31:18,939 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:31:18,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:31:18,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2138281419, now seen corresponding path program 2 times [2025-04-13 19:31:18,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:31:18,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994529869] [2025-04-13 19:31:18,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:31:18,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:31:18,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 1 equivalence classes. [2025-04-13 19:31:19,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:31:19,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:31:19,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:31:19,004 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:31:19,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 19:31:19,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:31:19,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:31:19,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:31:19,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:31:19,094 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:31:19,094 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 19:31:19,096 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 19:31:19,096 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 19:31:19,096 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 19:31:19,096 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-13 19:31:19,096 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-13 19:31:19,096 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 19:31:19,096 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:31:19,096 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2025-04-13 19:31:19,219 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:31:19,219 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:31:19,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:31:19 BasicIcfg [2025-04-13 19:31:19,226 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:31:19,227 INFO L158 Benchmark]: Toolchain (without parser) took 16542.68ms. Allocated memory was 155.2MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 107.3MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-04-13 19:31:19,227 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:31:19,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.78ms. Allocated memory is still 155.2MB. Free memory was 106.5MB in the beginning and 80.9MB in the end (delta: 25.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 19:31:19,228 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.11ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 78.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:31:19,228 INFO L158 Benchmark]: Boogie Preprocessor took 36.06ms. Allocated memory is still 155.2MB. Free memory was 78.2MB in the beginning and 74.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:31:19,228 INFO L158 Benchmark]: RCFGBuilder took 629.81ms. Allocated memory is still 155.2MB. Free memory was 74.8MB in the beginning and 86.3MB in the end (delta: -11.5MB). Peak memory consumption was 57.1MB. Max. memory is 8.0GB. [2025-04-13 19:31:19,228 INFO L158 Benchmark]: TraceAbstraction took 15409.57ms. Allocated memory was 155.2MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 86.3MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-04-13 19:31:19,230 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.14ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 426.78ms. Allocated memory is still 155.2MB. Free memory was 106.5MB in the beginning and 80.9MB in the end (delta: 25.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.11ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 78.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.06ms. Allocated memory is still 155.2MB. Free memory was 78.2MB in the beginning and 74.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 629.81ms. Allocated memory is still 155.2MB. Free memory was 74.8MB in the beginning and 86.3MB in the end (delta: -11.5MB). Peak memory consumption was 57.1MB. Max. memory is 8.0GB. * TraceAbstraction took 15409.57ms. Allocated memory was 155.2MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 86.3MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t693; [L857] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t693=-3, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t694; [L859] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t693=-3, t694=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t695; [L861] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t693=-3, t694=-2, t695=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t696; [L863] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t693=-3, t694=-2, t695=-1, t696=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L805] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L808] 3 z = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L825] 4 z = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_p3_EBX = a VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L752] 1 a = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0: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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L755] 1 __unbuffered_p0_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0: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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L767] 2 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0: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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EAX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L788] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L811] 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) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 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 [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L834] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L835] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L836] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L837] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L838] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693=-3, t694=-2, t695=-1, t696=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L870] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L871] 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 [L872] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693=-3, t694=-2, t695=-1, t696=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L876] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693=-3, t694=-2, t695=-1, t696=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 861]: 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. - 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: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 80 locations, 75 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 639 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 626 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1271 IncrementalHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 31 mSDtfsCounter, 1271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred in iteration=8, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 274 NumberOfCodeBlocks, 274 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1258 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-13 19:31:19,245 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...