/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:09:38,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:09:38,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 21:09:38,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:09:38,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:09:38,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:09:38,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:09:38,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:09:38,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:09:38,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:09:38,865 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:09:38,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:09:38,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:09:38,867 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:09:38,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:09:38,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:09:38,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:09:38,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:09:38,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:09:38,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:09:38,868 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:09:38,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:09:38,870 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:09:38,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:09:38,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:09:38,871 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:09:38,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:09:38,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:09:38,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:09:38,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:09:38,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:09:38,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:09:38,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:09:38,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:09:38,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:09:38,873 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 21:09:39,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:09:39,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:09:39,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:09:39,183 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:09:39,184 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:09:39,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:09:40,261 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:09:40,584 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:09:40,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:09:40,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7512f3e25/3b31f20e470a4193b1b8141ce6112ea5/FLAGcce82a1c5 [2023-08-26 21:09:40,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7512f3e25/3b31f20e470a4193b1b8141ce6112ea5 [2023-08-26 21:09:40,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:09:40,614 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:09:40,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:09:40,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:09:40,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:09:40,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:09:40" (1/1) ... [2023-08-26 21:09:40,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2769eac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:09:40, skipping insertion in model container [2023-08-26 21:09:40,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:09:40" (1/1) ... [2023-08-26 21:09:40,668 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:09:40,987 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:09:41,002 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:09:41,028 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:09:41,037 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:09:41,075 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:09:41,120 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:09:41,120 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:09:41,126 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:09:41,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:09:41 WrapperNode [2023-08-26 21:09:41,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:09:41,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:09:41,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:09:41,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:09:41,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:09:41" (1/1) ... [2023-08-26 21:09:41,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:09:41" (1/1) ... [2023-08-26 21:09:41,193 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154 [2023-08-26 21:09:41,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:09:41,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:09:41,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:09:41,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:09:41,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:09:41" (1/1) ... [2023-08-26 21:09:41,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:09:41" (1/1) ... [2023-08-26 21:09:41,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:09:41" (1/1) ... [2023-08-26 21:09:41,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:09:41" (1/1) ... [2023-08-26 21:09:41,226 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:09:41" (1/1) ... [2023-08-26 21:09:41,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:09:41" (1/1) ... [2023-08-26 21:09:41,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:09:41" (1/1) ... [2023-08-26 21:09:41,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:09:41" (1/1) ... [2023-08-26 21:09:41,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:09:41,245 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:09:41,245 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:09:41,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:09:41,246 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:09:41" (1/1) ... [2023-08-26 21:09:41,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:09:41,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:09:41,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 21:09:41,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 21:09:41,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:09:41,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:09:41,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:09:41,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:09:41,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:09:41,307 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:09:41,307 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:09:41,307 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:09:41,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:09:41,308 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:09:41,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:09:41,308 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 21:09:41,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 21:09:41,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:09:41,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:09:41,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:09:41,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:09:41,310 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:09:41,428 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:09:41,429 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:09:41,783 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:09:41,914 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:09:41,914 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:09:41,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:09:41 BoogieIcfgContainer [2023-08-26 21:09:41,917 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:09:41,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:09:41,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:09:41,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:09:41,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:09:40" (1/3) ... [2023-08-26 21:09:41,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d83015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:09:41, skipping insertion in model container [2023-08-26 21:09:41,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:09:41" (2/3) ... [2023-08-26 21:09:41,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d83015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:09:41, skipping insertion in model container [2023-08-26 21:09:41,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:09:41" (3/3) ... [2023-08-26 21:09:41,925 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:09:41,940 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:09:41,941 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 21:09:41,942 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:09:42,013 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:09:42,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 145 transitions, 310 flow [2023-08-26 21:09:42,124 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-26 21:09:42,124 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:09:42,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 115 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 21:09:42,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 145 transitions, 310 flow [2023-08-26 21:09:42,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 141 transitions, 294 flow [2023-08-26 21:09:42,141 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:09:42,159 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 141 transitions, 294 flow [2023-08-26 21:09:42,162 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 141 transitions, 294 flow [2023-08-26 21:09:42,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 141 transitions, 294 flow [2023-08-26 21:09:42,207 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-26 21:09:42,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:09:42,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 114 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-26 21:09:42,213 INFO L119 LiptonReduction]: Number of co-enabled transitions 4682 [2023-08-26 21:09:46,248 INFO L134 LiptonReduction]: Checked pairs total: 18430 [2023-08-26 21:09:46,248 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-08-26 21:09:46,260 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:09:46,266 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@434ac007, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:09:46,266 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-26 21:09:46,268 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:09:46,268 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-26 21:09:46,268 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:09:46,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:09:46,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 21:09:46,269 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:09:46,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:09:46,274 INFO L85 PathProgramCache]: Analyzing trace with hash 631758, now seen corresponding path program 1 times [2023-08-26 21:09:46,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:09:46,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298283216] [2023-08-26 21:09:46,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:09:46,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:09:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:09:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:09:46,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:09:46,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298283216] [2023-08-26 21:09:46,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298283216] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:09:46,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:09:46,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:09:46,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039879232] [2023-08-26 21:09:46,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:09:46,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:09:46,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:09:46,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:09:46,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:09:46,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 267 [2023-08-26 21:09:46,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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) [2023-08-26 21:09:46,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:09:46,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 267 [2023-08-26 21:09:46,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:09:48,638 INFO L124 PetriNetUnfolderBase]: 12064/17909 cut-off events. [2023-08-26 21:09:48,639 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2023-08-26 21:09:48,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34352 conditions, 17909 events. 12064/17909 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 124152 event pairs, 1764 based on Foata normal form. 0/14074 useless extension candidates. Maximal degree in co-relation 34340. Up to 13549 conditions per place. [2023-08-26 21:09:48,781 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 50 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-26 21:09:48,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 247 flow [2023-08-26 21:09:48,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:09:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:09:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-26 21:09:48,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5181023720349563 [2023-08-26 21:09:48,799 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-26 21:09:48,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-26 21:09:48,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:09:48,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-26 21:09:48,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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) [2023-08-26 21:09:48,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-26 21:09:48,818 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-26 21:09:48,820 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 3 states and 415 transitions. [2023-08-26 21:09:48,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 247 flow [2023-08-26 21:09:48,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 240 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:09:48,827 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 88 flow [2023-08-26 21:09:48,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-26 21:09:48,831 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-26 21:09:48,832 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 88 flow [2023-08-26 21:09:48,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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) [2023-08-26 21:09:48,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:09:48,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:09:48,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:09:48,833 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:09:48,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:09:48,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1641308082, now seen corresponding path program 1 times [2023-08-26 21:09:48,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:09:48,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648977086] [2023-08-26 21:09:48,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:09:48,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:09:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:09:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:09:48,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:09:48,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648977086] [2023-08-26 21:09:48,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648977086] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:09:48,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:09:48,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:09:48,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445218812] [2023-08-26 21:09:48,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:09:48,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:09:48,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:09:48,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:09:48,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:09:48,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 267 [2023-08-26 21:09:48,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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) [2023-08-26 21:09:48,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:09:48,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 267 [2023-08-26 21:09:48,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:09:50,623 INFO L124 PetriNetUnfolderBase]: 12064/16234 cut-off events. [2023-08-26 21:09:50,623 INFO L125 PetriNetUnfolderBase]: For 811/811 co-relation queries the response was YES. [2023-08-26 21:09:50,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33487 conditions, 16234 events. 12064/16234 cut-off events. For 811/811 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 87154 event pairs, 12064 based on Foata normal form. 0/12306 useless extension candidates. Maximal degree in co-relation 33477. Up to 16125 conditions per place. [2023-08-26 21:09:50,716 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 28 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-08-26 21:09:50,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 138 flow [2023-08-26 21:09:50,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:09:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:09:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-26 21:09:50,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47191011235955055 [2023-08-26 21:09:50,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-26 21:09:50,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-26 21:09:50,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:09:50,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-26 21:09:50,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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) [2023-08-26 21:09:50,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-26 21:09:50,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-26 21:09:50,723 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 88 flow. Second operand 3 states and 378 transitions. [2023-08-26 21:09:50,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 138 flow [2023-08-26 21:09:50,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:09:50,726 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 78 flow [2023-08-26 21:09:50,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-26 21:09:50,727 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2023-08-26 21:09:50,730 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 78 flow [2023-08-26 21:09:50,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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) [2023-08-26 21:09:50,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:09:50,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:09:50,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:09:50,737 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:09:50,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:09:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1641308083, now seen corresponding path program 1 times [2023-08-26 21:09:50,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:09:50,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993736905] [2023-08-26 21:09:50,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:09:50,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:09:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:09:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:09:50,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:09:50,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993736905] [2023-08-26 21:09:50,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993736905] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:09:50,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:09:50,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:09:50,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710530649] [2023-08-26 21:09:50,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:09:50,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:09:50,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:09:50,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:09:50,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:09:50,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 267 [2023-08-26 21:09:50,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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) [2023-08-26 21:09:50,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:09:50,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 267 [2023-08-26 21:09:50,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:09:51,781 INFO L124 PetriNetUnfolderBase]: 7784/10744 cut-off events. [2023-08-26 21:09:51,782 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:09:51,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21665 conditions, 10744 events. 7784/10744 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 58978 event pairs, 2133 based on Foata normal form. 0/8731 useless extension candidates. Maximal degree in co-relation 21659. Up to 8563 conditions per place. [2023-08-26 21:09:51,830 INFO L140 encePairwiseOnDemand]: 258/267 looper letters, 47 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2023-08-26 21:09:51,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 234 flow [2023-08-26 21:09:51,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:09:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:09:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-08-26 21:09:51,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006242197253433 [2023-08-26 21:09:51,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-08-26 21:09:51,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-08-26 21:09:51,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:09:51,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-08-26 21:09:51,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-08-26 21:09:51,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-26 21:09:51,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-26 21:09:51,836 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 78 flow. Second operand 3 states and 401 transitions. [2023-08-26 21:09:51,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 234 flow [2023-08-26 21:09:51,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:09:51,837 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 116 flow [2023-08-26 21:09:51,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-26 21:09:51,838 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-26 21:09:51,838 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 116 flow [2023-08-26 21:09:51,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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) [2023-08-26 21:09:51,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:09:51,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:09:51,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:09:51,839 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:09:51,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:09:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1709027902, now seen corresponding path program 1 times [2023-08-26 21:09:51,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:09:51,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164094127] [2023-08-26 21:09:51,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:09:51,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:09:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:09:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:09:52,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:09:52,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164094127] [2023-08-26 21:09:52,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164094127] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:09:52,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:09:52,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:09:52,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755214523] [2023-08-26 21:09:52,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:09:52,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:09:52,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:09:52,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:09:52,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:09:52,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 267 [2023-08-26 21:09:52,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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) [2023-08-26 21:09:52,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:09:52,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 267 [2023-08-26 21:09:52,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:09:54,972 INFO L124 PetriNetUnfolderBase]: 31667/43188 cut-off events. [2023-08-26 21:09:54,972 INFO L125 PetriNetUnfolderBase]: For 4064/4064 co-relation queries the response was YES. [2023-08-26 21:09:55,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101928 conditions, 43188 events. 31667/43188 cut-off events. For 4064/4064 co-relation queries the response was YES. Maximal size of possible extension queue 1162. Compared 246508 event pairs, 11891 based on Foata normal form. 0/37780 useless extension candidates. Maximal degree in co-relation 101920. Up to 27653 conditions per place. [2023-08-26 21:09:55,192 INFO L140 encePairwiseOnDemand]: 257/267 looper letters, 62 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2023-08-26 21:09:55,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 71 transitions, 356 flow [2023-08-26 21:09:55,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:09:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:09:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-26 21:09:55,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484394506866417 [2023-08-26 21:09:55,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-26 21:09:55,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-26 21:09:55,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:09:55,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-26 21:09:55,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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) [2023-08-26 21:09:55,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-26 21:09:55,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-26 21:09:55,199 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 116 flow. Second operand 3 states and 388 transitions. [2023-08-26 21:09:55,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 71 transitions, 356 flow [2023-08-26 21:09:55,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 347 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:09:55,204 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 181 flow [2023-08-26 21:09:55,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-08-26 21:09:55,205 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-26 21:09:55,205 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 181 flow [2023-08-26 21:09:55,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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) [2023-08-26 21:09:55,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:09:55,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:09:55,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:09:55,205 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:09:55,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:09:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1632678174, now seen corresponding path program 1 times [2023-08-26 21:09:55,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:09:55,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928608521] [2023-08-26 21:09:55,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:09:55,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:09:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:09:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:09:55,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:09:55,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928608521] [2023-08-26 21:09:55,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928608521] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:09:55,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:09:55,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:09:55,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240865532] [2023-08-26 21:09:55,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:09:55,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:09:55,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:09:55,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:09:55,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:09:55,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 267 [2023-08-26 21:09:55,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 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) [2023-08-26 21:09:55,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:09:55,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 267 [2023-08-26 21:09:55,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:09:56,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([599] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: (and (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_16 1) (= v_~x~0_21 2) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_26))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} OutVars{ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_23|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_23|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~main$tmp_guard1~0][47], [110#$Ultimate##0true, 164#(<= 0 ~__unbuffered_cnt~0), 50#L795true, 97#L831true, 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 179#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, 93#ULTIMATE.startErr0ASSERT_VIOLATIONASSERTtrue, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,433 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-26 21:09:56,433 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 21:09:56,433 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 21:09:56,433 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 21:09:56,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][41], [110#$Ultimate##0true, 164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, 50#L795true, 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 179#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 12#L889true, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,434 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-26 21:09:56,434 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 21:09:56,434 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 21:09:56,434 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 21:09:56,434 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][33], [110#$Ultimate##0true, 164#(<= 0 ~__unbuffered_cnt~0), 50#L795true, 118#L818true, 97#L831true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 179#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 12#L889true, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,434 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-26 21:09:56,435 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 21:09:56,435 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 21:09:56,435 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-26 21:09:56,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][54], [114#L768true, 164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, 50#L795true, 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 179#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, 12#L889true, P3Thread1of1ForFork0InUse, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,656 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,656 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,656 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,656 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,657 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([599] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: (and (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_16 1) (= v_~x~0_21 2) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_26))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} OutVars{ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_23|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_23|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~main$tmp_guard1~0][47], [164#(<= 0 ~__unbuffered_cnt~0), 50#L795true, 105#L811true, 97#L831true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 179#(<= ~__unbuffered_cnt~0 0), 74#L765true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, 93#ULTIMATE.startErr0ASSERT_VIOLATIONASSERTtrue, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,657 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,657 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,657 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,657 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L889-->ULTIMATE.startEXIT: Formula: (and (= |v_#valid_140| (store (store (store (store |v_#valid_141| |v_ULTIMATE.start_main_~#t121~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t122~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t123~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t124~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_#res#1_34| |v_ULTIMATE.start_#t~ret13#1_10|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~x~0_19 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EAX~0_14 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#res#1_34| 0) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|)) InVars {ULTIMATE.start_main_~#t123~0#1.base=|v_ULTIMATE.start_main_~#t123~0#1.base_41|, ULTIMATE.start_main_~#t124~0#1.base=|v_ULTIMATE.start_main_~#t124~0#1.base_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t122~0#1.base=|v_ULTIMATE.start_main_~#t122~0#1.base_45|, ULTIMATE.start_main_~#t121~0#1.base=|v_ULTIMATE.start_main_~#t121~0#1.base_41|, #valid=|v_#valid_141|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_19} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_~#t122~0#1.offset=|v_ULTIMATE.start_main_~#t122~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_~#t123~0#1.offset=|v_ULTIMATE.start_main_~#t123~0#1.offset_28|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ULTIMATE.start_main_~#t124~0#1.offset=|v_ULTIMATE.start_main_~#t124~0#1.offset_28|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #valid=|v_#valid_140|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ULTIMATE.start_main_~#t121~0#1.offset=|v_ULTIMATE.start_main_~#t121~0#1.offset_28|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x~0=v_~x~0_19, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t124~0#1.base, ULTIMATE.start_main_~#t122~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t122~0#1.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t123~0#1.offset, ULTIMATE.start_main_~#t124~0#1.offset, ULTIMATE.start_main_~#t123~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t121~0#1.base, #valid, ULTIMATE.start_main_~#t121~0#1.offset, ULTIMATE.start_#t~ret13#1][42], [114#L768true, 164#(<= 0 ~__unbuffered_cnt~0), 3#ULTIMATE.startEXITtrue, 50#L795true, 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 105#L811true, 97#L831true, Black: 171#true, 179#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,658 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,658 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,658 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,658 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][33], [164#(<= 0 ~__unbuffered_cnt~0), 50#L795true, 97#L831true, 118#L818true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 74#L765true, 179#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, 12#L889true, P3Thread1of1ForFork0InUse, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,658 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,659 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,659 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,659 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,659 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][41], [164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, 50#L795true, 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 74#L765true, 179#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, 12#L889true, P3Thread1of1ForFork0InUse, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,659 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,660 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,660 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,660 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,685 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L889-->ULTIMATE.startEXIT: Formula: (and (= |v_#valid_140| (store (store (store (store |v_#valid_141| |v_ULTIMATE.start_main_~#t121~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t122~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t123~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t124~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_#res#1_34| |v_ULTIMATE.start_#t~ret13#1_10|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~x~0_19 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EAX~0_14 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#res#1_34| 0) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|)) InVars {ULTIMATE.start_main_~#t123~0#1.base=|v_ULTIMATE.start_main_~#t123~0#1.base_41|, ULTIMATE.start_main_~#t124~0#1.base=|v_ULTIMATE.start_main_~#t124~0#1.base_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t122~0#1.base=|v_ULTIMATE.start_main_~#t122~0#1.base_45|, ULTIMATE.start_main_~#t121~0#1.base=|v_ULTIMATE.start_main_~#t121~0#1.base_41|, #valid=|v_#valid_141|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_19} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_~#t122~0#1.offset=|v_ULTIMATE.start_main_~#t122~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_~#t123~0#1.offset=|v_ULTIMATE.start_main_~#t123~0#1.offset_28|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ULTIMATE.start_main_~#t124~0#1.offset=|v_ULTIMATE.start_main_~#t124~0#1.offset_28|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #valid=|v_#valid_140|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ULTIMATE.start_main_~#t121~0#1.offset=|v_ULTIMATE.start_main_~#t121~0#1.offset_28|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x~0=v_~x~0_19, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t124~0#1.base, ULTIMATE.start_main_~#t122~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t122~0#1.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t123~0#1.offset, ULTIMATE.start_main_~#t124~0#1.offset, ULTIMATE.start_main_~#t123~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t121~0#1.base, #valid, ULTIMATE.start_main_~#t121~0#1.offset, ULTIMATE.start_#t~ret13#1][48], [110#$Ultimate##0true, 164#(<= 0 ~__unbuffered_cnt~0), 3#ULTIMATE.startEXITtrue, 50#L795true, 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 105#L811true, 97#L831true, Black: 171#true, 179#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,685 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2023-08-26 21:09:56,685 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-26 21:09:56,686 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-26 21:09:56,686 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-26 21:09:56,712 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([599] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: (and (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_16 1) (= v_~x~0_21 2) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_26))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} OutVars{ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_23|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_23|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~main$tmp_guard1~0][64], [110#$Ultimate##0true, 164#(<= 0 ~__unbuffered_cnt~0), Black: 168#(<= ~__unbuffered_cnt~0 0), 97#L831true, 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, 93#ULTIMATE.startErr0ASSERT_VIOLATIONASSERTtrue, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,712 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,713 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,713 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,713 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,713 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L889-->ULTIMATE.startEXIT: Formula: (and (= |v_#valid_140| (store (store (store (store |v_#valid_141| |v_ULTIMATE.start_main_~#t121~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t122~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t123~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t124~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_#res#1_34| |v_ULTIMATE.start_#t~ret13#1_10|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~x~0_19 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EAX~0_14 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#res#1_34| 0) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|)) InVars {ULTIMATE.start_main_~#t123~0#1.base=|v_ULTIMATE.start_main_~#t123~0#1.base_41|, ULTIMATE.start_main_~#t124~0#1.base=|v_ULTIMATE.start_main_~#t124~0#1.base_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t122~0#1.base=|v_ULTIMATE.start_main_~#t122~0#1.base_45|, ULTIMATE.start_main_~#t121~0#1.base=|v_ULTIMATE.start_main_~#t121~0#1.base_41|, #valid=|v_#valid_141|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_19} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_~#t122~0#1.offset=|v_ULTIMATE.start_main_~#t122~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_~#t123~0#1.offset=|v_ULTIMATE.start_main_~#t123~0#1.offset_28|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ULTIMATE.start_main_~#t124~0#1.offset=|v_ULTIMATE.start_main_~#t124~0#1.offset_28|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #valid=|v_#valid_140|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ULTIMATE.start_main_~#t121~0#1.offset=|v_ULTIMATE.start_main_~#t121~0#1.offset_28|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x~0=v_~x~0_19, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t124~0#1.base, ULTIMATE.start_main_~#t122~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t122~0#1.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t123~0#1.offset, ULTIMATE.start_main_~#t124~0#1.offset, ULTIMATE.start_main_~#t123~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t121~0#1.base, #valid, ULTIMATE.start_main_~#t121~0#1.offset, ULTIMATE.start_#t~ret13#1][65], [110#$Ultimate##0true, 164#(<= 0 ~__unbuffered_cnt~0), 3#ULTIMATE.startEXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 97#L831true, 105#L811true, Black: 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, 180#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,713 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,713 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,713 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,713 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][58], [110#$Ultimate##0true, 164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, Black: 168#(<= ~__unbuffered_cnt~0 0), 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), 12#L889true, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,714 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,714 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,714 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,714 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][53], [110#$Ultimate##0true, 164#(<= 0 ~__unbuffered_cnt~0), Black: 168#(<= ~__unbuffered_cnt~0 0), 97#L831true, 118#L818true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 12#L889true, 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,714 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,714 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,714 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,714 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 21:09:56,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([599] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: (and (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_16 1) (= v_~x~0_21 2) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_26))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} OutVars{ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_23|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_23|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~main$tmp_guard1~0][47], [114#L768true, 164#(<= 0 ~__unbuffered_cnt~0), 50#L795true, 97#L831true, 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 179#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, 93#ULTIMATE.startErr0ASSERT_VIOLATIONASSERTtrue, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,837 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,837 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,837 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,837 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][41], [114#L768true, 164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, 50#L795true, 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 179#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, 12#L889true, P3Thread1of1ForFork0InUse, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,838 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,838 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,838 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,838 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][33], [114#L768true, 164#(<= 0 ~__unbuffered_cnt~0), 50#L795true, 97#L831true, 118#L818true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 179#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, 12#L889true, P3Thread1of1ForFork0InUse, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,838 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,838 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,838 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,838 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L768-->L775: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd1~0_14 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_25 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_117 256) 0)))) (let ((.cse2 (and .cse5 .cse1)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_105 256) 0)) .cse0)) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_118 256) 0))))) (and (= v_~a$r_buff1_thd1~0_13 (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_104 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_24 256) 0)) .cse1)) 0 v_~a$r_buff1_thd1~0_14)) (= v_~a$r_buff0_thd1~0_24 (ite .cse2 0 v_~a$r_buff0_thd1~0_25)) (= v_~a$w_buff1_used~0_104 (ite (or .cse3 .cse2) 0 v_~a$w_buff1_used~0_105)) (= (ite .cse4 v_~a$w_buff0~0_42 (ite .cse3 v_~a$w_buff1~0_47 v_~a~0_63)) v_~a~0_62) (= (ite .cse4 0 v_~a$w_buff0_used~0_118) v_~a$w_buff0_used~0_117)))) InVars {~a~0=v_~a~0_63, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$w_buff0~0=v_~a$w_buff0~0_42, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_14, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_118, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_105} OutVars{~a~0=v_~a~0_62, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$w_buff0~0=v_~a$w_buff0~0_42, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_13, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_117, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_24, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_104} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][6], [164#(<= 0 ~__unbuffered_cnt~0), 50#L795true, 105#L811true, 97#L831true, 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 171#true, 179#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, 12#L889true, P3Thread1of1ForFork0InUse, 128#L775true, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,867 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,867 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,867 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,867 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,914 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L889-->ULTIMATE.startEXIT: Formula: (and (= |v_#valid_140| (store (store (store (store |v_#valid_141| |v_ULTIMATE.start_main_~#t121~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t122~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t123~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t124~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_#res#1_34| |v_ULTIMATE.start_#t~ret13#1_10|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~x~0_19 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EAX~0_14 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#res#1_34| 0) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|)) InVars {ULTIMATE.start_main_~#t123~0#1.base=|v_ULTIMATE.start_main_~#t123~0#1.base_41|, ULTIMATE.start_main_~#t124~0#1.base=|v_ULTIMATE.start_main_~#t124~0#1.base_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t122~0#1.base=|v_ULTIMATE.start_main_~#t122~0#1.base_45|, ULTIMATE.start_main_~#t121~0#1.base=|v_ULTIMATE.start_main_~#t121~0#1.base_41|, #valid=|v_#valid_141|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_19} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_~#t122~0#1.offset=|v_ULTIMATE.start_main_~#t122~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_~#t123~0#1.offset=|v_ULTIMATE.start_main_~#t123~0#1.offset_28|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ULTIMATE.start_main_~#t124~0#1.offset=|v_ULTIMATE.start_main_~#t124~0#1.offset_28|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #valid=|v_#valid_140|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ULTIMATE.start_main_~#t121~0#1.offset=|v_ULTIMATE.start_main_~#t121~0#1.offset_28|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x~0=v_~x~0_19, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t124~0#1.base, ULTIMATE.start_main_~#t122~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t122~0#1.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t123~0#1.offset, ULTIMATE.start_main_~#t124~0#1.offset, ULTIMATE.start_main_~#t123~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t121~0#1.base, #valid, ULTIMATE.start_main_~#t121~0#1.offset, ULTIMATE.start_#t~ret13#1][48], [164#(<= 0 ~__unbuffered_cnt~0), 3#ULTIMATE.startEXITtrue, 50#L795true, 105#L811true, 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 97#L831true, Black: 171#true, 179#(<= ~__unbuffered_cnt~0 0), 74#L765true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,914 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-08-26 21:09:56,914 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-26 21:09:56,914 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-26 21:09:56,915 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-26 21:09:56,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L889-->ULTIMATE.startEXIT: Formula: (and (= |v_#valid_140| (store (store (store (store |v_#valid_141| |v_ULTIMATE.start_main_~#t121~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t122~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t123~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t124~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_#res#1_34| |v_ULTIMATE.start_#t~ret13#1_10|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~x~0_19 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EAX~0_14 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#res#1_34| 0) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|)) InVars {ULTIMATE.start_main_~#t123~0#1.base=|v_ULTIMATE.start_main_~#t123~0#1.base_41|, ULTIMATE.start_main_~#t124~0#1.base=|v_ULTIMATE.start_main_~#t124~0#1.base_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t122~0#1.base=|v_ULTIMATE.start_main_~#t122~0#1.base_45|, ULTIMATE.start_main_~#t121~0#1.base=|v_ULTIMATE.start_main_~#t121~0#1.base_41|, #valid=|v_#valid_141|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_19} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_~#t122~0#1.offset=|v_ULTIMATE.start_main_~#t122~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_~#t123~0#1.offset=|v_ULTIMATE.start_main_~#t123~0#1.offset_28|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ULTIMATE.start_main_~#t124~0#1.offset=|v_ULTIMATE.start_main_~#t124~0#1.offset_28|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #valid=|v_#valid_140|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ULTIMATE.start_main_~#t121~0#1.offset=|v_ULTIMATE.start_main_~#t121~0#1.offset_28|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x~0=v_~x~0_19, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t124~0#1.base, ULTIMATE.start_main_~#t122~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t122~0#1.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t123~0#1.offset, ULTIMATE.start_main_~#t124~0#1.offset, ULTIMATE.start_main_~#t123~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t121~0#1.base, #valid, ULTIMATE.start_main_~#t121~0#1.offset, ULTIMATE.start_#t~ret13#1][48], [114#L768true, 164#(<= 0 ~__unbuffered_cnt~0), 3#ULTIMATE.startEXITtrue, 50#L795true, 97#L831true, 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 105#L811true, Black: 171#true, 179#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,915 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,915 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,915 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,915 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][63], [114#L768true, 164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, Black: 168#(<= ~__unbuffered_cnt~0 0), 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, 12#L889true, 180#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,936 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:09:56,936 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:56,936 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:56,936 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:56,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([599] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: (and (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_16 1) (= v_~x~0_21 2) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_26))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} OutVars{ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_23|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_23|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~main$tmp_guard1~0][64], [164#(<= 0 ~__unbuffered_cnt~0), Black: 168#(<= ~__unbuffered_cnt~0 0), 105#L811true, 97#L831true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 101#P1EXITtrue, 74#L765true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, 93#ULTIMATE.startErr0ASSERT_VIOLATIONASSERTtrue, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,937 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,937 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,937 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,937 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L889-->ULTIMATE.startEXIT: Formula: (and (= |v_#valid_140| (store (store (store (store |v_#valid_141| |v_ULTIMATE.start_main_~#t121~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t122~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t123~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t124~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_#res#1_34| |v_ULTIMATE.start_#t~ret13#1_10|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~x~0_19 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EAX~0_14 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#res#1_34| 0) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|)) InVars {ULTIMATE.start_main_~#t123~0#1.base=|v_ULTIMATE.start_main_~#t123~0#1.base_41|, ULTIMATE.start_main_~#t124~0#1.base=|v_ULTIMATE.start_main_~#t124~0#1.base_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t122~0#1.base=|v_ULTIMATE.start_main_~#t122~0#1.base_45|, ULTIMATE.start_main_~#t121~0#1.base=|v_ULTIMATE.start_main_~#t121~0#1.base_41|, #valid=|v_#valid_141|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_19} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_~#t122~0#1.offset=|v_ULTIMATE.start_main_~#t122~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_~#t123~0#1.offset=|v_ULTIMATE.start_main_~#t123~0#1.offset_28|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ULTIMATE.start_main_~#t124~0#1.offset=|v_ULTIMATE.start_main_~#t124~0#1.offset_28|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #valid=|v_#valid_140|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ULTIMATE.start_main_~#t121~0#1.offset=|v_ULTIMATE.start_main_~#t121~0#1.offset_28|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x~0=v_~x~0_19, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t124~0#1.base, ULTIMATE.start_main_~#t122~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t122~0#1.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t123~0#1.offset, ULTIMATE.start_main_~#t124~0#1.offset, ULTIMATE.start_main_~#t123~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t121~0#1.base, #valid, ULTIMATE.start_main_~#t121~0#1.offset, ULTIMATE.start_#t~ret13#1][65], [164#(<= 0 ~__unbuffered_cnt~0), 3#ULTIMATE.startEXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 105#L811true, 97#L831true, Black: 171#true, 101#P1EXITtrue, 74#L765true, P1Thread1of1ForFork1InUse, 180#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,937 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,937 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,937 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,937 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,938 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L889-->ULTIMATE.startEXIT: Formula: (and (= |v_#valid_140| (store (store (store (store |v_#valid_141| |v_ULTIMATE.start_main_~#t121~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t122~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t123~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t124~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_#res#1_34| |v_ULTIMATE.start_#t~ret13#1_10|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~x~0_19 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EAX~0_14 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#res#1_34| 0) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|)) InVars {ULTIMATE.start_main_~#t123~0#1.base=|v_ULTIMATE.start_main_~#t123~0#1.base_41|, ULTIMATE.start_main_~#t124~0#1.base=|v_ULTIMATE.start_main_~#t124~0#1.base_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t122~0#1.base=|v_ULTIMATE.start_main_~#t122~0#1.base_45|, ULTIMATE.start_main_~#t121~0#1.base=|v_ULTIMATE.start_main_~#t121~0#1.base_41|, #valid=|v_#valid_141|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_19} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_~#t122~0#1.offset=|v_ULTIMATE.start_main_~#t122~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_~#t123~0#1.offset=|v_ULTIMATE.start_main_~#t123~0#1.offset_28|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ULTIMATE.start_main_~#t124~0#1.offset=|v_ULTIMATE.start_main_~#t124~0#1.offset_28|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #valid=|v_#valid_140|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ULTIMATE.start_main_~#t121~0#1.offset=|v_ULTIMATE.start_main_~#t121~0#1.offset_28|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x~0=v_~x~0_19, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t124~0#1.base, ULTIMATE.start_main_~#t122~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t122~0#1.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t123~0#1.offset, ULTIMATE.start_main_~#t124~0#1.offset, ULTIMATE.start_main_~#t123~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t121~0#1.base, #valid, ULTIMATE.start_main_~#t121~0#1.offset, ULTIMATE.start_#t~ret13#1][62], [114#L768true, 164#(<= 0 ~__unbuffered_cnt~0), 3#ULTIMATE.startEXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 105#L811true, 97#L831true, Black: 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, 180#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,938 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:09:56,938 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:56,938 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:56,938 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:56,938 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][53], [164#(<= 0 ~__unbuffered_cnt~0), Black: 168#(<= ~__unbuffered_cnt~0 0), 97#L831true, 118#L818true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 101#P1EXITtrue, 74#L765true, P1Thread1of1ForFork1InUse, 12#L889true, P3Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,938 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,938 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,938 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,939 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][58], [164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, Black: 168#(<= ~__unbuffered_cnt~0 0), 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 101#P1EXITtrue, 74#L765true, P1Thread1of1ForFork1InUse, 12#L889true, P3Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:56,939 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,939 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,939 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:56,939 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 21:09:57,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][58], [164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, Black: 168#(<= ~__unbuffered_cnt~0 0), 50#L795true, 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 115#L881true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 121#P0EXITtrue]) [2023-08-26 21:09:57,061 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,061 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,062 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,062 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,062 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][53], [164#(<= 0 ~__unbuffered_cnt~0), Black: 168#(<= ~__unbuffered_cnt~0 0), 50#L795true, 97#L831true, 118#L818true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 115#L881true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 121#P0EXITtrue]) [2023-08-26 21:09:57,062 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,062 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,062 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,062 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([599] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: (and (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_16 1) (= v_~x~0_21 2) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_26))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} OutVars{ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_23|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_23|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~main$tmp_guard1~0][47], [164#(<= 0 ~__unbuffered_cnt~0), 50#L795true, 105#L811true, 97#L831true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 179#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 128#L775true, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, 93#ULTIMATE.startErr0ASSERT_VIOLATIONASSERTtrue, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:57,071 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,071 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,071 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,071 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,071 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L889-->ULTIMATE.startEXIT: Formula: (and (= |v_#valid_140| (store (store (store (store |v_#valid_141| |v_ULTIMATE.start_main_~#t121~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t122~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t123~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t124~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_#res#1_34| |v_ULTIMATE.start_#t~ret13#1_10|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~x~0_19 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EAX~0_14 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#res#1_34| 0) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|)) InVars {ULTIMATE.start_main_~#t123~0#1.base=|v_ULTIMATE.start_main_~#t123~0#1.base_41|, ULTIMATE.start_main_~#t124~0#1.base=|v_ULTIMATE.start_main_~#t124~0#1.base_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t122~0#1.base=|v_ULTIMATE.start_main_~#t122~0#1.base_45|, ULTIMATE.start_main_~#t121~0#1.base=|v_ULTIMATE.start_main_~#t121~0#1.base_41|, #valid=|v_#valid_141|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_19} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_~#t122~0#1.offset=|v_ULTIMATE.start_main_~#t122~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_~#t123~0#1.offset=|v_ULTIMATE.start_main_~#t123~0#1.offset_28|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ULTIMATE.start_main_~#t124~0#1.offset=|v_ULTIMATE.start_main_~#t124~0#1.offset_28|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #valid=|v_#valid_140|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ULTIMATE.start_main_~#t121~0#1.offset=|v_ULTIMATE.start_main_~#t121~0#1.offset_28|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x~0=v_~x~0_19, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t124~0#1.base, ULTIMATE.start_main_~#t122~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t122~0#1.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t123~0#1.offset, ULTIMATE.start_main_~#t124~0#1.offset, ULTIMATE.start_main_~#t123~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t121~0#1.base, #valid, ULTIMATE.start_main_~#t121~0#1.offset, ULTIMATE.start_#t~ret13#1][48], [164#(<= 0 ~__unbuffered_cnt~0), 3#ULTIMATE.startEXITtrue, 50#L795true, 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 105#L811true, 97#L831true, Black: 171#true, 179#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 128#L775true, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:57,071 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,072 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,072 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,072 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][41], [164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, 50#L795true, 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 179#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 12#L889true, 128#L775true, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:57,072 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,072 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,204 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,204 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][33], [164#(<= 0 ~__unbuffered_cnt~0), 50#L795true, 118#L818true, 97#L831true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 179#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 12#L889true, 128#L775true, 168#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:57,204 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,205 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,205 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,205 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([599] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: (and (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_16 1) (= v_~x~0_21 2) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_26))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} OutVars{ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_23|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_23|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~main$tmp_guard1~0][64], [114#L768true, 164#(<= 0 ~__unbuffered_cnt~0), Black: 168#(<= ~__unbuffered_cnt~0 0), 97#L831true, 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, 93#ULTIMATE.startErr0ASSERT_VIOLATIONASSERTtrue, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:57,236 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,236 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,236 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,237 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][58], [114#L768true, 164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, Black: 168#(<= ~__unbuffered_cnt~0 0), 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, 12#L889true, P3Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:57,237 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,237 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,237 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,237 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][53], [114#L768true, 164#(<= 0 ~__unbuffered_cnt~0), Black: 168#(<= ~__unbuffered_cnt~0 0), 97#L831true, 118#L818true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, 12#L889true, P3Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:57,237 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,237 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,237 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,238 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L768-->L775: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd1~0_14 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_25 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_117 256) 0)))) (let ((.cse2 (and .cse5 .cse1)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_105 256) 0)) .cse0)) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_118 256) 0))))) (and (= v_~a$r_buff1_thd1~0_13 (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_104 256) 0))) (and (not (= (mod v_~a$r_buff0_thd1~0_24 256) 0)) .cse1)) 0 v_~a$r_buff1_thd1~0_14)) (= v_~a$r_buff0_thd1~0_24 (ite .cse2 0 v_~a$r_buff0_thd1~0_25)) (= v_~a$w_buff1_used~0_104 (ite (or .cse3 .cse2) 0 v_~a$w_buff1_used~0_105)) (= (ite .cse4 v_~a$w_buff0~0_42 (ite .cse3 v_~a$w_buff1~0_47 v_~a~0_63)) v_~a~0_62) (= (ite .cse4 0 v_~a$w_buff0_used~0_118) v_~a$w_buff0_used~0_117)))) InVars {~a~0=v_~a~0_63, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$w_buff0~0=v_~a$w_buff0~0_42, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_14, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_118, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_105} OutVars{~a~0=v_~a~0_62, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$w_buff0~0=v_~a$w_buff0~0_42, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_13, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_117, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_24, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_104} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][32], [164#(<= 0 ~__unbuffered_cnt~0), Black: 168#(<= ~__unbuffered_cnt~0 0), 105#L811true, 97#L831true, 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, 12#L889true, 180#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, 128#L775true, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:57,253 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,253 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,253 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,253 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 21:09:57,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([599] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: (and (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_16 1) (= v_~x~0_21 2) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_26))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} OutVars{ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_23|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_23|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~main$tmp_guard1~0][64], [164#(<= 0 ~__unbuffered_cnt~0), 50#L795true, Black: 168#(<= ~__unbuffered_cnt~0 0), 105#L811true, 97#L831true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, 93#ULTIMATE.startErr0ASSERT_VIOLATIONASSERTtrue, P2Thread1of1ForFork2InUse, 121#P0EXITtrue]) [2023-08-26 21:09:57,354 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,354 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,354 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,354 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L889-->ULTIMATE.startEXIT: Formula: (and (= |v_#valid_140| (store (store (store (store |v_#valid_141| |v_ULTIMATE.start_main_~#t121~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t122~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t123~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t124~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_#res#1_34| |v_ULTIMATE.start_#t~ret13#1_10|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~x~0_19 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EAX~0_14 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#res#1_34| 0) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|)) InVars {ULTIMATE.start_main_~#t123~0#1.base=|v_ULTIMATE.start_main_~#t123~0#1.base_41|, ULTIMATE.start_main_~#t124~0#1.base=|v_ULTIMATE.start_main_~#t124~0#1.base_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t122~0#1.base=|v_ULTIMATE.start_main_~#t122~0#1.base_45|, ULTIMATE.start_main_~#t121~0#1.base=|v_ULTIMATE.start_main_~#t121~0#1.base_41|, #valid=|v_#valid_141|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_19} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_~#t122~0#1.offset=|v_ULTIMATE.start_main_~#t122~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_~#t123~0#1.offset=|v_ULTIMATE.start_main_~#t123~0#1.offset_28|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ULTIMATE.start_main_~#t124~0#1.offset=|v_ULTIMATE.start_main_~#t124~0#1.offset_28|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #valid=|v_#valid_140|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ULTIMATE.start_main_~#t121~0#1.offset=|v_ULTIMATE.start_main_~#t121~0#1.offset_28|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x~0=v_~x~0_19, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t124~0#1.base, ULTIMATE.start_main_~#t122~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t122~0#1.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t123~0#1.offset, ULTIMATE.start_main_~#t124~0#1.offset, ULTIMATE.start_main_~#t123~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t121~0#1.base, #valid, ULTIMATE.start_main_~#t121~0#1.offset, ULTIMATE.start_#t~ret13#1][65], [164#(<= 0 ~__unbuffered_cnt~0), 3#ULTIMATE.startEXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 50#L795true, 105#L811true, 97#L831true, 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 171#true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 121#P0EXITtrue]) [2023-08-26 21:09:57,355 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,355 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,355 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,355 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][58], [164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, 50#L795true, Black: 168#(<= ~__unbuffered_cnt~0 0), 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 12#L889true, 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 121#P0EXITtrue]) [2023-08-26 21:09:57,355 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,355 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,355 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,355 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,356 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][53], [164#(<= 0 ~__unbuffered_cnt~0), 50#L795true, Black: 168#(<= ~__unbuffered_cnt~0 0), 97#L831true, 118#L818true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 12#L889true, 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 121#P0EXITtrue]) [2023-08-26 21:09:57,356 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,356 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,356 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,356 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,358 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][71], [164#(<= 0 ~__unbuffered_cnt~0), Black: 168#(<= ~__unbuffered_cnt~0 0), 97#L831true, 118#L818true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 115#L881true, 177#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 121#P0EXITtrue]) [2023-08-26 21:09:57,358 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,358 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,358 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,358 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([599] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: (and (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_16 1) (= v_~x~0_21 2) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_26))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} OutVars{ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_23|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_23|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~main$tmp_guard1~0][64], [164#(<= 0 ~__unbuffered_cnt~0), Black: 168#(<= ~__unbuffered_cnt~0 0), 105#L811true, 97#L831true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, 180#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, 128#L775true, P0Thread1of1ForFork3InUse, 93#ULTIMATE.startErr0ASSERT_VIOLATIONASSERTtrue, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:57,362 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,362 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,362 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,362 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L889-->ULTIMATE.startEXIT: Formula: (and (= |v_#valid_140| (store (store (store (store |v_#valid_141| |v_ULTIMATE.start_main_~#t121~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t122~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t123~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t124~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_#res#1_34| |v_ULTIMATE.start_#t~ret13#1_10|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~x~0_19 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EAX~0_14 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#res#1_34| 0) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|)) InVars {ULTIMATE.start_main_~#t123~0#1.base=|v_ULTIMATE.start_main_~#t123~0#1.base_41|, ULTIMATE.start_main_~#t124~0#1.base=|v_ULTIMATE.start_main_~#t124~0#1.base_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t122~0#1.base=|v_ULTIMATE.start_main_~#t122~0#1.base_45|, ULTIMATE.start_main_~#t121~0#1.base=|v_ULTIMATE.start_main_~#t121~0#1.base_41|, #valid=|v_#valid_141|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_19} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_~#t122~0#1.offset=|v_ULTIMATE.start_main_~#t122~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_~#t123~0#1.offset=|v_ULTIMATE.start_main_~#t123~0#1.offset_28|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ULTIMATE.start_main_~#t124~0#1.offset=|v_ULTIMATE.start_main_~#t124~0#1.offset_28|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #valid=|v_#valid_140|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ULTIMATE.start_main_~#t121~0#1.offset=|v_ULTIMATE.start_main_~#t121~0#1.offset_28|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x~0=v_~x~0_19, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t124~0#1.base, ULTIMATE.start_main_~#t122~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t122~0#1.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t123~0#1.offset, ULTIMATE.start_main_~#t124~0#1.offset, ULTIMATE.start_main_~#t123~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t121~0#1.base, #valid, ULTIMATE.start_main_~#t121~0#1.offset, ULTIMATE.start_#t~ret13#1][65], [164#(<= 0 ~__unbuffered_cnt~0), 3#ULTIMATE.startEXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 105#L811true, 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 97#L831true, Black: 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), 128#L775true, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:57,362 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,362 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,362 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,362 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][58], [164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, Black: 168#(<= ~__unbuffered_cnt~0 0), 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 12#L889true, 180#(<= ~__unbuffered_cnt~0 1), 128#L775true, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:57,363 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,363 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,363 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,363 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][53], [164#(<= 0 ~__unbuffered_cnt~0), Black: 168#(<= ~__unbuffered_cnt~0 0), 118#L818true, 97#L831true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 12#L889true, 180#(<= ~__unbuffered_cnt~0 1), 128#L775true, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:57,363 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,363 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,363 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,363 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 21:09:57,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L889-->ULTIMATE.startEXIT: Formula: (and (= |v_#valid_140| (store (store (store (store |v_#valid_141| |v_ULTIMATE.start_main_~#t121~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t122~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t123~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t124~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_#res#1_34| |v_ULTIMATE.start_#t~ret13#1_10|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~x~0_19 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EAX~0_14 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#res#1_34| 0) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|)) InVars {ULTIMATE.start_main_~#t123~0#1.base=|v_ULTIMATE.start_main_~#t123~0#1.base_41|, ULTIMATE.start_main_~#t124~0#1.base=|v_ULTIMATE.start_main_~#t124~0#1.base_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t122~0#1.base=|v_ULTIMATE.start_main_~#t122~0#1.base_45|, ULTIMATE.start_main_~#t121~0#1.base=|v_ULTIMATE.start_main_~#t121~0#1.base_41|, #valid=|v_#valid_141|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_19} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_~#t122~0#1.offset=|v_ULTIMATE.start_main_~#t122~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_~#t123~0#1.offset=|v_ULTIMATE.start_main_~#t123~0#1.offset_28|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ULTIMATE.start_main_~#t124~0#1.offset=|v_ULTIMATE.start_main_~#t124~0#1.offset_28|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #valid=|v_#valid_140|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ULTIMATE.start_main_~#t121~0#1.offset=|v_ULTIMATE.start_main_~#t121~0#1.offset_28|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x~0=v_~x~0_19, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t124~0#1.base, ULTIMATE.start_main_~#t122~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t122~0#1.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t123~0#1.offset, ULTIMATE.start_main_~#t124~0#1.offset, ULTIMATE.start_main_~#t123~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t121~0#1.base, #valid, ULTIMATE.start_main_~#t121~0#1.offset, ULTIMATE.start_#t~ret13#1][65], [114#L768true, 164#(<= 0 ~__unbuffered_cnt~0), 3#ULTIMATE.startEXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 97#L831true, 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 105#L811true, Black: 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 180#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse]) [2023-08-26 21:09:57,369 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-08-26 21:09:57,369 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-26 21:09:57,369 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-26 21:09:57,369 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-08-26 21:09:57,453 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][82], [164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, Black: 168#(<= ~__unbuffered_cnt~0 0), 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 115#L881true, 177#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 121#P0EXITtrue]) [2023-08-26 21:09:57,454 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2023-08-26 21:09:57,454 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-26 21:09:57,454 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-26 21:09:57,454 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-26 21:09:57,489 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L889-->ULTIMATE.startEXIT: Formula: (and (= |v_#valid_140| (store (store (store (store |v_#valid_141| |v_ULTIMATE.start_main_~#t121~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t122~0#1.base_45| 0) |v_ULTIMATE.start_main_~#t123~0#1.base_41| 0) |v_ULTIMATE.start_main_~#t124~0#1.base_37| 0)) (= |v_ULTIMATE.start_main_#res#1_34| |v_ULTIMATE.start_#t~ret13#1_10|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~x~0_19 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EAX~0_14 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#res#1_34| 0) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|)) InVars {ULTIMATE.start_main_~#t123~0#1.base=|v_ULTIMATE.start_main_~#t123~0#1.base_41|, ULTIMATE.start_main_~#t124~0#1.base=|v_ULTIMATE.start_main_~#t124~0#1.base_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t122~0#1.base=|v_ULTIMATE.start_main_~#t122~0#1.base_45|, ULTIMATE.start_main_~#t121~0#1.base=|v_ULTIMATE.start_main_~#t121~0#1.base_41|, #valid=|v_#valid_141|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_19} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ULTIMATE.start_main_~#t122~0#1.offset=|v_ULTIMATE.start_main_~#t122~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_~#t123~0#1.offset=|v_ULTIMATE.start_main_~#t123~0#1.offset_28|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ULTIMATE.start_main_~#t124~0#1.offset=|v_ULTIMATE.start_main_~#t124~0#1.offset_28|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #valid=|v_#valid_140|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ULTIMATE.start_main_~#t121~0#1.offset=|v_ULTIMATE.start_main_~#t121~0#1.offset_28|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x~0=v_~x~0_19, ULTIMATE.start_#t~ret13#1=|v_ULTIMATE.start_#t~ret13#1_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t124~0#1.base, ULTIMATE.start_main_~#t122~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t122~0#1.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t123~0#1.offset, ULTIMATE.start_main_~#t124~0#1.offset, ULTIMATE.start_main_~#t123~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t121~0#1.base, #valid, ULTIMATE.start_main_~#t121~0#1.offset, ULTIMATE.start_#t~ret13#1][84], [164#(<= 0 ~__unbuffered_cnt~0), 3#ULTIMATE.startEXITtrue, Black: 168#(<= ~__unbuffered_cnt~0 0), 105#L811true, 97#L831true, 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 171#true, 177#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 121#P0EXITtrue]) [2023-08-26 21:09:57,489 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-26 21:09:57,489 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 21:09:57,489 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 21:09:57,489 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 21:09:57,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][71], [164#(<= 0 ~__unbuffered_cnt~0), Black: 168#(<= ~__unbuffered_cnt~0 0), 97#L831true, 118#L818true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 177#true, 171#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 12#L889true, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 121#P0EXITtrue]) [2023-08-26 21:09:57,490 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-26 21:09:57,490 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 21:09:57,490 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 21:09:57,490 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 21:09:57,554 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][82], [164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, Black: 168#(<= ~__unbuffered_cnt~0 0), 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 177#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, 12#L889true, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 121#P0EXITtrue]) [2023-08-26 21:09:57,554 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is not cut-off event [2023-08-26 21:09:57,554 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2023-08-26 21:09:57,555 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2023-08-26 21:09:57,555 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2023-08-26 21:09:57,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([599] L889-->ULTIMATE.startErr0ASSERT_VIOLATIONASSERT: Formula: (and (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_16 1) (= v_~x~0_21 2) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 1) (= 0 v_~__unbuffered_p3_EBX~0_26))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} OutVars{ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_23|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_23|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~main$tmp_guard1~0][83], [164#(<= 0 ~__unbuffered_cnt~0), Black: 168#(<= ~__unbuffered_cnt~0 0), 97#L831true, 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 177#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 93#ULTIMATE.startErr0ASSERT_VIOLATIONASSERTtrue, P2Thread1of1ForFork2InUse, 121#P0EXITtrue]) [2023-08-26 21:09:57,555 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is not cut-off event [2023-08-26 21:09:57,555 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2023-08-26 21:09:57,555 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2023-08-26 21:09:57,555 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2023-08-26 21:09:57,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([477] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][82], [164#(<= 0 ~__unbuffered_cnt~0), 102#L847true, Black: 168#(<= ~__unbuffered_cnt~0 0), 105#L811true, Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 171#true, 177#true, 101#P1EXITtrue, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, 93#ULTIMATE.startErr0ASSERT_VIOLATIONASSERTtrue, P2Thread1of1ForFork2InUse, 121#P0EXITtrue]) [2023-08-26 21:09:57,556 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-26 21:09:57,556 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-26 21:09:57,556 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-26 21:09:57,556 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-26 21:09:57,719 INFO L124 PetriNetUnfolderBase]: 18595/26230 cut-off events. [2023-08-26 21:09:57,719 INFO L125 PetriNetUnfolderBase]: For 11079/11778 co-relation queries the response was YES. [2023-08-26 21:09:57,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68670 conditions, 26230 events. 18595/26230 cut-off events. For 11079/11778 co-relation queries the response was YES. Maximal size of possible extension queue 1197. Compared 167241 event pairs, 4985 based on Foata normal form. 22/23829 useless extension candidates. Maximal degree in co-relation 68659. Up to 10041 conditions per place. [2023-08-26 21:09:57,873 INFO L140 encePairwiseOnDemand]: 258/267 looper letters, 73 selfloop transitions, 9 changer transitions 0/92 dead transitions. [2023-08-26 21:09:57,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 92 transitions, 495 flow [2023-08-26 21:09:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:09:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:09:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-08-26 21:09:57,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5028089887640449 [2023-08-26 21:09:57,876 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-08-26 21:09:57,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-08-26 21:09:57,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:09:57,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-08-26 21:09:57,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 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) [2023-08-26 21:09:57,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-26 21:09:57,880 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-26 21:09:57,880 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 181 flow. Second operand 4 states and 537 transitions. [2023-08-26 21:09:57,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 92 transitions, 495 flow [2023-08-26 21:09:57,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 92 transitions, 465 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:09:57,918 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 221 flow [2023-08-26 21:09:57,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2023-08-26 21:09:57,918 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-08-26 21:09:57,918 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 221 flow [2023-08-26 21:09:57,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 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) [2023-08-26 21:09:57,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:09:57,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:09:57,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:09:57,919 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:09:57,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:09:57,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1923265560, now seen corresponding path program 1 times [2023-08-26 21:09:57,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:09:57,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466895255] [2023-08-26 21:09:57,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:09:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:09:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:09:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:09:58,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:09:58,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466895255] [2023-08-26 21:09:58,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466895255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:09:58,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:09:58,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:09:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97213930] [2023-08-26 21:09:58,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:09:58,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:09:58,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:09:58,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:09:58,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:09:58,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 267 [2023-08-26 21:09:58,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 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) [2023-08-26 21:09:58,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:09:58,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 267 [2023-08-26 21:09:58,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:09:59,994 INFO L124 PetriNetUnfolderBase]: 22671/30864 cut-off events. [2023-08-26 21:09:59,994 INFO L125 PetriNetUnfolderBase]: For 25017/25017 co-relation queries the response was YES. [2023-08-26 21:10:00,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89004 conditions, 30864 events. 22671/30864 cut-off events. For 25017/25017 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 168126 event pairs, 5319 based on Foata normal form. 0/29530 useless extension candidates. Maximal degree in co-relation 88992. Up to 15361 conditions per place. [2023-08-26 21:10:00,158 INFO L140 encePairwiseOnDemand]: 257/267 looper letters, 99 selfloop transitions, 10 changer transitions 0/109 dead transitions. [2023-08-26 21:10:00,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 109 transitions, 711 flow [2023-08-26 21:10:00,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:10:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:10:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 513 transitions. [2023-08-26 21:10:00,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4803370786516854 [2023-08-26 21:10:00,160 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 513 transitions. [2023-08-26 21:10:00,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 513 transitions. [2023-08-26 21:10:00,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:00,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 513 transitions. [2023-08-26 21:10:00,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 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) [2023-08-26 21:10:00,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-26 21:10:00,165 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-26 21:10:00,165 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 221 flow. Second operand 4 states and 513 transitions. [2023-08-26 21:10:00,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 109 transitions, 711 flow [2023-08-26 21:10:00,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 109 transitions, 665 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-26 21:10:00,187 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 281 flow [2023-08-26 21:10:00,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=281, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2023-08-26 21:10:00,188 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-26 21:10:00,188 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 56 transitions, 281 flow [2023-08-26 21:10:00,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 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) [2023-08-26 21:10:00,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:00,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:10:00,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:10:00,189 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:00,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:00,189 INFO L85 PathProgramCache]: Analyzing trace with hash 641116090, now seen corresponding path program 1 times [2023-08-26 21:10:00,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:00,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297698811] [2023-08-26 21:10:00,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:00,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:00,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:10:00,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:00,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297698811] [2023-08-26 21:10:00,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297698811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:00,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:00,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:10:00,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316510315] [2023-08-26 21:10:00,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:00,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:10:00,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:00,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:10:00,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:10:00,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 267 [2023-08-26 21:10:00,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 281 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 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) [2023-08-26 21:10:00,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:00,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 267 [2023-08-26 21:10:00,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:02,347 INFO L124 PetriNetUnfolderBase]: 22334/30404 cut-off events. [2023-08-26 21:10:02,348 INFO L125 PetriNetUnfolderBase]: For 31578/31578 co-relation queries the response was YES. [2023-08-26 21:10:02,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93970 conditions, 30404 events. 22334/30404 cut-off events. For 31578/31578 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 165694 event pairs, 4845 based on Foata normal form. 48/29779 useless extension candidates. Maximal degree in co-relation 93955. Up to 18926 conditions per place. [2023-08-26 21:10:02,600 INFO L140 encePairwiseOnDemand]: 257/267 looper letters, 100 selfloop transitions, 21 changer transitions 0/121 dead transitions. [2023-08-26 21:10:02,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 121 transitions, 811 flow [2023-08-26 21:10:02,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:10:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:10:02,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2023-08-26 21:10:02,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4850187265917603 [2023-08-26 21:10:02,603 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 518 transitions. [2023-08-26 21:10:02,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 518 transitions. [2023-08-26 21:10:02,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:02,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 518 transitions. [2023-08-26 21:10:02,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 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) [2023-08-26 21:10:02,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-26 21:10:02,606 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-26 21:10:02,607 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 281 flow. Second operand 4 states and 518 transitions. [2023-08-26 21:10:02,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 121 transitions, 811 flow [2023-08-26 21:10:02,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 121 transitions, 806 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:10:02,680 INFO L231 Difference]: Finished difference. Result has 61 places, 70 transitions, 477 flow [2023-08-26 21:10:02,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=477, PETRI_PLACES=61, PETRI_TRANSITIONS=70} [2023-08-26 21:10:02,681 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-08-26 21:10:02,681 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 70 transitions, 477 flow [2023-08-26 21:10:02,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 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) [2023-08-26 21:10:02,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:02,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:10:02,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:10:02,682 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:02,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:02,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1600206618, now seen corresponding path program 1 times [2023-08-26 21:10:02,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:02,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15243847] [2023-08-26 21:10:02,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:02,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:10:02,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:02,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15243847] [2023-08-26 21:10:02,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15243847] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:02,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:02,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:10:02,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551011315] [2023-08-26 21:10:02,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:02,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:10:02,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:02,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:10:02,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:10:02,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 267 [2023-08-26 21:10:02,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 70 transitions, 477 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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) [2023-08-26 21:10:02,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:02,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 267 [2023-08-26 21:10:02,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:04,728 INFO L124 PetriNetUnfolderBase]: 17453/24603 cut-off events. [2023-08-26 21:10:04,728 INFO L125 PetriNetUnfolderBase]: For 43622/45876 co-relation queries the response was YES. [2023-08-26 21:10:04,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80517 conditions, 24603 events. 17453/24603 cut-off events. For 43622/45876 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 144599 event pairs, 5353 based on Foata normal form. 812/24110 useless extension candidates. Maximal degree in co-relation 80498. Up to 16007 conditions per place. [2023-08-26 21:10:04,890 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 78 selfloop transitions, 6 changer transitions 0/99 dead transitions. [2023-08-26 21:10:04,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 99 transitions, 819 flow [2023-08-26 21:10:04,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:10:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:10:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-26 21:10:04,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4993757802746567 [2023-08-26 21:10:04,892 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-26 21:10:04,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-26 21:10:04,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:04,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-26 21:10:04,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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) [2023-08-26 21:10:04,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-26 21:10:04,895 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-26 21:10:04,895 INFO L175 Difference]: Start difference. First operand has 61 places, 70 transitions, 477 flow. Second operand 3 states and 400 transitions. [2023-08-26 21:10:04,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 99 transitions, 819 flow [2023-08-26 21:10:05,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 99 transitions, 819 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:10:05,088 INFO L231 Difference]: Finished difference. Result has 64 places, 70 transitions, 497 flow [2023-08-26 21:10:05,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=64, PETRI_TRANSITIONS=70} [2023-08-26 21:10:05,089 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2023-08-26 21:10:05,089 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 70 transitions, 497 flow [2023-08-26 21:10:05,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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) [2023-08-26 21:10:05,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:05,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:10:05,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:10:05,089 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:05,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:05,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2102789671, now seen corresponding path program 1 times [2023-08-26 21:10:05,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:05,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359719960] [2023-08-26 21:10:05,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:05,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:10:05,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:05,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359719960] [2023-08-26 21:10:05,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359719960] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:05,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:05,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:10:05,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465696655] [2023-08-26 21:10:05,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:05,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:10:05,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:05,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:10:05,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:10:05,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-26 21:10:05,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 70 transitions, 497 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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) [2023-08-26 21:10:05,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:05,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-26 21:10:05,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:06,643 INFO L124 PetriNetUnfolderBase]: 12740/19054 cut-off events. [2023-08-26 21:10:06,644 INFO L125 PetriNetUnfolderBase]: For 28343/29962 co-relation queries the response was YES. [2023-08-26 21:10:06,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60419 conditions, 19054 events. 12740/19054 cut-off events. For 28343/29962 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 126826 event pairs, 2079 based on Foata normal form. 1834/19321 useless extension candidates. Maximal degree in co-relation 60397. Up to 9387 conditions per place. [2023-08-26 21:10:06,801 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 91 selfloop transitions, 6 changer transitions 0/117 dead transitions. [2023-08-26 21:10:06,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 117 transitions, 929 flow [2023-08-26 21:10:06,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:10:06,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:10:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 520 transitions. [2023-08-26 21:10:06,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868913857677903 [2023-08-26 21:10:06,803 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 520 transitions. [2023-08-26 21:10:06,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 520 transitions. [2023-08-26 21:10:06,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:06,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 520 transitions. [2023-08-26 21:10:06,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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) [2023-08-26 21:10:06,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-26 21:10:06,807 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-26 21:10:06,807 INFO L175 Difference]: Start difference. First operand has 64 places, 70 transitions, 497 flow. Second operand 4 states and 520 transitions. [2023-08-26 21:10:06,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 117 transitions, 929 flow [2023-08-26 21:10:06,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 117 transitions, 917 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:10:06,912 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 507 flow [2023-08-26 21:10:06,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=507, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2023-08-26 21:10:06,913 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2023-08-26 21:10:06,913 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 507 flow [2023-08-26 21:10:06,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 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) [2023-08-26 21:10:06,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:06,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:10:06,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:10:06,914 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:06,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1568688690, now seen corresponding path program 1 times [2023-08-26 21:10:06,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:06,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614423789] [2023-08-26 21:10:06,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:10:07,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:07,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614423789] [2023-08-26 21:10:07,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614423789] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:07,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:07,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:10:07,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326908733] [2023-08-26 21:10:07,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:07,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:10:07,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:07,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:10:07,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:10:07,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 267 [2023-08-26 21:10:07,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 507 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 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) [2023-08-26 21:10:07,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:07,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 267 [2023-08-26 21:10:07,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:09,874 INFO L124 PetriNetUnfolderBase]: 20120/29741 cut-off events. [2023-08-26 21:10:09,875 INFO L125 PetriNetUnfolderBase]: For 70281/71976 co-relation queries the response was YES. [2023-08-26 21:10:10,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107458 conditions, 29741 events. 20120/29741 cut-off events. For 70281/71976 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 198359 event pairs, 3431 based on Foata normal form. 1223/29237 useless extension candidates. Maximal degree in co-relation 107434. Up to 15650 conditions per place. [2023-08-26 21:10:10,166 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 123 selfloop transitions, 4 changer transitions 0/139 dead transitions. [2023-08-26 21:10:10,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 139 transitions, 1222 flow [2023-08-26 21:10:10,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:10:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:10:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 527 transitions. [2023-08-26 21:10:10,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4934456928838951 [2023-08-26 21:10:10,168 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 527 transitions. [2023-08-26 21:10:10,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 527 transitions. [2023-08-26 21:10:10,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:10,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 527 transitions. [2023-08-26 21:10:10,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 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) [2023-08-26 21:10:10,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-26 21:10:10,172 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-26 21:10:10,172 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 507 flow. Second operand 4 states and 527 transitions. [2023-08-26 21:10:10,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 139 transitions, 1222 flow [2023-08-26 21:10:10,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 139 transitions, 1206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:10:10,465 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 537 flow [2023-08-26 21:10:10,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=537, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2023-08-26 21:10:10,466 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 18 predicate places. [2023-08-26 21:10:10,466 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 537 flow [2023-08-26 21:10:10,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 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) [2023-08-26 21:10:10,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:10,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:10:10,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:10:10,467 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:10,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash 38075962, now seen corresponding path program 1 times [2023-08-26 21:10:10,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:10,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550759414] [2023-08-26 21:10:10,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:10,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:10:10,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:10,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550759414] [2023-08-26 21:10:10,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550759414] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:10,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:10,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:10:10,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504268899] [2023-08-26 21:10:10,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:10,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:10:10,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:10,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:10:10,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:10:10,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 267 [2023-08-26 21:10:10,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 537 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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) [2023-08-26 21:10:10,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:10,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 267 [2023-08-26 21:10:10,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:12,886 INFO L124 PetriNetUnfolderBase]: 16603/24711 cut-off events. [2023-08-26 21:10:12,886 INFO L125 PetriNetUnfolderBase]: For 49879/52273 co-relation queries the response was YES. [2023-08-26 21:10:12,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85693 conditions, 24711 events. 16603/24711 cut-off events. For 49879/52273 co-relation queries the response was YES. Maximal size of possible extension queue 1236. Compared 169215 event pairs, 2481 based on Foata normal form. 925/24762 useless extension candidates. Maximal degree in co-relation 85668. Up to 11043 conditions per place. [2023-08-26 21:10:13,039 INFO L140 encePairwiseOnDemand]: 258/267 looper letters, 107 selfloop transitions, 13 changer transitions 0/142 dead transitions. [2023-08-26 21:10:13,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 142 transitions, 1174 flow [2023-08-26 21:10:13,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:10:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:10:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 668 transitions. [2023-08-26 21:10:13,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500374531835206 [2023-08-26 21:10:13,040 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 668 transitions. [2023-08-26 21:10:13,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 668 transitions. [2023-08-26 21:10:13,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:13,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 668 transitions. [2023-08-26 21:10:13,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 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) [2023-08-26 21:10:13,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-26 21:10:13,044 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-26 21:10:13,044 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 537 flow. Second operand 5 states and 668 transitions. [2023-08-26 21:10:13,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 142 transitions, 1174 flow [2023-08-26 21:10:13,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 142 transitions, 1170 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:10:13,144 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 610 flow [2023-08-26 21:10:13,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=610, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2023-08-26 21:10:13,145 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2023-08-26 21:10:13,145 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 610 flow [2023-08-26 21:10:13,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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) [2023-08-26 21:10:13,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:13,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:10:13,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:10:13,145 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:13,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:13,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1337718413, now seen corresponding path program 1 times [2023-08-26 21:10:13,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:13,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322822981] [2023-08-26 21:10:13,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:13,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:10:13,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:13,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322822981] [2023-08-26 21:10:13,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322822981] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:13,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:13,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:10:13,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175417154] [2023-08-26 21:10:13,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:13,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:10:13,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:13,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:10:13,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:10:13,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 267 [2023-08-26 21:10:13,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 610 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 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) [2023-08-26 21:10:13,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:13,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 267 [2023-08-26 21:10:13,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:16,926 INFO L124 PetriNetUnfolderBase]: 27007/39886 cut-off events. [2023-08-26 21:10:16,926 INFO L125 PetriNetUnfolderBase]: For 115604/118114 co-relation queries the response was YES. [2023-08-26 21:10:17,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153937 conditions, 39886 events. 27007/39886 cut-off events. For 115604/118114 co-relation queries the response was YES. Maximal size of possible extension queue 1852. Compared 285565 event pairs, 5030 based on Foata normal form. 1258/39808 useless extension candidates. Maximal degree in co-relation 153910. Up to 20772 conditions per place. [2023-08-26 21:10:17,230 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 125 selfloop transitions, 4 changer transitions 0/145 dead transitions. [2023-08-26 21:10:17,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 145 transitions, 1341 flow [2023-08-26 21:10:17,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:10:17,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:10:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2023-08-26 21:10:17,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4953183520599251 [2023-08-26 21:10:17,232 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2023-08-26 21:10:17,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2023-08-26 21:10:17,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:17,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2023-08-26 21:10:17,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 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) [2023-08-26 21:10:17,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-26 21:10:17,235 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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) [2023-08-26 21:10:17,235 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 610 flow. Second operand 4 states and 529 transitions. [2023-08-26 21:10:17,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 145 transitions, 1341 flow [2023-08-26 21:10:18,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 145 transitions, 1251 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-26 21:10:18,818 INFO L231 Difference]: Finished difference. Result has 76 places, 78 transitions, 611 flow [2023-08-26 21:10:18,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=611, PETRI_PLACES=76, PETRI_TRANSITIONS=78} [2023-08-26 21:10:18,819 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2023-08-26 21:10:18,819 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 78 transitions, 611 flow [2023-08-26 21:10:18,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 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) [2023-08-26 21:10:18,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:18,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:10:18,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:10:18,820 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:18,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:18,820 INFO L85 PathProgramCache]: Analyzing trace with hash 106128869, now seen corresponding path program 1 times [2023-08-26 21:10:18,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:18,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541131271] [2023-08-26 21:10:18,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:18,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:10:18,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:18,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541131271] [2023-08-26 21:10:18,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541131271] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:18,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:18,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:10:18,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128717386] [2023-08-26 21:10:18,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:18,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:10:18,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:18,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:10:18,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:10:18,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-26 21:10:18,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 78 transitions, 611 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 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) [2023-08-26 21:10:18,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:18,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-26 21:10:18,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:21,576 INFO L124 PetriNetUnfolderBase]: 17577/27466 cut-off events. [2023-08-26 21:10:21,577 INFO L125 PetriNetUnfolderBase]: For 52686/54391 co-relation queries the response was YES. [2023-08-26 21:10:21,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95407 conditions, 27466 events. 17577/27466 cut-off events. For 52686/54391 co-relation queries the response was YES. Maximal size of possible extension queue 1376. Compared 208160 event pairs, 3202 based on Foata normal form. 2449/28889 useless extension candidates. Maximal degree in co-relation 95379. Up to 9230 conditions per place. [2023-08-26 21:10:21,790 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 107 selfloop transitions, 10 changer transitions 0/139 dead transitions. [2023-08-26 21:10:21,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 139 transitions, 1159 flow [2023-08-26 21:10:21,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:10:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:10:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-08-26 21:10:21,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48764044943820223 [2023-08-26 21:10:21,793 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-08-26 21:10:21,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-08-26 21:10:21,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:21,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-08-26 21:10:21,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 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) [2023-08-26 21:10:21,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-26 21:10:21,796 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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) [2023-08-26 21:10:21,797 INFO L175 Difference]: Start difference. First operand has 76 places, 78 transitions, 611 flow. Second operand 5 states and 651 transitions. [2023-08-26 21:10:21,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 139 transitions, 1159 flow [2023-08-26 21:10:22,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 139 transitions, 1155 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:10:22,920 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 610 flow [2023-08-26 21:10:22,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=610, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2023-08-26 21:10:22,920 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places. [2023-08-26 21:10:22,921 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 610 flow [2023-08-26 21:10:22,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 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) [2023-08-26 21:10:22,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:22,921 INFO L208 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] [2023-08-26 21:10:22,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:10:22,921 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:22,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:22,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1243300186, now seen corresponding path program 1 times [2023-08-26 21:10:22,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:22,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860641213] [2023-08-26 21:10:22,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:22,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:10:23,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:23,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860641213] [2023-08-26 21:10:23,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860641213] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:23,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:23,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:10:23,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563826398] [2023-08-26 21:10:23,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:23,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:10:23,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:23,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:10:23,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:10:23,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-26 21:10:23,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 610 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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) [2023-08-26 21:10:23,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:23,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-26 21:10:23,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:25,905 INFO L124 PetriNetUnfolderBase]: 15415/24145 cut-off events. [2023-08-26 21:10:25,905 INFO L125 PetriNetUnfolderBase]: For 71539/72730 co-relation queries the response was YES. [2023-08-26 21:10:26,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94074 conditions, 24145 events. 15415/24145 cut-off events. For 71539/72730 co-relation queries the response was YES. Maximal size of possible extension queue 1317. Compared 181223 event pairs, 3149 based on Foata normal form. 1160/24326 useless extension candidates. Maximal degree in co-relation 94043. Up to 9230 conditions per place. [2023-08-26 21:10:26,127 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 108 selfloop transitions, 14 changer transitions 0/144 dead transitions. [2023-08-26 21:10:26,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 144 transitions, 1203 flow [2023-08-26 21:10:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:10:26,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:10:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 780 transitions. [2023-08-26 21:10:26,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868913857677903 [2023-08-26 21:10:26,129 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 780 transitions. [2023-08-26 21:10:26,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 780 transitions. [2023-08-26 21:10:26,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:26,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 780 transitions. [2023-08-26 21:10:26,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 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) [2023-08-26 21:10:26,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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) [2023-08-26 21:10:26,132 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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) [2023-08-26 21:10:26,132 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 610 flow. Second operand 6 states and 780 transitions. [2023-08-26 21:10:26,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 144 transitions, 1203 flow [2023-08-26 21:10:27,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 144 transitions, 1154 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:10:27,580 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 607 flow [2023-08-26 21:10:27,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=607, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2023-08-26 21:10:27,581 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 32 predicate places. [2023-08-26 21:10:27,581 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 607 flow [2023-08-26 21:10:27,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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) [2023-08-26 21:10:27,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:27,582 INFO L208 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] [2023-08-26 21:10:27,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:10:27,582 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:27,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:27,583 INFO L85 PathProgramCache]: Analyzing trace with hash 929058361, now seen corresponding path program 1 times [2023-08-26 21:10:27,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:27,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245555014] [2023-08-26 21:10:27,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:27,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:10:27,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:27,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245555014] [2023-08-26 21:10:27,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245555014] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:27,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:27,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:10:27,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856378215] [2023-08-26 21:10:27,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:27,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:10:27,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:27,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:10:27,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:10:27,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 267 [2023-08-26 21:10:27,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 74 transitions, 607 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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) [2023-08-26 21:10:27,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:27,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 267 [2023-08-26 21:10:27,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:31,314 INFO L124 PetriNetUnfolderBase]: 22402/35019 cut-off events. [2023-08-26 21:10:31,315 INFO L125 PetriNetUnfolderBase]: For 133224/134257 co-relation queries the response was YES. [2023-08-26 21:10:31,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146435 conditions, 35019 events. 22402/35019 cut-off events. For 133224/134257 co-relation queries the response was YES. Maximal size of possible extension queue 1785. Compared 270946 event pairs, 8509 based on Foata normal form. 248/33505 useless extension candidates. Maximal degree in co-relation 146403. Up to 18952 conditions per place. [2023-08-26 21:10:31,599 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 87 selfloop transitions, 9 changer transitions 3/115 dead transitions. [2023-08-26 21:10:31,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 115 transitions, 1107 flow [2023-08-26 21:10:31,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:10:31,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:10:31,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-26 21:10:31,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081148564294632 [2023-08-26 21:10:31,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-26 21:10:31,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-26 21:10:31,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:31,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-26 21:10:31,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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) [2023-08-26 21:10:31,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-26 21:10:31,603 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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) [2023-08-26 21:10:31,603 INFO L175 Difference]: Start difference. First operand has 84 places, 74 transitions, 607 flow. Second operand 3 states and 407 transitions. [2023-08-26 21:10:31,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 115 transitions, 1107 flow [2023-08-26 21:10:34,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 115 transitions, 1063 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:10:34,172 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 613 flow [2023-08-26 21:10:34,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2023-08-26 21:10:34,173 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 31 predicate places. [2023-08-26 21:10:34,173 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 613 flow [2023-08-26 21:10:34,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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) [2023-08-26 21:10:34,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:34,173 INFO L208 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] [2023-08-26 21:10:34,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:10:34,173 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:34,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:34,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1384041619, now seen corresponding path program 1 times [2023-08-26 21:10:34,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:34,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209713093] [2023-08-26 21:10:34,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:34,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:34,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:10:34,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:34,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209713093] [2023-08-26 21:10:34,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209713093] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:34,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:34,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:10:34,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114770551] [2023-08-26 21:10:34,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:34,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:10:34,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:34,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:10:34,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:10:34,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-26 21:10:34,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 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) [2023-08-26 21:10:34,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:34,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-26 21:10:34,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:40,410 INFO L124 PetriNetUnfolderBase]: 33819/54881 cut-off events. [2023-08-26 21:10:40,410 INFO L125 PetriNetUnfolderBase]: For 176470/178343 co-relation queries the response was YES. [2023-08-26 21:10:40,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225958 conditions, 54881 events. 33819/54881 cut-off events. For 176470/178343 co-relation queries the response was YES. Maximal size of possible extension queue 3131. Compared 483936 event pairs, 6380 based on Foata normal form. 833/53520 useless extension candidates. Maximal degree in co-relation 225926. Up to 27315 conditions per place. [2023-08-26 21:10:40,876 INFO L140 encePairwiseOnDemand]: 259/267 looper letters, 168 selfloop transitions, 15 changer transitions 11/216 dead transitions. [2023-08-26 21:10:40,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 216 transitions, 2053 flow [2023-08-26 21:10:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:10:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:10:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 897 transitions. [2023-08-26 21:10:40,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4799357945425361 [2023-08-26 21:10:40,879 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 897 transitions. [2023-08-26 21:10:40,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 897 transitions. [2023-08-26 21:10:40,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:40,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 897 transitions. [2023-08-26 21:10:40,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.14285714285714) internal successors, (897), 7 states have internal predecessors, (897), 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) [2023-08-26 21:10:40,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 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) [2023-08-26 21:10:40,883 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 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) [2023-08-26 21:10:40,883 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 613 flow. Second operand 7 states and 897 transitions. [2023-08-26 21:10:40,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 216 transitions, 2053 flow [2023-08-26 21:10:48,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 216 transitions, 2026 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-26 21:10:48,072 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 767 flow [2023-08-26 21:10:48,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=767, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2023-08-26 21:10:48,072 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 39 predicate places. [2023-08-26 21:10:48,073 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 767 flow [2023-08-26 21:10:48,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 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) [2023-08-26 21:10:48,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:10:48,073 INFO L208 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] [2023-08-26 21:10:48,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:10:48,073 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:10:48,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:10:48,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1756323309, now seen corresponding path program 2 times [2023-08-26 21:10:48,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:10:48,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148592993] [2023-08-26 21:10:48,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:10:48,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:10:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:10:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:10:48,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:10:48,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148592993] [2023-08-26 21:10:48,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148592993] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:10:48,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:10:48,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:10:48,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705311654] [2023-08-26 21:10:48,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:10:48,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:10:48,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:10:48,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:10:48,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:10:48,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 267 [2023-08-26 21:10:48,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 767 flow. Second operand has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 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) [2023-08-26 21:10:48,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:10:48,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 267 [2023-08-26 21:10:48,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:10:56,064 INFO L124 PetriNetUnfolderBase]: 40440/66750 cut-off events. [2023-08-26 21:10:56,065 INFO L125 PetriNetUnfolderBase]: For 246739/251714 co-relation queries the response was YES. [2023-08-26 21:10:56,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306033 conditions, 66750 events. 40440/66750 cut-off events. For 246739/251714 co-relation queries the response was YES. Maximal size of possible extension queue 3729. Compared 617533 event pairs, 6785 based on Foata normal form. 1922/65655 useless extension candidates. Maximal degree in co-relation 305997. Up to 19810 conditions per place. [2023-08-26 21:10:56,683 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 172 selfloop transitions, 24 changer transitions 11/229 dead transitions. [2023-08-26 21:10:56,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 229 transitions, 2250 flow [2023-08-26 21:10:56,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:10:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:10:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 883 transitions. [2023-08-26 21:10:56,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4724451578384163 [2023-08-26 21:10:56,685 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 883 transitions. [2023-08-26 21:10:56,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 883 transitions. [2023-08-26 21:10:56,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:10:56,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 883 transitions. [2023-08-26 21:10:56,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 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) [2023-08-26 21:10:56,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 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) [2023-08-26 21:10:56,690 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 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) [2023-08-26 21:10:56,690 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 767 flow. Second operand 7 states and 883 transitions. [2023-08-26 21:10:56,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 229 transitions, 2250 flow [2023-08-26 21:11:15,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 229 transitions, 2245 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 21:11:15,588 INFO L231 Difference]: Finished difference. Result has 100 places, 104 transitions, 1005 flow [2023-08-26 21:11:15,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1005, PETRI_PLACES=100, PETRI_TRANSITIONS=104} [2023-08-26 21:11:15,588 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 48 predicate places. [2023-08-26 21:11:15,589 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 104 transitions, 1005 flow [2023-08-26 21:11:15,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 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) [2023-08-26 21:11:15,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:11:15,589 INFO L208 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] [2023-08-26 21:11:15,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:11:15,589 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:11:15,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:11:15,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1489303648, now seen corresponding path program 1 times [2023-08-26 21:11:15,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:11:15,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380241708] [2023-08-26 21:11:15,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:11:15,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:11:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:11:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:11:15,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:11:15,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380241708] [2023-08-26 21:11:15,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380241708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:11:15,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:11:15,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:11:15,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263634185] [2023-08-26 21:11:15,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:11:15,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:11:15,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:11:15,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:11:15,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:11:15,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 267 [2023-08-26 21:11:15,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 104 transitions, 1005 flow. Second operand has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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) [2023-08-26 21:11:15,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:11:15,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 267 [2023-08-26 21:11:15,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:11:23,071 INFO L124 PetriNetUnfolderBase]: 39941/64305 cut-off events. [2023-08-26 21:11:23,072 INFO L125 PetriNetUnfolderBase]: For 290081/293933 co-relation queries the response was YES. [2023-08-26 21:11:23,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313683 conditions, 64305 events. 39941/64305 cut-off events. For 290081/293933 co-relation queries the response was YES. Maximal size of possible extension queue 3878. Compared 582028 event pairs, 5143 based on Foata normal form. 2214/65014 useless extension candidates. Maximal degree in co-relation 313642. Up to 22337 conditions per place. [2023-08-26 21:11:23,561 INFO L140 encePairwiseOnDemand]: 256/267 looper letters, 69 selfloop transitions, 18 changer transitions 104/196 dead transitions. [2023-08-26 21:11:23,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 196 transitions, 2056 flow [2023-08-26 21:11:23,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:11:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:11:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 877 transitions. [2023-08-26 21:11:23,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46923488496522203 [2023-08-26 21:11:23,563 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 877 transitions. [2023-08-26 21:11:23,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 877 transitions. [2023-08-26 21:11:23,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:11:23,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 877 transitions. [2023-08-26 21:11:23,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 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) [2023-08-26 21:11:23,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 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) [2023-08-26 21:11:23,567 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 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) [2023-08-26 21:11:23,568 INFO L175 Difference]: Start difference. First operand has 100 places, 104 transitions, 1005 flow. Second operand 7 states and 877 transitions. [2023-08-26 21:11:23,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 196 transitions, 2056 flow [2023-08-26 21:12:04,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 196 transitions, 2006 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-26 21:12:04,815 INFO L231 Difference]: Finished difference. Result has 100 places, 48 transitions, 401 flow [2023-08-26 21:12:04,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=100, PETRI_TRANSITIONS=48} [2023-08-26 21:12:04,815 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 48 predicate places. [2023-08-26 21:12:04,816 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 48 transitions, 401 flow [2023-08-26 21:12:04,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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) [2023-08-26 21:12:04,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:04,816 INFO L208 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] [2023-08-26 21:12:04,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:12:04,816 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:04,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:04,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1628650101, now seen corresponding path program 1 times [2023-08-26 21:12:04,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:04,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423506156] [2023-08-26 21:12:04,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:04,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:12:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:12:05,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:12:05,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423506156] [2023-08-26 21:12:05,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423506156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:12:05,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:12:05,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:12:05,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009115146] [2023-08-26 21:12:05,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:12:05,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:12:05,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:12:05,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:12:05,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:12:05,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 267 [2023-08-26 21:12:05,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 48 transitions, 401 flow. Second operand has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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) [2023-08-26 21:12:05,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:12:05,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 267 [2023-08-26 21:12:05,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:12:06,220 INFO L124 PetriNetUnfolderBase]: 1094/1868 cut-off events. [2023-08-26 21:12:06,220 INFO L125 PetriNetUnfolderBase]: For 9234/9435 co-relation queries the response was YES. [2023-08-26 21:12:06,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9278 conditions, 1868 events. 1094/1868 cut-off events. For 9234/9435 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9801 event pairs, 135 based on Foata normal form. 47/1889 useless extension candidates. Maximal degree in co-relation 9247. Up to 820 conditions per place. [2023-08-26 21:12:06,233 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 75 selfloop transitions, 5 changer transitions 32/117 dead transitions. [2023-08-26 21:12:06,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 117 transitions, 1201 flow [2023-08-26 21:12:06,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:12:06,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:12:06,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 733 transitions. [2023-08-26 21:12:06,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4575530586766542 [2023-08-26 21:12:06,235 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 733 transitions. [2023-08-26 21:12:06,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 733 transitions. [2023-08-26 21:12:06,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:12:06,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 733 transitions. [2023-08-26 21:12:06,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 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) [2023-08-26 21:12:06,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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) [2023-08-26 21:12:06,252 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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) [2023-08-26 21:12:06,252 INFO L175 Difference]: Start difference. First operand has 100 places, 48 transitions, 401 flow. Second operand 6 states and 733 transitions. [2023-08-26 21:12:06,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 117 transitions, 1201 flow [2023-08-26 21:12:06,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 117 transitions, 677 flow, removed 81 selfloop flow, removed 34 redundant places. [2023-08-26 21:12:06,281 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 221 flow [2023-08-26 21:12:06,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2023-08-26 21:12:06,281 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2023-08-26 21:12:06,281 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 221 flow [2023-08-26 21:12:06,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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) [2023-08-26 21:12:06,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:12:06,282 INFO L208 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] [2023-08-26 21:12:06,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 21:12:06,282 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:12:06,282 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:12:06,282 INFO L85 PathProgramCache]: Analyzing trace with hash 193957161, now seen corresponding path program 2 times [2023-08-26 21:12:06,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:12:06,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387506404] [2023-08-26 21:12:06,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:12:06,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:12:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:12:06,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:12:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:12:06,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:12:06,475 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:12:06,476 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-26 21:12:06,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (21 of 23 remaining) [2023-08-26 21:12:06,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-26 21:12:06,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-26 21:12:06,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-26 21:12:06,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-26 21:12:06,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-26 21:12:06,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-26 21:12:06,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-26 21:12:06,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-26 21:12:06,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-26 21:12:06,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-26 21:12:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-26 21:12:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-26 21:12:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (8 of 23 remaining) [2023-08-26 21:12:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-26 21:12:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-26 21:12:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-26 21:12:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-26 21:12:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-26 21:12:06,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-26 21:12:06,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-26 21:12:06,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-26 21:12:06,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 21:12:06,480 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:12:06,485 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:12:06,485 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:12:06,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:12:06 BasicIcfg [2023-08-26 21:12:06,584 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:12:06,584 INFO L158 Benchmark]: Toolchain (without parser) took 145970.42ms. Allocated memory was 354.4MB in the beginning and 11.3GB in the end (delta: 11.0GB). Free memory was 329.6MB in the beginning and 7.3GB in the end (delta: -7.0GB). Peak memory consumption was 4.0GB. Max. memory is 16.0GB. [2023-08-26 21:12:06,584 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 354.4MB. Free memory is still 330.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:12:06,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.44ms. Allocated memory is still 354.4MB. Free memory was 329.1MB in the beginning and 305.0MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:12:06,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.18ms. Allocated memory is still 354.4MB. Free memory was 305.0MB in the beginning and 302.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 21:12:06,585 INFO L158 Benchmark]: Boogie Preprocessor took 49.94ms. Allocated memory is still 354.4MB. Free memory was 302.3MB in the beginning and 300.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:12:06,585 INFO L158 Benchmark]: RCFGBuilder took 671.35ms. Allocated memory is still 354.4MB. Free memory was 300.2MB in the beginning and 307.4MB in the end (delta: -7.2MB). Peak memory consumption was 24.9MB. Max. memory is 16.0GB. [2023-08-26 21:12:06,585 INFO L158 Benchmark]: TraceAbstraction took 144665.00ms. Allocated memory was 354.4MB in the beginning and 11.3GB in the end (delta: 11.0GB). Free memory was 307.4MB in the beginning and 7.3GB in the end (delta: -7.0GB). Peak memory consumption was 4.0GB. Max. memory is 16.0GB. [2023-08-26 21:12:06,586 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.12ms. Allocated memory is still 354.4MB. Free memory is still 330.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 512.44ms. Allocated memory is still 354.4MB. Free memory was 329.1MB in the beginning and 305.0MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.18ms. Allocated memory is still 354.4MB. Free memory was 305.0MB in the beginning and 302.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 49.94ms. Allocated memory is still 354.4MB. Free memory was 302.3MB in the beginning and 300.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 671.35ms. Allocated memory is still 354.4MB. Free memory was 300.2MB in the beginning and 307.4MB in the end (delta: -7.2MB). Peak memory consumption was 24.9MB. Max. memory is 16.0GB. * TraceAbstraction took 144665.00ms. Allocated memory was 354.4MB in the beginning and 11.3GB in the end (delta: 11.0GB). Free memory was 307.4MB in the beginning and 7.3GB in the end (delta: -7.0GB). Peak memory consumption was 4.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 151 PlacesBefore, 52 PlacesAfterwards, 141 TransitionsBefore, 40 TransitionsAfterwards, 4682 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 2 ChoiceCompositions, 122 TotalNumberOfCompositions, 18430 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6695, independent: 6303, independent conditional: 0, independent unconditional: 6303, dependent: 392, dependent conditional: 0, dependent unconditional: 392, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2569, independent: 2492, independent conditional: 0, independent unconditional: 2492, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6695, independent: 3811, independent conditional: 0, independent unconditional: 3811, dependent: 315, dependent conditional: 0, dependent unconditional: 315, unknown: 2569, unknown conditional: 0, unknown unconditional: 2569] , Statistics on independence cache: Total cache size (in pairs): 268, Positive cache size: 240, Positive conditional cache size: 0, Positive unconditional cache size: 240, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t121; [L872] FCALL, FORK 0 pthread_create(&t121, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t121, ((void *)0), P0, ((void *)0))=-2, t121={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t122; [L874] FCALL, FORK 0 pthread_create(&t122, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t122, ((void *)0), P1, ((void *)0))=-1, t121={5:0}, t122={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t123; [L876] FCALL, FORK 0 pthread_create(&t123, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t123, ((void *)0), P2, ((void *)0))=0, t121={5:0}, t122={6:0}, t123={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t124; [L878] FCALL, FORK 0 pthread_create(&t124, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t124, ((void *)0), P3, ((void *)0))=1, t121={5:0}, t122={6:0}, t123={7:0}, t124={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, 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=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L777] EXPR 1 __unbuffered_cnt + 1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L797] EXPR 2 __unbuffered_cnt + 1 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L820] EXPR 3 __unbuffered_cnt + 1 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] EXPR 4 __unbuffered_cnt + 1 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t121={5:0}, t122={6:0}, t123={7:0}, t124={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t121={5:0}, t122={6:0}, t123={7:0}, t124={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix005_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 190 locations, 23 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: 144.4s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 135.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 928 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 928 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2244 IncrementalHoareTripleChecker+Invalid, 2348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 23 mSDtfsCounter, 2244 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1005occurred in iteration=17, InterpolantAutomatonStates: 85, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 353 NumberOfCodeBlocks, 353 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 305 ConstructedInterpolants, 0 QuantifiedInterpolants, 1912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:12:06,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...