/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 --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 08:39:37,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 08:39:37,306 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 08:39:37,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 08:39:37,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 08:39:37,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 08:39:37,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 08:39:37,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 08:39:37,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 08:39:37,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 08:39:37,347 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 08:39:37,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 08:39:37,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 08:39:37,348 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 08:39:37,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 08:39:37,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 08:39:37,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 08:39:37,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 08:39:37,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 08:39:37,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 08:39:37,353 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 08:39:37,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 08:39:37,354 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 08:39:37,354 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 08:39:37,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 08:39:37,355 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 08:39:37,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 08:39:37,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 08:39:37,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 08:39:37,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 08:39:37,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 08:39:37,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 08:39:37,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 08:39:37,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 08:39:37,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 08:39:37,357 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.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST 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 data races in concurrent programs -> true [2023-08-26 08:39:37,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 08:39:37,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 08:39:37,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 08:39:37,668 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 08:39:37,669 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 08:39:37,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c [2023-08-26 08:39:38,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 08:39:38,985 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 08:39:38,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c [2023-08-26 08:39:38,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a13fa528c/1089a71cb3024d1cb29980e4241d89c9/FLAG17a5ee2ac [2023-08-26 08:39:39,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a13fa528c/1089a71cb3024d1cb29980e4241d89c9 [2023-08-26 08:39:39,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 08:39:39,015 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 08:39:39,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 08:39:39,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 08:39:39,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 08:39:39,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:39:39" (1/1) ... [2023-08-26 08:39:39,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2608d01e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:39:39, skipping insertion in model container [2023-08-26 08:39:39,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:39:39" (1/1) ... [2023-08-26 08:39:39,044 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 08:39:39,178 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 08:39:39,185 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 08:39:39,211 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 08:39:39,222 INFO L206 MainTranslator]: Completed translation [2023-08-26 08:39:39,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:39:39 WrapperNode [2023-08-26 08:39:39,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 08:39:39,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 08:39:39,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 08:39:39,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 08:39:39,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:39:39" (1/1) ... [2023-08-26 08:39:39,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:39:39" (1/1) ... [2023-08-26 08:39:39,280 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 329 [2023-08-26 08:39:39,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 08:39:39,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 08:39:39,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 08:39:39,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 08:39:39,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:39:39" (1/1) ... [2023-08-26 08:39:39,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:39:39" (1/1) ... [2023-08-26 08:39:39,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:39:39" (1/1) ... [2023-08-26 08:39:39,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:39:39" (1/1) ... [2023-08-26 08:39:39,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:39:39" (1/1) ... [2023-08-26 08:39:39,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:39:39" (1/1) ... [2023-08-26 08:39:39,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:39:39" (1/1) ... [2023-08-26 08:39:39,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:39:39" (1/1) ... [2023-08-26 08:39:39,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 08:39:39,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 08:39:39,329 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 08:39:39,329 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 08:39:39,330 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:39:39" (1/1) ... [2023-08-26 08:39:39,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 08:39:39,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:39:39,370 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 08:39:39,396 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 08:39:39,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 08:39:39,408 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 08:39:39,408 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 08:39:39,408 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 08:39:39,408 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 08:39:39,408 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 08:39:39,408 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 08:39:39,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 08:39:39,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 08:39:39,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 08:39:39,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 08:39:39,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 08:39:39,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 08:39:39,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 08:39:39,410 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 08:39:39,535 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 08:39:39,538 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 08:39:39,960 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 08:39:39,971 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 08:39:39,971 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 08:39:39,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:39:39 BoogieIcfgContainer [2023-08-26 08:39:39,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 08:39:39,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 08:39:39,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 08:39:39,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 08:39:39,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 08:39:39" (1/3) ... [2023-08-26 08:39:39,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebb83ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:39:39, skipping insertion in model container [2023-08-26 08:39:39,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:39:39" (2/3) ... [2023-08-26 08:39:39,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebb83ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:39:39, skipping insertion in model container [2023-08-26 08:39:39,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:39:39" (3/3) ... [2023-08-26 08:39:39,981 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2023-08-26 08:39:39,994 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 08:39:39,995 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2023-08-26 08:39:39,995 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 08:39:40,171 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-26 08:39:40,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 393 places, 404 transitions, 832 flow [2023-08-26 08:39:40,339 INFO L124 PetriNetUnfolderBase]: 21/401 cut-off events. [2023-08-26 08:39:40,339 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 08:39:40,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 401 events. 21/401 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1051 event pairs, 0 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 264. Up to 2 conditions per place. [2023-08-26 08:39:40,358 INFO L82 GeneralOperation]: Start removeDead. Operand has 393 places, 404 transitions, 832 flow [2023-08-26 08:39:40,366 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 379 places, 390 transitions, 798 flow [2023-08-26 08:39:40,369 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 08:39:40,376 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 379 places, 390 transitions, 798 flow [2023-08-26 08:39:40,378 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 379 places, 390 transitions, 798 flow [2023-08-26 08:39:40,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 379 places, 390 transitions, 798 flow [2023-08-26 08:39:40,456 INFO L124 PetriNetUnfolderBase]: 21/390 cut-off events. [2023-08-26 08:39:40,457 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 08:39:40,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 390 events. 21/390 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1043 event pairs, 0 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 264. Up to 2 conditions per place. [2023-08-26 08:39:40,483 INFO L119 LiptonReduction]: Number of co-enabled transitions 42486 [2023-08-26 08:39:48,801 INFO L134 LiptonReduction]: Checked pairs total: 158594 [2023-08-26 08:39:48,801 INFO L136 LiptonReduction]: Total number of compositions: 398 [2023-08-26 08:39:48,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 08:39:48,828 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;@2836af30, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 08:39:48,829 INFO L358 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2023-08-26 08:39:48,830 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 08:39:48,830 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 08:39:48,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 08:39:48,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:39:48,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 08:39:48,832 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:39:48,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:39:48,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1531, now seen corresponding path program 1 times [2023-08-26 08:39:48,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:39:48,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623072506] [2023-08-26 08:39:48,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:39:48,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:39:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:39:48,926 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 08:39:48,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:39:48,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623072506] [2023-08-26 08:39:48,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623072506] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:39:48,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:39:48,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 08:39:48,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249442099] [2023-08-26 08:39:48,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:39:48,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 08:39:48,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:39:48,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 08:39:48,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 08:39:48,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 802 [2023-08-26 08:39:48,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 115 transitions, 248 flow. Second operand has 2 states, 2 states have (on average 390.5) internal successors, (781), 2 states have internal predecessors, (781), 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 08:39:48,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:39:48,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 802 [2023-08-26 08:39:48,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:39:49,894 INFO L124 PetriNetUnfolderBase]: 6016/11177 cut-off events. [2023-08-26 08:39:49,895 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2023-08-26 08:39:49,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19292 conditions, 11177 events. 6016/11177 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 93389 event pairs, 3768 based on Foata normal form. 156/8411 useless extension candidates. Maximal degree in co-relation 17914. Up to 7838 conditions per place. [2023-08-26 08:39:49,965 INFO L140 encePairwiseOnDemand]: 784/802 looper letters, 49 selfloop transitions, 0 changer transitions 0/97 dead transitions. [2023-08-26 08:39:49,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 310 flow [2023-08-26 08:39:49,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 08:39:49,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 08:39:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 847 transitions. [2023-08-26 08:39:49,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5280548628428927 [2023-08-26 08:39:49,978 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 847 transitions. [2023-08-26 08:39:49,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 847 transitions. [2023-08-26 08:39:49,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:39:49,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 847 transitions. [2023-08-26 08:39:49,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 423.5) internal successors, (847), 2 states have internal predecessors, (847), 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 08:39:49,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 802.0) internal successors, (2406), 3 states have internal predecessors, (2406), 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 08:39:49,994 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 802.0) internal successors, (2406), 3 states have internal predecessors, (2406), 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 08:39:49,995 INFO L175 Difference]: Start difference. First operand has 112 places, 115 transitions, 248 flow. Second operand 2 states and 847 transitions. [2023-08-26 08:39:49,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 97 transitions, 310 flow [2023-08-26 08:39:50,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 97 transitions, 298 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-26 08:39:50,008 INFO L231 Difference]: Finished difference. Result has 90 places, 97 transitions, 200 flow [2023-08-26 08:39:50,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=200, PETRI_PLACES=90, PETRI_TRANSITIONS=97} [2023-08-26 08:39:50,013 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -22 predicate places. [2023-08-26 08:39:50,013 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 97 transitions, 200 flow [2023-08-26 08:39:50,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 390.5) internal successors, (781), 2 states have internal predecessors, (781), 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 08:39:50,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:39:50,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 08:39:50,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 08:39:50,014 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:39:50,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:39:50,015 INFO L85 PathProgramCache]: Analyzing trace with hash 47217489, now seen corresponding path program 1 times [2023-08-26 08:39:50,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:39:50,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032497506] [2023-08-26 08:39:50,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:39:50,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:39:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:39:50,112 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 08:39:50,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:39:50,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032497506] [2023-08-26 08:39:50,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032497506] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:39:50,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:39:50,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 08:39:50,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970199881] [2023-08-26 08:39:50,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:39:50,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:39:50,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:39:50,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:39:50,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:39:50,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 802 [2023-08-26 08:39:50,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 97 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 382.3333333333333) internal successors, (1147), 3 states have internal predecessors, (1147), 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 08:39:50,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:39:50,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 802 [2023-08-26 08:39:50,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:39:51,145 INFO L124 PetriNetUnfolderBase]: 7789/13525 cut-off events. [2023-08-26 08:39:51,146 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-08-26 08:39:51,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23821 conditions, 13525 events. 7789/13525 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 105929 event pairs, 1664 based on Foata normal form. 0/10631 useless extension candidates. Maximal degree in co-relation 23818. Up to 10113 conditions per place. [2023-08-26 08:39:51,294 INFO L140 encePairwiseOnDemand]: 798/802 looper letters, 69 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2023-08-26 08:39:51,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 114 transitions, 378 flow [2023-08-26 08:39:51,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:39:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:39:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1216 transitions. [2023-08-26 08:39:51,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054031587697423 [2023-08-26 08:39:51,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1216 transitions. [2023-08-26 08:39:51,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1216 transitions. [2023-08-26 08:39:51,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:39:51,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1216 transitions. [2023-08-26 08:39:51,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 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 08:39:51,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:39:51,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:39:51,312 INFO L175 Difference]: Start difference. First operand has 90 places, 97 transitions, 200 flow. Second operand 3 states and 1216 transitions. [2023-08-26 08:39:51,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 114 transitions, 378 flow [2023-08-26 08:39:51,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 114 transitions, 378 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:39:51,315 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 210 flow [2023-08-26 08:39:51,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=91, PETRI_TRANSITIONS=97} [2023-08-26 08:39:51,316 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -21 predicate places. [2023-08-26 08:39:51,317 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 97 transitions, 210 flow [2023-08-26 08:39:51,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 382.3333333333333) internal successors, (1147), 3 states have internal predecessors, (1147), 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 08:39:51,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:39:51,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 08:39:51,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 08:39:51,319 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:39:51,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:39:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1853526278, now seen corresponding path program 1 times [2023-08-26 08:39:51,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:39:51,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092433087] [2023-08-26 08:39:51,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:39:51,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:39:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:39:51,380 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 08:39:51,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:39:51,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092433087] [2023-08-26 08:39:51,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092433087] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:39:51,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:39:51,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 08:39:51,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418859734] [2023-08-26 08:39:51,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:39:51,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:39:51,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:39:51,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:39:51,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:39:51,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 802 [2023-08-26 08:39:51,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 97 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 380.0) internal successors, (1140), 3 states have internal predecessors, (1140), 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 08:39:51,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:39:51,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 802 [2023-08-26 08:39:51,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:39:52,517 INFO L124 PetriNetUnfolderBase]: 8945/16135 cut-off events. [2023-08-26 08:39:52,518 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-08-26 08:39:52,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28061 conditions, 16135 events. 8945/16135 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 133634 event pairs, 3820 based on Foata normal form. 0/12304 useless extension candidates. Maximal degree in co-relation 28057. Up to 11592 conditions per place. [2023-08-26 08:39:52,596 INFO L140 encePairwiseOnDemand]: 796/802 looper letters, 72 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2023-08-26 08:39:52,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 116 transitions, 400 flow [2023-08-26 08:39:52,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:39:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:39:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1212 transitions. [2023-08-26 08:39:52,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5037406483790524 [2023-08-26 08:39:52,600 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1212 transitions. [2023-08-26 08:39:52,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1212 transitions. [2023-08-26 08:39:52,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:39:52,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1212 transitions. [2023-08-26 08:39:52,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 404.0) internal successors, (1212), 3 states have internal predecessors, (1212), 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 08:39:52,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:39:52,609 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:39:52,609 INFO L175 Difference]: Start difference. First operand has 91 places, 97 transitions, 210 flow. Second operand 3 states and 1212 transitions. [2023-08-26 08:39:52,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 116 transitions, 400 flow [2023-08-26 08:39:52,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 116 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:39:52,612 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 225 flow [2023-08-26 08:39:52,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=91, PETRI_TRANSITIONS=97} [2023-08-26 08:39:52,613 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -21 predicate places. [2023-08-26 08:39:52,613 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 97 transitions, 225 flow [2023-08-26 08:39:52,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.0) internal successors, (1140), 3 states have internal predecessors, (1140), 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 08:39:52,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:39:52,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:39:52,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 08:39:52,614 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:39:52,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:39:52,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1172712606, now seen corresponding path program 1 times [2023-08-26 08:39:52,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:39:52,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115988957] [2023-08-26 08:39:52,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:39:52,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:39:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:39:52,667 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 08:39:52,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:39:52,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115988957] [2023-08-26 08:39:52,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115988957] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:39:52,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:39:52,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 08:39:52,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833037994] [2023-08-26 08:39:52,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:39:52,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:39:52,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:39:52,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:39:52,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:39:52,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 802 [2023-08-26 08:39:52,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 97 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 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 08:39:52,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:39:52,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 802 [2023-08-26 08:39:52,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:39:53,619 INFO L124 PetriNetUnfolderBase]: 7302/13230 cut-off events. [2023-08-26 08:39:53,619 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2023-08-26 08:39:53,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22987 conditions, 13230 events. 7302/13230 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 108796 event pairs, 1306 based on Foata normal form. 0/9782 useless extension candidates. Maximal degree in co-relation 22982. Up to 9431 conditions per place. [2023-08-26 08:39:53,679 INFO L140 encePairwiseOnDemand]: 794/802 looper letters, 67 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2023-08-26 08:39:53,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 114 transitions, 403 flow [2023-08-26 08:39:53,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:39:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:39:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1200 transitions. [2023-08-26 08:39:53,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49875311720698257 [2023-08-26 08:39:53,683 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1200 transitions. [2023-08-26 08:39:53,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1200 transitions. [2023-08-26 08:39:53,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:39:53,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1200 transitions. [2023-08-26 08:39:53,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 400.0) internal successors, (1200), 3 states have internal predecessors, (1200), 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 08:39:53,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:39:53,693 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:39:53,693 INFO L175 Difference]: Start difference. First operand has 91 places, 97 transitions, 225 flow. Second operand 3 states and 1200 transitions. [2023-08-26 08:39:53,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 114 transitions, 403 flow [2023-08-26 08:39:53,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 114 transitions, 403 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:39:53,697 INFO L231 Difference]: Finished difference. Result has 90 places, 97 transitions, 245 flow [2023-08-26 08:39:53,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=90, PETRI_TRANSITIONS=97} [2023-08-26 08:39:53,700 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -22 predicate places. [2023-08-26 08:39:53,700 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 97 transitions, 245 flow [2023-08-26 08:39:53,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 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 08:39:53,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:39:53,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:39:53,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 08:39:53,701 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:39:53,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:39:53,701 INFO L85 PathProgramCache]: Analyzing trace with hash -112841013, now seen corresponding path program 1 times [2023-08-26 08:39:53,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:39:53,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512604116] [2023-08-26 08:39:53,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:39:53,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:39:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:39:53,768 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 08:39:53,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:39:53,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512604116] [2023-08-26 08:39:53,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512604116] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:39:53,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:39:53,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 08:39:53,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963467688] [2023-08-26 08:39:53,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:39:53,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:39:53,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:39:53,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:39:53,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:39:53,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 802 [2023-08-26 08:39:53,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 97 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 383.0) internal successors, (1149), 3 states have internal predecessors, (1149), 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 08:39:53,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:39:53,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 802 [2023-08-26 08:39:53,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:39:55,014 INFO L124 PetriNetUnfolderBase]: 10718/17730 cut-off events. [2023-08-26 08:39:55,014 INFO L125 PetriNetUnfolderBase]: For 772/792 co-relation queries the response was YES. [2023-08-26 08:39:55,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33838 conditions, 17730 events. 10718/17730 cut-off events. For 772/792 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 136870 event pairs, 2154 based on Foata normal form. 1/14119 useless extension candidates. Maximal degree in co-relation 33832. Up to 10658 conditions per place. [2023-08-26 08:39:55,107 INFO L140 encePairwiseOnDemand]: 798/802 looper letters, 96 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2023-08-26 08:39:55,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 136 transitions, 544 flow [2023-08-26 08:39:55,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:39:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:39:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1235 transitions. [2023-08-26 08:39:55,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5133000831255196 [2023-08-26 08:39:55,111 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1235 transitions. [2023-08-26 08:39:55,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1235 transitions. [2023-08-26 08:39:55,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:39:55,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1235 transitions. [2023-08-26 08:39:55,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 411.6666666666667) internal successors, (1235), 3 states have internal predecessors, (1235), 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 08:39:55,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:39:55,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:39:55,121 INFO L175 Difference]: Start difference. First operand has 90 places, 97 transitions, 245 flow. Second operand 3 states and 1235 transitions. [2023-08-26 08:39:55,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 136 transitions, 544 flow [2023-08-26 08:39:55,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 136 transitions, 544 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:39:55,124 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 255 flow [2023-08-26 08:39:55,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=91, PETRI_TRANSITIONS=97} [2023-08-26 08:39:55,127 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -21 predicate places. [2023-08-26 08:39:55,127 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 97 transitions, 255 flow [2023-08-26 08:39:55,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.0) internal successors, (1149), 3 states have internal predecessors, (1149), 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 08:39:55,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:39:55,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:39:55,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 08:39:55,128 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:39:55,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:39:55,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1994366551, now seen corresponding path program 1 times [2023-08-26 08:39:55,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:39:55,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166778269] [2023-08-26 08:39:55,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:39:55,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:39:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:39:55,191 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 08:39:55,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:39:55,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166778269] [2023-08-26 08:39:55,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166778269] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:39:55,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:39:55,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 08:39:55,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797537509] [2023-08-26 08:39:55,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:39:55,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:39:55,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:39:55,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:39:55,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:39:55,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 802 [2023-08-26 08:39:55,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 97 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 384.3333333333333) internal successors, (1153), 3 states have internal predecessors, (1153), 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 08:39:55,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:39:55,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 802 [2023-08-26 08:39:55,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:39:56,070 INFO L124 PetriNetUnfolderBase]: 8362/13956 cut-off events. [2023-08-26 08:39:56,071 INFO L125 PetriNetUnfolderBase]: For 656/694 co-relation queries the response was YES. [2023-08-26 08:39:56,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26859 conditions, 13956 events. 8362/13956 cut-off events. For 656/694 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 107165 event pairs, 4114 based on Foata normal form. 0/10704 useless extension candidates. Maximal degree in co-relation 26852. Up to 8922 conditions per place. [2023-08-26 08:39:56,152 INFO L140 encePairwiseOnDemand]: 795/802 looper letters, 76 selfloop transitions, 6 changer transitions 0/125 dead transitions. [2023-08-26 08:39:56,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 125 transitions, 481 flow [2023-08-26 08:39:56,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:39:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:39:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1225 transitions. [2023-08-26 08:39:56,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5091438071487947 [2023-08-26 08:39:56,155 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1225 transitions. [2023-08-26 08:39:56,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1225 transitions. [2023-08-26 08:39:56,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:39:56,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1225 transitions. [2023-08-26 08:39:56,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 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 08:39:56,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:39:56,164 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:39:56,164 INFO L175 Difference]: Start difference. First operand has 91 places, 97 transitions, 255 flow. Second operand 3 states and 1225 transitions. [2023-08-26 08:39:56,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 125 transitions, 481 flow [2023-08-26 08:39:56,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 125 transitions, 481 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:39:56,167 INFO L231 Difference]: Finished difference. Result has 92 places, 96 transitions, 265 flow [2023-08-26 08:39:56,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=92, PETRI_TRANSITIONS=96} [2023-08-26 08:39:56,168 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -20 predicate places. [2023-08-26 08:39:56,168 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 96 transitions, 265 flow [2023-08-26 08:39:56,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 384.3333333333333) internal successors, (1153), 3 states have internal predecessors, (1153), 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 08:39:56,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:39:56,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:39:56,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 08:39:56,169 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:39:56,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:39:56,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1695451812, now seen corresponding path program 1 times [2023-08-26 08:39:56,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:39:56,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620411010] [2023-08-26 08:39:56,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:39:56,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:39:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:39:56,196 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 08:39:56,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:39:56,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620411010] [2023-08-26 08:39:56,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620411010] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:39:56,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:39:56,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 08:39:56,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722289481] [2023-08-26 08:39:56,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:39:56,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:39:56,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:39:56,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:39:56,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:39:56,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 802 [2023-08-26 08:39:56,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 96 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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 08:39:56,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:39:56,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 802 [2023-08-26 08:39:56,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:39:57,052 INFO L124 PetriNetUnfolderBase]: 9563/16422 cut-off events. [2023-08-26 08:39:57,052 INFO L125 PetriNetUnfolderBase]: For 2442/2460 co-relation queries the response was YES. [2023-08-26 08:39:57,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33068 conditions, 16422 events. 9563/16422 cut-off events. For 2442/2460 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 133260 event pairs, 1944 based on Foata normal form. 0/12884 useless extension candidates. Maximal degree in co-relation 33060. Up to 9144 conditions per place. [2023-08-26 08:39:57,146 INFO L140 encePairwiseOnDemand]: 796/802 looper letters, 91 selfloop transitions, 3 changer transitions 0/134 dead transitions. [2023-08-26 08:39:57,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 134 transitions, 560 flow [2023-08-26 08:39:57,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:39:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:39:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1223 transitions. [2023-08-26 08:39:57,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083125519534497 [2023-08-26 08:39:57,150 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1223 transitions. [2023-08-26 08:39:57,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1223 transitions. [2023-08-26 08:39:57,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:39:57,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1223 transitions. [2023-08-26 08:39:57,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 407.6666666666667) internal successors, (1223), 3 states have internal predecessors, (1223), 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 08:39:57,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:39:57,157 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:39:57,157 INFO L175 Difference]: Start difference. First operand has 92 places, 96 transitions, 265 flow. Second operand 3 states and 1223 transitions. [2023-08-26 08:39:57,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 134 transitions, 560 flow [2023-08-26 08:39:57,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 134 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 08:39:57,383 INFO L231 Difference]: Finished difference. Result has 90 places, 96 transitions, 268 flow [2023-08-26 08:39:57,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=90, PETRI_TRANSITIONS=96} [2023-08-26 08:39:57,383 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -22 predicate places. [2023-08-26 08:39:57,384 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 96 transitions, 268 flow [2023-08-26 08:39:57,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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 08:39:57,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:39:57,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:39:57,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 08:39:57,388 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:39:57,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:39:57,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1536831238, now seen corresponding path program 1 times [2023-08-26 08:39:57,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:39:57,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309346970] [2023-08-26 08:39:57,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:39:57,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:39:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:39:57,435 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 08:39:57,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:39:57,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309346970] [2023-08-26 08:39:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309346970] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:39:57,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:39:57,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 08:39:57,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981031193] [2023-08-26 08:39:57,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:39:57,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:39:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:39:57,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:39:57,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:39:57,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 802 [2023-08-26 08:39:57,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 96 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 378.0) internal successors, (1134), 3 states have internal predecessors, (1134), 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 08:39:57,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:39:57,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 802 [2023-08-26 08:39:57,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:39:58,700 INFO L124 PetriNetUnfolderBase]: 13631/21722 cut-off events. [2023-08-26 08:39:58,700 INFO L125 PetriNetUnfolderBase]: For 1773/1811 co-relation queries the response was YES. [2023-08-26 08:39:58,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44198 conditions, 21722 events. 13631/21722 cut-off events. For 1773/1811 co-relation queries the response was YES. Maximal size of possible extension queue 1046. Compared 163170 event pairs, 3215 based on Foata normal form. 0/16587 useless extension candidates. Maximal degree in co-relation 44190. Up to 12808 conditions per place. [2023-08-26 08:39:58,845 INFO L140 encePairwiseOnDemand]: 794/802 looper letters, 98 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2023-08-26 08:39:58,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 134 transitions, 575 flow [2023-08-26 08:39:58,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:39:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:39:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1221 transitions. [2023-08-26 08:39:58,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5074812967581047 [2023-08-26 08:39:58,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1221 transitions. [2023-08-26 08:39:58,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1221 transitions. [2023-08-26 08:39:58,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:39:58,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1221 transitions. [2023-08-26 08:39:58,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 407.0) internal successors, (1221), 3 states have internal predecessors, (1221), 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 08:39:58,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:39:58,856 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:39:58,857 INFO L175 Difference]: Start difference. First operand has 90 places, 96 transitions, 268 flow. Second operand 3 states and 1221 transitions. [2023-08-26 08:39:58,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 134 transitions, 575 flow [2023-08-26 08:39:58,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 134 transitions, 575 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:39:58,860 INFO L231 Difference]: Finished difference. Result has 89 places, 96 transitions, 288 flow [2023-08-26 08:39:58,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=89, PETRI_TRANSITIONS=96} [2023-08-26 08:39:58,862 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -23 predicate places. [2023-08-26 08:39:58,862 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 96 transitions, 288 flow [2023-08-26 08:39:58,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 378.0) internal successors, (1134), 3 states have internal predecessors, (1134), 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 08:39:58,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:39:58,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:39:58,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 08:39:58,863 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:39:58,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:39:58,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2080043239, now seen corresponding path program 1 times [2023-08-26 08:39:58,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:39:58,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218522064] [2023-08-26 08:39:58,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:39:58,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:39:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:39:58,899 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 08:39:58,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:39:58,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218522064] [2023-08-26 08:39:58,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218522064] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:39:58,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:39:58,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 08:39:58,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743755468] [2023-08-26 08:39:58,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:39:58,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:39:58,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:39:58,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:39:58,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:39:58,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 802 [2023-08-26 08:39:58,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 96 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 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 08:39:58,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:39:58,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 802 [2023-08-26 08:39:58,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:00,468 INFO L124 PetriNetUnfolderBase]: 16248/24789 cut-off events. [2023-08-26 08:40:00,468 INFO L125 PetriNetUnfolderBase]: For 2687/2757 co-relation queries the response was YES. [2023-08-26 08:40:00,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54026 conditions, 24789 events. 16248/24789 cut-off events. For 2687/2757 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 177944 event pairs, 6272 based on Foata normal form. 0/20409 useless extension candidates. Maximal degree in co-relation 54017. Up to 12934 conditions per place. [2023-08-26 08:40:00,618 INFO L140 encePairwiseOnDemand]: 798/802 looper letters, 114 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2023-08-26 08:40:00,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 149 transitions, 676 flow [2023-08-26 08:40:00,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:40:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:40:00,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1243 transitions. [2023-08-26 08:40:00,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166251039068994 [2023-08-26 08:40:00,621 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1243 transitions. [2023-08-26 08:40:00,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1243 transitions. [2023-08-26 08:40:00,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:00,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1243 transitions. [2023-08-26 08:40:00,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 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 08:40:00,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:00,629 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:00,629 INFO L175 Difference]: Start difference. First operand has 89 places, 96 transitions, 288 flow. Second operand 3 states and 1243 transitions. [2023-08-26 08:40:00,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 149 transitions, 676 flow [2023-08-26 08:40:00,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 149 transitions, 676 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:40:00,637 INFO L231 Difference]: Finished difference. Result has 90 places, 96 transitions, 298 flow [2023-08-26 08:40:00,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=90, PETRI_TRANSITIONS=96} [2023-08-26 08:40:00,638 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -22 predicate places. [2023-08-26 08:40:00,638 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 96 transitions, 298 flow [2023-08-26 08:40:00,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 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 08:40:00,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:00,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:40:00,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 08:40:00,639 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:00,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:00,640 INFO L85 PathProgramCache]: Analyzing trace with hash -573890627, now seen corresponding path program 1 times [2023-08-26 08:40:00,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:00,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504944228] [2023-08-26 08:40:00,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:00,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:00,662 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 08:40:00,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:00,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504944228] [2023-08-26 08:40:00,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504944228] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:00,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:00,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 08:40:00,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812788694] [2023-08-26 08:40:00,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:00,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:40:00,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:00,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:40:00,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:40:00,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 802 [2023-08-26 08:40:00,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 96 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 384.0) internal successors, (1152), 3 states have internal predecessors, (1152), 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 08:40:00,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:00,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 802 [2023-08-26 08:40:00,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:02,109 INFO L124 PetriNetUnfolderBase]: 17532/26905 cut-off events. [2023-08-26 08:40:02,109 INFO L125 PetriNetUnfolderBase]: For 3394/3464 co-relation queries the response was YES. [2023-08-26 08:40:02,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59606 conditions, 26905 events. 17532/26905 cut-off events. For 3394/3464 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 196580 event pairs, 7413 based on Foata normal form. 0/22063 useless extension candidates. Maximal degree in co-relation 59596. Up to 15065 conditions per place. [2023-08-26 08:40:02,247 INFO L140 encePairwiseOnDemand]: 798/802 looper letters, 112 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2023-08-26 08:40:02,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 147 transitions, 674 flow [2023-08-26 08:40:02,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:40:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:40:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2023-08-26 08:40:02,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.516209476309227 [2023-08-26 08:40:02,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1242 transitions. [2023-08-26 08:40:02,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1242 transitions. [2023-08-26 08:40:02,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:02,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1242 transitions. [2023-08-26 08:40:02,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 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 08:40:02,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:02,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:02,257 INFO L175 Difference]: Start difference. First operand has 90 places, 96 transitions, 298 flow. Second operand 3 states and 1242 transitions. [2023-08-26 08:40:02,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 147 transitions, 674 flow [2023-08-26 08:40:02,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 147 transitions, 674 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:40:02,263 INFO L231 Difference]: Finished difference. Result has 91 places, 96 transitions, 308 flow [2023-08-26 08:40:02,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=91, PETRI_TRANSITIONS=96} [2023-08-26 08:40:02,264 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -21 predicate places. [2023-08-26 08:40:02,264 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 96 transitions, 308 flow [2023-08-26 08:40:02,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 384.0) internal successors, (1152), 3 states have internal predecessors, (1152), 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 08:40:02,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:02,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:40:02,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 08:40:02,265 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:02,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:02,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1753045344, now seen corresponding path program 1 times [2023-08-26 08:40:02,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:02,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422626513] [2023-08-26 08:40:02,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:02,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:02,287 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 08:40:02,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:02,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422626513] [2023-08-26 08:40:02,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422626513] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:02,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:02,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 08:40:02,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982690613] [2023-08-26 08:40:02,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:02,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:40:02,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:02,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:40:02,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:40:02,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 802 [2023-08-26 08:40:02,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 96 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 384.3333333333333) internal successors, (1153), 3 states have internal predecessors, (1153), 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 08:40:02,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:02,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 802 [2023-08-26 08:40:02,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:03,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][126], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 425#(= |#race~filename_5~0| 0), 269#L77-4true, Black: 423#true, 266#L56-36true, 54#L50-38true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 399#true, Black: 433#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 438#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, 401#(= |#race~isNull_0~0| 0)]) [2023-08-26 08:40:03,689 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-26 08:40:03,689 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 08:40:03,689 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-26 08:40:03,873 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 08:40:03,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][126], [406#(= |#race~isNull_3~0| 0), Black: 414#true, 308#L44-37true, 425#(= |#race~filename_5~0| 0), 411#(= |#race~isNull_6~0| 0), Black: 423#true, 266#L56-36true, 54#L50-38true, 440#(= |#race~filename_4~0| 0), Black: 428#true, 435#(= |#race~filename_1~0| 0), 396#true, Black: 399#true, Black: 433#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 438#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 279#L78-6true, Black: 409#true, 401#(= |#race~isNull_0~0| 0)]) [2023-08-26 08:40:03,876 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:03,876 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-26 08:40:03,876 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:03,876 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:03,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][126], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 425#(= |#race~filename_5~0| 0), 269#L77-4true, 266#L56-36true, Black: 423#true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 399#true, Black: 433#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 438#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 228#thread2EXITtrue, Black: 409#true, 401#(= |#race~isNull_0~0| 0)]) [2023-08-26 08:40:03,877 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:03,877 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-26 08:40:03,877 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:03,877 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:03,878 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][126], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 425#(= |#race~filename_5~0| 0), 269#L77-4true, 66#thread3EXITtrue, Black: 423#true, 54#L50-38true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 399#true, Black: 433#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 438#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, 401#(= |#race~isNull_0~0| 0)]) [2023-08-26 08:40:03,878 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:03,878 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:03,878 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:03,878 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-26 08:40:03,879 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][126], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 414#true, 425#(= |#race~filename_5~0| 0), 411#(= |#race~isNull_6~0| 0), Black: 423#true, 266#L56-36true, 440#(= |#race~filename_4~0| 0), Black: 428#true, 435#(= |#race~filename_1~0| 0), 396#true, Black: 399#true, Black: 433#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 438#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 228#thread2EXITtrue, 279#L78-6true, Black: 409#true, 401#(= |#race~isNull_0~0| 0)]) [2023-08-26 08:40:03,879 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:03,879 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:03,880 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:03,880 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-26 08:40:03,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][126], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 414#true, 425#(= |#race~filename_5~0| 0), 411#(= |#race~isNull_6~0| 0), 66#thread3EXITtrue, Black: 423#true, 54#L50-38true, 440#(= |#race~filename_4~0| 0), Black: 428#true, 435#(= |#race~filename_1~0| 0), 396#true, Black: 399#true, Black: 433#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 438#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 279#L78-6true, Black: 409#true, 401#(= |#race~isNull_0~0| 0)]) [2023-08-26 08:40:03,880 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:03,880 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:03,880 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:03,880 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-26 08:40:03,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][126], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 425#(= |#race~filename_5~0| 0), 269#L77-4true, 66#thread3EXITtrue, Black: 423#true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 399#true, Black: 433#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 438#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 228#thread2EXITtrue, Black: 409#true, 401#(= |#race~isNull_0~0| 0)]) [2023-08-26 08:40:03,881 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:03,881 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:03,881 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-26 08:40:03,881 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:03,882 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][126], [406#(= |#race~isNull_3~0| 0), Black: 414#true, 308#L44-37true, 425#(= |#race~filename_5~0| 0), 411#(= |#race~isNull_6~0| 0), 66#thread3EXITtrue, Black: 423#true, 440#(= |#race~filename_4~0| 0), Black: 428#true, 435#(= |#race~filename_1~0| 0), 396#true, Black: 399#true, Black: 433#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 438#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 228#thread2EXITtrue, 279#L78-6true, Black: 409#true, 401#(= |#race~isNull_0~0| 0)]) [2023-08-26 08:40:03,882 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-26 08:40:03,882 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 08:40:03,882 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-26 08:40:03,882 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 08:40:03,882 INFO L124 PetriNetUnfolderBase]: 18363/27472 cut-off events. [2023-08-26 08:40:03,882 INFO L125 PetriNetUnfolderBase]: For 4092/4162 co-relation queries the response was YES. [2023-08-26 08:40:03,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62837 conditions, 27472 events. 18363/27472 cut-off events. For 4092/4162 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 191779 event pairs, 8331 based on Foata normal form. 0/22517 useless extension candidates. Maximal degree in co-relation 62826. Up to 16753 conditions per place. [2023-08-26 08:40:03,979 INFO L140 encePairwiseOnDemand]: 798/802 looper letters, 110 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2023-08-26 08:40:03,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 144 transitions, 669 flow [2023-08-26 08:40:03,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:40:03,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:40:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1241 transitions. [2023-08-26 08:40:03,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157938487115544 [2023-08-26 08:40:03,982 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1241 transitions. [2023-08-26 08:40:03,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1241 transitions. [2023-08-26 08:40:03,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:03,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1241 transitions. [2023-08-26 08:40:03,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 413.6666666666667) internal successors, (1241), 3 states have internal predecessors, (1241), 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 08:40:03,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:03,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:03,988 INFO L175 Difference]: Start difference. First operand has 91 places, 96 transitions, 308 flow. Second operand 3 states and 1241 transitions. [2023-08-26 08:40:03,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 144 transitions, 669 flow [2023-08-26 08:40:03,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 144 transitions, 669 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:40:03,995 INFO L231 Difference]: Finished difference. Result has 92 places, 96 transitions, 318 flow [2023-08-26 08:40:03,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=92, PETRI_TRANSITIONS=96} [2023-08-26 08:40:03,995 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -20 predicate places. [2023-08-26 08:40:03,995 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 96 transitions, 318 flow [2023-08-26 08:40:03,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 384.3333333333333) internal successors, (1153), 3 states have internal predecessors, (1153), 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 08:40:03,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:03,996 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] [2023-08-26 08:40:03,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 08:40:03,996 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:03,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:03,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1860358425, now seen corresponding path program 1 times [2023-08-26 08:40:03,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:03,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302143233] [2023-08-26 08:40:03,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:03,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:04,043 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 08:40:04,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:04,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302143233] [2023-08-26 08:40:04,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302143233] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:04,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:04,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:40:04,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578591748] [2023-08-26 08:40:04,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:04,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:40:04,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:04,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:40:04,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:40:04,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 802 [2023-08-26 08:40:04,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 96 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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 08:40:04,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:04,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 802 [2023-08-26 08:40:04,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:05,479 INFO L124 PetriNetUnfolderBase]: 16568/26480 cut-off events. [2023-08-26 08:40:05,479 INFO L125 PetriNetUnfolderBase]: For 3946/4022 co-relation queries the response was YES. [2023-08-26 08:40:05,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60356 conditions, 26480 events. 16568/26480 cut-off events. For 3946/4022 co-relation queries the response was YES. Maximal size of possible extension queue 1084. Compared 203116 event pairs, 7254 based on Foata normal form. 0/22442 useless extension candidates. Maximal degree in co-relation 60344. Up to 21104 conditions per place. [2023-08-26 08:40:05,675 INFO L140 encePairwiseOnDemand]: 798/802 looper letters, 89 selfloop transitions, 3 changer transitions 0/128 dead transitions. [2023-08-26 08:40:05,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 128 transitions, 592 flow [2023-08-26 08:40:05,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:40:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:40:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1232 transitions. [2023-08-26 08:40:05,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5120532003325021 [2023-08-26 08:40:05,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1232 transitions. [2023-08-26 08:40:05,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1232 transitions. [2023-08-26 08:40:05,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:05,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1232 transitions. [2023-08-26 08:40:05,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 410.6666666666667) internal successors, (1232), 3 states have internal predecessors, (1232), 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 08:40:05,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:05,683 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:05,683 INFO L175 Difference]: Start difference. First operand has 92 places, 96 transitions, 318 flow. Second operand 3 states and 1232 transitions. [2023-08-26 08:40:05,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 128 transitions, 592 flow [2023-08-26 08:40:05,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 128 transitions, 592 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:40:05,693 INFO L231 Difference]: Finished difference. Result has 96 places, 99 transitions, 353 flow [2023-08-26 08:40:05,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=353, PETRI_PLACES=96, PETRI_TRANSITIONS=99} [2023-08-26 08:40:05,693 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -16 predicate places. [2023-08-26 08:40:05,694 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 99 transitions, 353 flow [2023-08-26 08:40:05,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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 08:40:05,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:05,694 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] [2023-08-26 08:40:05,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 08:40:05,694 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:05,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:05,695 INFO L85 PathProgramCache]: Analyzing trace with hash -435446269, now seen corresponding path program 1 times [2023-08-26 08:40:05,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:05,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898062574] [2023-08-26 08:40:05,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:05,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:05,780 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 08:40:05,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:05,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898062574] [2023-08-26 08:40:05,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898062574] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:05,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:05,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 08:40:05,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476109028] [2023-08-26 08:40:05,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:05,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:40:05,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:05,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:40:05,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:40:05,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 802 [2023-08-26 08:40:05,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 99 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 394.3333333333333) internal successors, (1183), 3 states have internal predecessors, (1183), 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 08:40:05,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:05,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 802 [2023-08-26 08:40:05,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:07,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][96], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), 66#thread3EXITtrue, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 454#true, 440#(= |#race~filename_4~0| 0), 435#(= |#race~filename_1~0| 0), Black: 428#true, 396#true, Black: 433#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:07,618 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:07,618 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:07,618 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:07,618 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:07,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][96], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), 66#thread3EXITtrue, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), Black: 423#true, 454#true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:07,621 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:07,621 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:07,621 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:07,621 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:07,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][96], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), 66#thread3EXITtrue, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), 228#thread2EXITtrue, Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 454#true, 440#(= |#race~filename_4~0| 0), 435#(= |#race~filename_1~0| 0), Black: 428#true, 396#true, Black: 433#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:07,622 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:07,622 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:07,622 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:07,622 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:07,623 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][96], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), 66#thread3EXITtrue, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, 228#thread2EXITtrue, Black: 414#true, 411#(= |#race~isNull_6~0| 0), Black: 423#true, 454#true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:07,623 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-26 08:40:07,623 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 08:40:07,623 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 08:40:07,623 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 08:40:07,624 INFO L124 PetriNetUnfolderBase]: 20224/31622 cut-off events. [2023-08-26 08:40:07,624 INFO L125 PetriNetUnfolderBase]: For 7966/8052 co-relation queries the response was YES. [2023-08-26 08:40:07,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74394 conditions, 31622 events. 20224/31622 cut-off events. For 7966/8052 co-relation queries the response was YES. Maximal size of possible extension queue 1365. Compared 245489 event pairs, 11107 based on Foata normal form. 13/26958 useless extension candidates. Maximal degree in co-relation 74380. Up to 22047 conditions per place. [2023-08-26 08:40:07,803 INFO L140 encePairwiseOnDemand]: 799/802 looper letters, 89 selfloop transitions, 2 changer transitions 12/139 dead transitions. [2023-08-26 08:40:07,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 139 transitions, 684 flow [2023-08-26 08:40:07,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:40:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:40:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2023-08-26 08:40:07,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174563591022444 [2023-08-26 08:40:07,806 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1245 transitions. [2023-08-26 08:40:07,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1245 transitions. [2023-08-26 08:40:07,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:07,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1245 transitions. [2023-08-26 08:40:07,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 415.0) internal successors, (1245), 3 states have internal predecessors, (1245), 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 08:40:07,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:07,811 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:07,811 INFO L175 Difference]: Start difference. First operand has 96 places, 99 transitions, 353 flow. Second operand 3 states and 1245 transitions. [2023-08-26 08:40:07,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 139 transitions, 684 flow [2023-08-26 08:40:07,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 139 transitions, 681 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 08:40:07,825 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 358 flow [2023-08-26 08:40:07,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=98, PETRI_TRANSITIONS=99} [2023-08-26 08:40:07,826 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -14 predicate places. [2023-08-26 08:40:07,826 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 99 transitions, 358 flow [2023-08-26 08:40:07,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.3333333333333) internal successors, (1183), 3 states have internal predecessors, (1183), 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 08:40:07,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:07,827 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] [2023-08-26 08:40:07,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 08:40:07,827 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:07,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:07,827 INFO L85 PathProgramCache]: Analyzing trace with hash -210476775, now seen corresponding path program 1 times [2023-08-26 08:40:07,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:07,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447821327] [2023-08-26 08:40:07,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:07,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:07,926 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 08:40:07,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:07,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447821327] [2023-08-26 08:40:07,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447821327] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:07,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:07,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:40:07,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130193271] [2023-08-26 08:40:07,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:07,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:40:07,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:07,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:40:07,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:40:07,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 802 [2023-08-26 08:40:07,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 358 flow. Second operand has 4 states, 4 states have (on average 381.5) internal successors, (1526), 4 states have internal predecessors, (1526), 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 08:40:07,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:07,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 802 [2023-08-26 08:40:07,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:10,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][169], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 266#L56-36true, 454#true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:10,332 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-26 08:40:10,332 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 08:40:10,332 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 08:40:10,332 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 08:40:10,340 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][169], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), Black: 423#true, 266#L56-36true, 454#true, 440#(= |#race~filename_4~0| 0), Black: 428#true, 435#(= |#race~filename_1~0| 0), 396#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:10,340 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:10,340 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:10,340 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:10,340 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:10,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][169], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, 228#thread2EXITtrue, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 266#L56-36true, 454#true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:10,341 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:10,341 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:10,342 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:10,342 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:10,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][169], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 454#true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:10,342 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:10,342 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:10,342 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:10,342 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:10,346 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][169], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, 228#thread2EXITtrue, Black: 414#true, 411#(= |#race~isNull_6~0| 0), Black: 423#true, 266#L56-36true, 454#true, 440#(= |#race~filename_4~0| 0), Black: 428#true, 435#(= |#race~filename_1~0| 0), 396#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:10,346 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:10,346 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:10,346 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:10,346 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:10,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][169], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), Black: 423#true, 454#true, 440#(= |#race~filename_4~0| 0), Black: 428#true, 435#(= |#race~filename_1~0| 0), 396#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:10,347 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:10,347 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:10,347 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:10,347 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:10,348 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][169], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), 66#thread3EXITtrue, Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, 228#thread2EXITtrue, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 454#true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:10,348 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:10,348 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:10,348 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:10,348 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:10,349 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][169], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, 228#thread2EXITtrue, Black: 414#true, 411#(= |#race~isNull_6~0| 0), Black: 423#true, 454#true, 440#(= |#race~filename_4~0| 0), Black: 428#true, 435#(= |#race~filename_1~0| 0), 396#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:10,349 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-26 08:40:10,350 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 08:40:10,350 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 08:40:10,350 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 08:40:10,351 INFO L124 PetriNetUnfolderBase]: 22940/35496 cut-off events. [2023-08-26 08:40:10,351 INFO L125 PetriNetUnfolderBase]: For 10395/10501 co-relation queries the response was YES. [2023-08-26 08:40:10,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84486 conditions, 35496 events. 22940/35496 cut-off events. For 10395/10501 co-relation queries the response was YES. Maximal size of possible extension queue 1551. Compared 278350 event pairs, 5279 based on Foata normal form. 13/30842 useless extension candidates. Maximal degree in co-relation 84471. Up to 20031 conditions per place. [2023-08-26 08:40:10,583 INFO L140 encePairwiseOnDemand]: 790/802 looper letters, 136 selfloop transitions, 13 changer transitions 19/204 dead transitions. [2023-08-26 08:40:10,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 204 transitions, 1040 flow [2023-08-26 08:40:10,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:40:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:40:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2023 transitions. [2023-08-26 08:40:10,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5044887780548628 [2023-08-26 08:40:10,586 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2023 transitions. [2023-08-26 08:40:10,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2023 transitions. [2023-08-26 08:40:10,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:10,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2023 transitions. [2023-08-26 08:40:10,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 404.6) internal successors, (2023), 5 states have internal predecessors, (2023), 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 08:40:10,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 802.0) internal successors, (4812), 6 states have internal predecessors, (4812), 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 08:40:10,595 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 802.0) internal successors, (4812), 6 states have internal predecessors, (4812), 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 08:40:10,596 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 358 flow. Second operand 5 states and 2023 transitions. [2023-08-26 08:40:10,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 204 transitions, 1040 flow [2023-08-26 08:40:10,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 204 transitions, 1032 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 08:40:10,645 INFO L231 Difference]: Finished difference. Result has 103 places, 110 transitions, 436 flow [2023-08-26 08:40:10,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=436, PETRI_PLACES=103, PETRI_TRANSITIONS=110} [2023-08-26 08:40:10,645 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -9 predicate places. [2023-08-26 08:40:10,646 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 110 transitions, 436 flow [2023-08-26 08:40:10,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 381.5) internal successors, (1526), 4 states have internal predecessors, (1526), 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 08:40:10,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:10,646 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] [2023-08-26 08:40:10,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 08:40:10,647 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:10,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:10,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1705171867, now seen corresponding path program 1 times [2023-08-26 08:40:10,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:10,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901221562] [2023-08-26 08:40:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:10,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:10,693 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 08:40:10,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:10,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901221562] [2023-08-26 08:40:10,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901221562] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:10,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:10,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:40:10,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712444254] [2023-08-26 08:40:10,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:10,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:40:10,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:10,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:40:10,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:40:10,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 802 [2023-08-26 08:40:10,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 110 transitions, 436 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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 08:40:10,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:10,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 802 [2023-08-26 08:40:10,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:12,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][106], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 469#true, Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 266#L56-36true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:12,920 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-26 08:40:12,920 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 08:40:12,920 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 08:40:12,920 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-26 08:40:12,922 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][106], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), 469#true, Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 266#L56-36true, Black: 423#true, 435#(= |#race~filename_1~0| 0), Black: 428#true, 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:12,922 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:12,922 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-26 08:40:12,922 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:12,923 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:12,923 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][106], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 469#true, 228#thread2EXITtrue, Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 266#L56-36true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:12,923 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:12,923 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:12,923 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-26 08:40:12,923 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:12,924 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][106], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 469#true, Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:12,924 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:12,924 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-26 08:40:12,924 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:12,924 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:12,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][106], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), 469#true, Black: 409#true, 228#thread2EXITtrue, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 266#L56-36true, Black: 423#true, 435#(= |#race~filename_1~0| 0), Black: 428#true, 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:12,925 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:12,925 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:12,925 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:12,925 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-26 08:40:12,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][106], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), 469#true, Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), Black: 423#true, 435#(= |#race~filename_1~0| 0), Black: 428#true, 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:12,925 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:12,925 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:12,925 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:12,926 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-26 08:40:12,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][106], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 469#true, 228#thread2EXITtrue, Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:12,926 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:12,926 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:12,926 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-26 08:40:12,926 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:12,927 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][106], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), 469#true, Black: 409#true, 228#thread2EXITtrue, Black: 414#true, 411#(= |#race~isNull_6~0| 0), Black: 423#true, 435#(= |#race~filename_1~0| 0), Black: 428#true, 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:12,927 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-26 08:40:12,927 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 08:40:12,927 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 08:40:12,927 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-26 08:40:12,927 INFO L124 PetriNetUnfolderBase]: 18905/30405 cut-off events. [2023-08-26 08:40:12,927 INFO L125 PetriNetUnfolderBase]: For 11389/11475 co-relation queries the response was YES. [2023-08-26 08:40:13,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80287 conditions, 30405 events. 18905/30405 cut-off events. For 11389/11475 co-relation queries the response was YES. Maximal size of possible extension queue 1249. Compared 242046 event pairs, 13391 based on Foata normal form. 0/27408 useless extension candidates. Maximal degree in co-relation 80270. Up to 24941 conditions per place. [2023-08-26 08:40:13,226 INFO L140 encePairwiseOnDemand]: 798/802 looper letters, 106 selfloop transitions, 3 changer transitions 0/145 dead transitions. [2023-08-26 08:40:13,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 145 transitions, 785 flow [2023-08-26 08:40:13,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:40:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:40:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1230 transitions. [2023-08-26 08:40:13,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5112219451371571 [2023-08-26 08:40:13,229 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1230 transitions. [2023-08-26 08:40:13,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1230 transitions. [2023-08-26 08:40:13,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:13,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1230 transitions. [2023-08-26 08:40:13,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 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 08:40:13,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:13,234 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:13,234 INFO L175 Difference]: Start difference. First operand has 103 places, 110 transitions, 436 flow. Second operand 3 states and 1230 transitions. [2023-08-26 08:40:13,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 145 transitions, 785 flow [2023-08-26 08:40:13,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 145 transitions, 785 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:40:13,306 INFO L231 Difference]: Finished difference. Result has 107 places, 113 transitions, 477 flow [2023-08-26 08:40:13,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=477, PETRI_PLACES=107, PETRI_TRANSITIONS=113} [2023-08-26 08:40:13,307 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -5 predicate places. [2023-08-26 08:40:13,307 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 113 transitions, 477 flow [2023-08-26 08:40:13,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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 08:40:13,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:13,307 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] [2023-08-26 08:40:13,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 08:40:13,308 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:13,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:13,308 INFO L85 PathProgramCache]: Analyzing trace with hash -395335955, now seen corresponding path program 2 times [2023-08-26 08:40:13,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:13,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487827043] [2023-08-26 08:40:13,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:13,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:13,398 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 08:40:13,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:13,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487827043] [2023-08-26 08:40:13,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487827043] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:13,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:13,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:40:13,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120740447] [2023-08-26 08:40:13,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:13,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:40:13,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:13,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:40:13,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:40:13,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 802 [2023-08-26 08:40:13,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 113 transitions, 477 flow. Second operand has 4 states, 4 states have (on average 385.5) internal successors, (1542), 4 states have internal predecessors, (1542), 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 08:40:13,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:13,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 802 [2023-08-26 08:40:13,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:16,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][127], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 469#true, Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 266#L56-36true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, 475#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:16,028 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-26 08:40:16,028 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 08:40:16,029 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 08:40:16,029 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-26 08:40:16,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][127], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 469#true, Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), Black: 423#true, 266#L56-36true, Black: 428#true, 440#(= |#race~filename_4~0| 0), 435#(= |#race~filename_1~0| 0), 396#true, 475#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:16,031 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:16,031 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:16,031 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-26 08:40:16,031 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:16,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][127], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 469#true, 228#thread2EXITtrue, Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 266#L56-36true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, 475#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:16,033 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:16,033 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:16,033 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:16,033 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-26 08:40:16,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][127], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 469#true, Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, 475#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:16,033 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:16,033 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:16,034 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-26 08:40:16,034 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:16,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][127], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 469#true, Black: 409#true, 228#thread2EXITtrue, Black: 414#true, 411#(= |#race~isNull_6~0| 0), Black: 423#true, 266#L56-36true, Black: 428#true, 440#(= |#race~filename_4~0| 0), 435#(= |#race~filename_1~0| 0), 396#true, Black: 433#true, 475#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:16,035 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:16,035 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-26 08:40:16,035 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:16,035 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:16,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][127], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 469#true, Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), Black: 423#true, Black: 428#true, 440#(= |#race~filename_4~0| 0), 435#(= |#race~filename_1~0| 0), 396#true, Black: 433#true, 475#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:16,035 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:16,035 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:16,035 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:16,035 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-26 08:40:16,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][127], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 469#true, 228#thread2EXITtrue, Black: 409#true, Black: 414#true, 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, Black: 433#true, 475#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:16,037 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:16,037 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-26 08:40:16,037 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:16,037 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:16,037 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][127], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 469#true, Black: 409#true, 228#thread2EXITtrue, Black: 414#true, 411#(= |#race~isNull_6~0| 0), Black: 423#true, Black: 428#true, 440#(= |#race~filename_4~0| 0), 435#(= |#race~filename_1~0| 0), 396#true, 475#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:16,037 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-26 08:40:16,037 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-26 08:40:16,037 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 08:40:16,037 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 08:40:16,038 INFO L124 PetriNetUnfolderBase]: 24936/39700 cut-off events. [2023-08-26 08:40:16,038 INFO L125 PetriNetUnfolderBase]: For 17150/17238 co-relation queries the response was YES. [2023-08-26 08:40:16,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105401 conditions, 39700 events. 24936/39700 cut-off events. For 17150/17238 co-relation queries the response was YES. Maximal size of possible extension queue 1651. Compared 322841 event pairs, 7909 based on Foata normal form. 5/36248 useless extension candidates. Maximal degree in co-relation 105382. Up to 15494 conditions per place. [2023-08-26 08:40:16,400 INFO L140 encePairwiseOnDemand]: 793/802 looper letters, 188 selfloop transitions, 8 changer transitions 33/265 dead transitions. [2023-08-26 08:40:16,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 265 transitions, 1534 flow [2023-08-26 08:40:16,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:40:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:40:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2052 transitions. [2023-08-26 08:40:16,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117206982543641 [2023-08-26 08:40:16,404 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2052 transitions. [2023-08-26 08:40:16,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2052 transitions. [2023-08-26 08:40:16,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:16,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2052 transitions. [2023-08-26 08:40:16,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 410.4) internal successors, (2052), 5 states have internal predecessors, (2052), 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 08:40:16,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 802.0) internal successors, (4812), 6 states have internal predecessors, (4812), 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 08:40:16,412 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 802.0) internal successors, (4812), 6 states have internal predecessors, (4812), 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 08:40:16,412 INFO L175 Difference]: Start difference. First operand has 107 places, 113 transitions, 477 flow. Second operand 5 states and 2052 transitions. [2023-08-26 08:40:16,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 265 transitions, 1534 flow [2023-08-26 08:40:16,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 265 transitions, 1521 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-26 08:40:16,473 INFO L231 Difference]: Finished difference. Result has 114 places, 115 transitions, 523 flow [2023-08-26 08:40:16,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=523, PETRI_PLACES=114, PETRI_TRANSITIONS=115} [2023-08-26 08:40:16,475 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 2 predicate places. [2023-08-26 08:40:16,476 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 523 flow [2023-08-26 08:40:16,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 385.5) internal successors, (1542), 4 states have internal predecessors, (1542), 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 08:40:16,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:16,476 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] [2023-08-26 08:40:16,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 08:40:16,476 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:16,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:16,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1205695541, now seen corresponding path program 3 times [2023-08-26 08:40:16,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:16,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151895768] [2023-08-26 08:40:16,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:16,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:16,567 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 08:40:16,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:16,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151895768] [2023-08-26 08:40:16,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151895768] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:16,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:16,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:40:16,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434566841] [2023-08-26 08:40:16,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:16,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:40:16,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:16,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:40:16,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:40:16,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 802 [2023-08-26 08:40:16,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 523 flow. Second operand has 4 states, 4 states have (on average 385.5) internal successors, (1542), 4 states have internal predecessors, (1542), 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 08:40:16,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:16,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 802 [2023-08-26 08:40:16,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:19,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][132], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), Black: 480#(and (<= ~result_9~0 0) (or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0))), 269#L77-4true, Black: 423#true, 266#L56-36true, 440#(= |#race~filename_4~0| 0), Black: 428#true, 435#(= |#race~filename_1~0| 0), 396#true, 487#true, Black: 433#true, 475#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:19,446 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-26 08:40:19,446 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 08:40:19,446 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-26 08:40:19,446 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 08:40:19,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][132], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), Black: 480#(and (<= ~result_9~0 0) (or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0))), 266#L56-36true, Black: 423#true, 440#(= |#race~filename_4~0| 0), 435#(= |#race~filename_1~0| 0), Black: 428#true, 396#true, 487#true, Black: 433#true, 475#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:19,450 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:19,450 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:19,450 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-26 08:40:19,451 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:19,453 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][132], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, 228#thread2EXITtrue, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), Black: 480#(and (<= ~result_9~0 0) (or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0))), 269#L77-4true, Black: 423#true, 266#L56-36true, 440#(= |#race~filename_4~0| 0), Black: 428#true, 435#(= |#race~filename_1~0| 0), 396#true, 487#true, Black: 433#true, 475#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:19,453 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:19,453 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:19,453 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:19,453 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-26 08:40:19,454 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][132], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), Black: 480#(and (<= ~result_9~0 0) (or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0))), 269#L77-4true, Black: 423#true, 440#(= |#race~filename_4~0| 0), Black: 428#true, 435#(= |#race~filename_1~0| 0), 396#true, 487#true, Black: 433#true, 475#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:19,454 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:19,454 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-26 08:40:19,454 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:19,454 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:19,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][132], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 228#thread2EXITtrue, Black: 409#true, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), Black: 480#(and (<= ~result_9~0 0) (or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0))), 411#(= |#race~isNull_6~0| 0), 266#L56-36true, Black: 423#true, 440#(= |#race~filename_4~0| 0), 435#(= |#race~filename_1~0| 0), Black: 428#true, 396#true, 487#true, 475#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:19,456 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:19,456 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-26 08:40:19,456 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:19,456 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:19,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][132], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), Black: 480#(and (<= ~result_9~0 0) (or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0))), 411#(= |#race~isNull_6~0| 0), Black: 423#true, 440#(= |#race~filename_4~0| 0), 435#(= |#race~filename_1~0| 0), Black: 428#true, 396#true, 487#true, 475#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:19,457 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:19,457 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:19,457 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:19,457 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-26 08:40:19,458 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][132], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, 228#thread2EXITtrue, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), Black: 480#(and (<= ~result_9~0 0) (or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0))), 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 440#(= |#race~filename_4~0| 0), Black: 428#true, 435#(= |#race~filename_1~0| 0), 396#true, 487#true, 475#true, Black: 433#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:19,458 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:19,458 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:19,458 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-26 08:40:19,458 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:19,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][132], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), 228#thread2EXITtrue, Black: 409#true, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), Black: 480#(and (<= ~result_9~0 0) (or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0))), Black: 423#true, 440#(= |#race~filename_4~0| 0), 435#(= |#race~filename_1~0| 0), Black: 428#true, 396#true, 487#true, Black: 433#true, 475#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:19,459 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-26 08:40:19,459 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-26 08:40:19,459 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 08:40:19,459 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 08:40:19,460 INFO L124 PetriNetUnfolderBase]: 22516/35851 cut-off events. [2023-08-26 08:40:19,460 INFO L125 PetriNetUnfolderBase]: For 23896/23968 co-relation queries the response was YES. [2023-08-26 08:40:19,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100076 conditions, 35851 events. 22516/35851 cut-off events. For 23896/23968 co-relation queries the response was YES. Maximal size of possible extension queue 1454. Compared 287631 event pairs, 8152 based on Foata normal form. 85/33258 useless extension candidates. Maximal degree in co-relation 100054. Up to 11984 conditions per place. [2023-08-26 08:40:19,692 INFO L140 encePairwiseOnDemand]: 794/802 looper letters, 183 selfloop transitions, 11 changer transitions 25/255 dead transitions. [2023-08-26 08:40:19,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 255 transitions, 1555 flow [2023-08-26 08:40:19,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:40:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:40:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2050 transitions. [2023-08-26 08:40:19,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5112219451371571 [2023-08-26 08:40:19,696 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2050 transitions. [2023-08-26 08:40:19,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2050 transitions. [2023-08-26 08:40:19,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:19,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2050 transitions. [2023-08-26 08:40:19,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 410.0) internal successors, (2050), 5 states have internal predecessors, (2050), 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 08:40:19,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 802.0) internal successors, (4812), 6 states have internal predecessors, (4812), 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 08:40:19,703 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 802.0) internal successors, (4812), 6 states have internal predecessors, (4812), 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 08:40:19,703 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 523 flow. Second operand 5 states and 2050 transitions. [2023-08-26 08:40:19,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 255 transitions, 1555 flow [2023-08-26 08:40:19,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 255 transitions, 1529 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 08:40:19,892 INFO L231 Difference]: Finished difference. Result has 117 places, 119 transitions, 561 flow [2023-08-26 08:40:19,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=561, PETRI_PLACES=117, PETRI_TRANSITIONS=119} [2023-08-26 08:40:19,892 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 5 predicate places. [2023-08-26 08:40:19,892 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 119 transitions, 561 flow [2023-08-26 08:40:19,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 385.5) internal successors, (1542), 4 states have internal predecessors, (1542), 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 08:40:19,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:19,893 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] [2023-08-26 08:40:19,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 08:40:19,893 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:19,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:19,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1986769835, now seen corresponding path program 1 times [2023-08-26 08:40:19,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:19,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749099590] [2023-08-26 08:40:19,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:19,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:19,948 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 08:40:19,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:19,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749099590] [2023-08-26 08:40:19,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749099590] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:19,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:19,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 08:40:19,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950033567] [2023-08-26 08:40:19,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:19,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:40:19,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:19,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:40:19,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:40:19,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 802 [2023-08-26 08:40:19,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 119 transitions, 561 flow. Second operand has 3 states, 3 states have (on average 394.3333333333333) internal successors, (1183), 3 states have internal predecessors, (1183), 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 08:40:19,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:19,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 802 [2023-08-26 08:40:19,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:23,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][103], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 266#L56-36true, 496#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, 487#true, Black: 433#true, 475#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:23,494 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-26 08:40:23,495 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-26 08:40:23,495 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 08:40:23,495 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-26 08:40:23,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][103], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), 266#L56-36true, Black: 423#true, 496#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), Black: 428#true, 396#true, 487#true, 475#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:23,500 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:23,500 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:23,500 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-26 08:40:23,500 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-26 08:40:23,504 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][103], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, 228#thread2EXITtrue, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 266#L56-36true, 496#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, 487#true, Black: 433#true, 475#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:23,504 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:23,504 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-26 08:40:23,504 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-26 08:40:23,505 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:23,505 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][103], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 496#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, 487#true, Black: 433#true, 475#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:23,505 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:23,505 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:23,506 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-26 08:40:23,506 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-26 08:40:23,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][103], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, 228#thread2EXITtrue, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), 266#L56-36true, Black: 423#true, 496#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), Black: 428#true, 396#true, 487#true, 475#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:23,509 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:23,509 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-26 08:40:23,509 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-26 08:40:23,509 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:23,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][103], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), Black: 423#true, 496#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), Black: 428#true, 396#true, 487#true, 475#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:23,509 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:23,509 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-26 08:40:23,510 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:23,510 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-26 08:40:23,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][103], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, 228#thread2EXITtrue, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 496#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 396#true, 487#true, Black: 433#true, 475#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:23,511 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:23,511 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:23,511 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-26 08:40:23,511 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-26 08:40:23,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][103], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), Black: 464#(and (or (and (= ~result_10~0 0) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_10~0 1))) (= ~result_11~0 ~result_10~0)), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, 228#thread2EXITtrue, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), Black: 423#true, 496#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), Black: 428#true, 396#true, 487#true, 475#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:23,513 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-26 08:40:23,513 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-26 08:40:23,513 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 08:40:23,513 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-26 08:40:23,515 INFO L124 PetriNetUnfolderBase]: 24130/38884 cut-off events. [2023-08-26 08:40:23,515 INFO L125 PetriNetUnfolderBase]: For 28439/28778 co-relation queries the response was YES. [2023-08-26 08:40:23,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107751 conditions, 38884 events. 24130/38884 cut-off events. For 28439/28778 co-relation queries the response was YES. Maximal size of possible extension queue 1577. Compared 322148 event pairs, 15139 based on Foata normal form. 132/35891 useless extension candidates. Maximal degree in co-relation 107728. Up to 27680 conditions per place. [2023-08-26 08:40:23,783 INFO L140 encePairwiseOnDemand]: 799/802 looper letters, 103 selfloop transitions, 4 changer transitions 18/161 dead transitions. [2023-08-26 08:40:23,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 161 transitions, 995 flow [2023-08-26 08:40:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:40:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:40:23,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1244 transitions. [2023-08-26 08:40:23,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170407315045719 [2023-08-26 08:40:23,786 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1244 transitions. [2023-08-26 08:40:23,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1244 transitions. [2023-08-26 08:40:23,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:23,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1244 transitions. [2023-08-26 08:40:23,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 414.6666666666667) internal successors, (1244), 3 states have internal predecessors, (1244), 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 08:40:23,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:23,791 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:23,791 INFO L175 Difference]: Start difference. First operand has 117 places, 119 transitions, 561 flow. Second operand 3 states and 1244 transitions. [2023-08-26 08:40:23,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 161 transitions, 995 flow [2023-08-26 08:40:23,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 161 transitions, 988 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 08:40:23,874 INFO L231 Difference]: Finished difference. Result has 119 places, 118 transitions, 564 flow [2023-08-26 08:40:23,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=119, PETRI_TRANSITIONS=118} [2023-08-26 08:40:23,875 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 7 predicate places. [2023-08-26 08:40:23,875 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 118 transitions, 564 flow [2023-08-26 08:40:23,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.3333333333333) internal successors, (1183), 3 states have internal predecessors, (1183), 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 08:40:23,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:23,875 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, 1, 1, 1] [2023-08-26 08:40:23,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 08:40:23,875 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:23,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:23,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1414429078, now seen corresponding path program 1 times [2023-08-26 08:40:23,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:23,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468726630] [2023-08-26 08:40:23,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:23,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:23,914 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 08:40:23,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:23,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468726630] [2023-08-26 08:40:23,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468726630] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:23,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:23,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:40:23,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809602219] [2023-08-26 08:40:23,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:23,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:40:23,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:23,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:40:23,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:40:23,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 802 [2023-08-26 08:40:23,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 118 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 391.0) internal successors, (1173), 3 states have internal predecessors, (1173), 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 08:40:23,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:23,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 802 [2023-08-26 08:40:23,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:26,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][107], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 496#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), 440#(= |#race~filename_4~0| 0), Black: 428#true, 435#(= |#race~filename_1~0| 0), 503#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 396#true, Black: 498#(<= (+ ~result_10~0 1) 0), 487#true, Black: 433#true, 475#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:26,621 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:26,621 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:26,621 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-26 08:40:26,621 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:26,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][107], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), Black: 423#true, 496#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 503#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 396#true, 487#true, Black: 498#(<= (+ ~result_10~0 1) 0), 475#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:26,627 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:26,627 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:26,627 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-26 08:40:26,627 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:26,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][107], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), 228#thread2EXITtrue, Black: 409#true, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 496#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), 440#(= |#race~filename_4~0| 0), 435#(= |#race~filename_1~0| 0), Black: 428#true, 503#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 396#true, Black: 498#(<= (+ ~result_10~0 1) 0), 487#true, Black: 433#true, 475#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:26,631 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:26,631 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:26,631 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-26 08:40:26,631 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:26,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][107], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), 269#L77-4true, 266#L56-36true, Black: 423#true, 496#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), 440#(= |#race~filename_4~0| 0), 435#(= |#race~filename_1~0| 0), Black: 428#true, 503#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 396#true, Black: 498#(<= (+ ~result_10~0 1) 0), 487#true, Black: 433#true, 475#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:26,632 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-26 08:40:26,632 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-26 08:40:26,632 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-26 08:40:26,632 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 08:40:26,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][107], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), 228#thread2EXITtrue, Black: 409#true, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), Black: 423#true, 496#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 503#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 396#true, Black: 498#(<= (+ ~result_10~0 1) 0), 487#true, 475#true, Black: 433#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:26,635 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-26 08:40:26,635 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 08:40:26,635 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-26 08:40:26,635 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 08:40:26,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][107], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), 266#L56-36true, Black: 423#true, 496#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 503#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 396#true, Black: 498#(<= (+ ~result_10~0 1) 0), 487#true, Black: 433#true, 475#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:26,637 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:26,637 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:26,637 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-26 08:40:26,637 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-26 08:40:26,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][107], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 399#true, Black: 462#(= ~result_11~0 ~result_10~0), 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, 228#thread2EXITtrue, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), 269#L77-4true, 266#L56-36true, Black: 423#true, 496#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), 440#(= |#race~filename_4~0| 0), 435#(= |#race~filename_1~0| 0), Black: 428#true, 503#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 396#true, Black: 498#(<= (+ ~result_10~0 1) 0), 487#true, Black: 433#true, 475#true, Black: 438#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:26,640 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:26,641 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-26 08:40:26,641 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-26 08:40:26,641 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 08:40:26,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][107], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), 228#thread2EXITtrue, Black: 409#true, Black: 414#true, Black: 477#(or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= ~result_9~0 0)), Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), 266#L56-36true, Black: 423#true, 496#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 503#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 396#true, Black: 498#(<= (+ ~result_10~0 1) 0), 487#true, Black: 433#true, 475#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:26,643 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:26,643 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-26 08:40:26,643 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-26 08:40:26,643 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 08:40:26,646 INFO L124 PetriNetUnfolderBase]: 19143/31410 cut-off events. [2023-08-26 08:40:26,646 INFO L125 PetriNetUnfolderBase]: For 29127/29165 co-relation queries the response was YES. [2023-08-26 08:40:26,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87011 conditions, 31410 events. 19143/31410 cut-off events. For 29127/29165 co-relation queries the response was YES. Maximal size of possible extension queue 1220. Compared 255908 event pairs, 9585 based on Foata normal form. 724/29741 useless extension candidates. Maximal degree in co-relation 86987. Up to 26695 conditions per place. [2023-08-26 08:40:26,996 INFO L140 encePairwiseOnDemand]: 798/802 looper letters, 100 selfloop transitions, 3 changer transitions 11/150 dead transitions. [2023-08-26 08:40:26,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 150 transitions, 928 flow [2023-08-26 08:40:26,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:40:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:40:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1226 transitions. [2023-08-26 08:40:26,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095594347464671 [2023-08-26 08:40:26,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1226 transitions. [2023-08-26 08:40:26,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1226 transitions. [2023-08-26 08:40:26,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:26,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1226 transitions. [2023-08-26 08:40:27,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 408.6666666666667) internal successors, (1226), 3 states have internal predecessors, (1226), 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 08:40:27,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:27,002 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:27,002 INFO L175 Difference]: Start difference. First operand has 119 places, 118 transitions, 564 flow. Second operand 3 states and 1226 transitions. [2023-08-26 08:40:27,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 150 transitions, 928 flow [2023-08-26 08:40:27,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 150 transitions, 913 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-26 08:40:27,218 INFO L231 Difference]: Finished difference. Result has 118 places, 115 transitions, 556 flow [2023-08-26 08:40:27,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=118, PETRI_TRANSITIONS=115} [2023-08-26 08:40:27,218 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 6 predicate places. [2023-08-26 08:40:27,219 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 115 transitions, 556 flow [2023-08-26 08:40:27,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.0) internal successors, (1173), 3 states have internal predecessors, (1173), 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 08:40:27,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:27,219 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, 1, 1, 1] [2023-08-26 08:40:27,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 08:40:27,219 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:27,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:27,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1103025317, now seen corresponding path program 1 times [2023-08-26 08:40:27,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:27,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196627186] [2023-08-26 08:40:27,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:27,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:27,287 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 08:40:27,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:27,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196627186] [2023-08-26 08:40:27,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196627186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:27,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:27,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:40:27,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648175807] [2023-08-26 08:40:27,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:27,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:40:27,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:27,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:40:27,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:40:27,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 802 [2023-08-26 08:40:27,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 115 transitions, 556 flow. Second operand has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 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 08:40:27,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:27,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 802 [2023-08-26 08:40:27,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:29,851 INFO L124 PetriNetUnfolderBase]: 18427/32106 cut-off events. [2023-08-26 08:40:29,851 INFO L125 PetriNetUnfolderBase]: For 23056/23102 co-relation queries the response was YES. [2023-08-26 08:40:29,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86354 conditions, 32106 events. 18427/32106 cut-off events. For 23056/23102 co-relation queries the response was YES. Maximal size of possible extension queue 1227. Compared 279288 event pairs, 5094 based on Foata normal form. 868/30599 useless extension candidates. Maximal degree in co-relation 86331. Up to 23164 conditions per place. [2023-08-26 08:40:30,038 INFO L140 encePairwiseOnDemand]: 796/802 looper letters, 116 selfloop transitions, 5 changer transitions 13/170 dead transitions. [2023-08-26 08:40:30,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 170 transitions, 1069 flow [2023-08-26 08:40:30,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 08:40:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 08:40:30,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1613 transitions. [2023-08-26 08:40:30,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5028054862842892 [2023-08-26 08:40:30,042 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1613 transitions. [2023-08-26 08:40:30,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1613 transitions. [2023-08-26 08:40:30,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:30,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1613 transitions. [2023-08-26 08:40:30,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 403.25) internal successors, (1613), 4 states have internal predecessors, (1613), 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 08:40:30,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 802.0) internal successors, (4010), 5 states have internal predecessors, (4010), 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 08:40:30,046 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 802.0) internal successors, (4010), 5 states have internal predecessors, (4010), 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 08:40:30,046 INFO L175 Difference]: Start difference. First operand has 118 places, 115 transitions, 556 flow. Second operand 4 states and 1613 transitions. [2023-08-26 08:40:30,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 170 transitions, 1069 flow [2023-08-26 08:40:30,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 170 transitions, 1060 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 08:40:30,158 INFO L231 Difference]: Finished difference. Result has 122 places, 120 transitions, 611 flow [2023-08-26 08:40:30,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=611, PETRI_PLACES=122, PETRI_TRANSITIONS=120} [2023-08-26 08:40:30,159 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 10 predicate places. [2023-08-26 08:40:30,159 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 120 transitions, 611 flow [2023-08-26 08:40:30,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 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 08:40:30,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:30,160 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, 1, 1, 1] [2023-08-26 08:40:30,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 08:40:30,160 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:30,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:30,160 INFO L85 PathProgramCache]: Analyzing trace with hash 628105235, now seen corresponding path program 2 times [2023-08-26 08:40:30,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:30,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489257195] [2023-08-26 08:40:30,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:30,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:30,237 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 08:40:30,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:30,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489257195] [2023-08-26 08:40:30,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489257195] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:30,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:30,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:40:30,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513059842] [2023-08-26 08:40:30,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:30,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:40:30,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:30,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:40:30,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:40:30,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 802 [2023-08-26 08:40:30,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 120 transitions, 611 flow. Second operand has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 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 08:40:30,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:30,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 802 [2023-08-26 08:40:30,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:33,455 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][107], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 507#true, Black: 512#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 ~result_11~0)), Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, Black: 414#true, Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 266#L56-36true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), 440#(= |#race~filename_4~0| 0), 435#(= |#race~filename_1~0| 0), Black: 428#true, 503#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 396#true, Black: 498#(<= (+ ~result_10~0 1) 0), Black: 433#true, 475#true, 509#(= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))), 518#true, Black: 438#true, Black: 501#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:33,455 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-26 08:40:33,455 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-26 08:40:33,455 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-26 08:40:33,455 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-26 08:40:33,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][107], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 507#true, Black: 512#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 ~result_11~0)), Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, Black: 414#true, Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), Black: 423#true, 266#L56-36true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 503#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 396#true, Black: 498#(<= (+ ~result_10~0 1) 0), Black: 433#true, 475#true, 509#(= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))), 518#true, Black: 501#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:33,477 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:33,477 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-26 08:40:33,477 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-26 08:40:33,478 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-26 08:40:33,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][107], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 507#true, Black: 512#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 ~result_11~0)), Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, 228#thread2EXITtrue, Black: 414#true, Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, 266#L56-36true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), 440#(= |#race~filename_4~0| 0), 435#(= |#race~filename_1~0| 0), Black: 428#true, 503#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 396#true, Black: 498#(<= (+ ~result_10~0 1) 0), Black: 433#true, 475#true, 509#(= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))), 518#true, Black: 438#true, Black: 501#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:33,481 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:33,481 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-26 08:40:33,481 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-26 08:40:33,481 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-26 08:40:33,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][107], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 507#true, Black: 512#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 ~result_11~0)), Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, Black: 414#true, Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), 440#(= |#race~filename_4~0| 0), 435#(= |#race~filename_1~0| 0), Black: 428#true, 503#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 396#true, Black: 498#(<= (+ ~result_10~0 1) 0), Black: 433#true, 475#true, 509#(= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))), 518#true, Black: 438#true, Black: 501#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:33,482 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-26 08:40:33,482 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-26 08:40:33,482 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-26 08:40:33,482 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-26 08:40:33,496 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][107], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 507#true, Black: 512#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 ~result_11~0)), Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), 228#thread2EXITtrue, Black: 409#true, Black: 414#true, Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), 266#L56-36true, Black: 423#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), Black: 428#true, 503#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 396#true, Black: 498#(<= (+ ~result_10~0 1) 0), 475#true, Black: 433#true, 509#(= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))), 518#true, Black: 438#true, Black: 501#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:33,496 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:33,496 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-26 08:40:33,496 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-26 08:40:33,496 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-26 08:40:33,496 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][107], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 507#true, Black: 512#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 ~result_11~0)), Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 54#L50-38true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), Black: 409#true, Black: 414#true, Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), Black: 423#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), Black: 428#true, 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), 503#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 396#true, Black: 498#(<= (+ ~result_10~0 1) 0), Black: 433#true, 475#true, 509#(= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))), 518#true, Black: 501#true, Black: 438#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:33,496 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:33,496 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-26 08:40:33,496 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-26 08:40:33,496 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-26 08:40:33,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][107], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 507#true, Black: 512#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 ~result_11~0)), Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 416#(= |#race~filename_2~0| 0), 430#(= |#race~filename_8~0| 0), Black: 409#true, 228#thread2EXITtrue, Black: 414#true, Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), 269#L77-4true, Black: 423#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), 440#(= |#race~filename_4~0| 0), 435#(= |#race~filename_1~0| 0), Black: 428#true, 503#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 396#true, Black: 498#(<= (+ ~result_10~0 1) 0), Black: 433#true, 475#true, 509#(= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))), 518#true, Black: 438#true, Black: 501#true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:33,498 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-26 08:40:33,498 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-26 08:40:33,498 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-26 08:40:33,498 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-26 08:40:33,505 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1502] L44-26-->L44-37: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#res#1_37|) |v_thread1Thread1of1ForFork2_minus_~a#1_51|) (= |v_thread1Thread1of1ForFork2_minus_~b#1_51| |v_thread1Thread1of1ForFork2_minus_#in~b#1_27|) (= |v_thread1Thread1of1ForFork2_minus_#res#1_37| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_minus_#in~a#1_27| v_~filename_1~0_59) (= v_~result_9~0_64 |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ret1#1_35|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_49| |v_thread1Thread1of1ForFork2_#t~ite4#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_41| |v_thread1Thread1of1ForFork2_#t~ite5#1_47|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483648)) (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_35| 2147483647) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_39| |v_thread1Thread1of1ForFork2_#t~ite3#1_49|) (= |v_#race~filename_4~0_42| 0) (= |v_thread1Thread1of1ForFork2_minus_~a#1_51| |v_thread1Thread1of1ForFork2_minus_#in~a#1_27|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_minus_~a#1_51| (+ |v_thread1Thread1of1ForFork2_minus_~b#1_51| 2147483647)) (<= 0 |v_thread1Thread1of1ForFork2_minus_~b#1_51|)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork2_minus_#in~b#1_27| v_~filename_4~0_59)) InVars {~filename_1~0=v_~filename_1~0_59, ~filename_4~0=v_~filename_4~0_59, #race~filename_4~0=|v_#race~filename_4~0_42|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_35|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_39|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_27|, ~filename_1~0=v_~filename_1~0_59, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_47|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_37|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_64, ~filename_4~0=v_~filename_4~0_59, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_27|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_51|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_49|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_53|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_41|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_51|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_69|, #race~filename_4~0=|v_#race~filename_4~0_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][107], [406#(= |#race~isNull_3~0| 0), 308#L44-37true, Black: 507#true, Black: 512#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 ~result_11~0)), Black: 448#true, 425#(= |#race~filename_5~0| 0), Black: 456#(<= (+ ~result_9~0 1) 0), 66#thread3EXITtrue, 459#true, 450#(= (* (div ~isNull_0~0 256) 256) ~isNull_0~0), Black: 462#(= ~result_11~0 ~result_10~0), Black: 399#true, 445#(= |#race~filename_7~0| 0), Black: 404#true, Black: 471#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), 430#(= |#race~filename_8~0| 0), 416#(= |#race~filename_2~0| 0), 228#thread2EXITtrue, Black: 409#true, Black: 414#true, Black: 478#(<= ~result_9~0 0), 411#(= |#race~isNull_6~0| 0), Black: 423#true, Black: 492#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), 435#(= |#race~filename_1~0| 0), 440#(= |#race~filename_4~0| 0), Black: 428#true, 503#(= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))), 396#true, Black: 498#(<= (+ ~result_10~0 1) 0), 475#true, Black: 433#true, 509#(= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))), 518#true, Black: 438#true, Black: 501#true, 279#L78-6true, 401#(= |#race~isNull_0~0| 0), Black: 443#true]) [2023-08-26 08:40:33,505 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-26 08:40:33,505 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-26 08:40:33,505 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-26 08:40:33,505 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-26 08:40:33,511 INFO L124 PetriNetUnfolderBase]: 19686/34630 cut-off events. [2023-08-26 08:40:33,511 INFO L125 PetriNetUnfolderBase]: For 25382/25422 co-relation queries the response was YES. [2023-08-26 08:40:33,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94115 conditions, 34630 events. 19686/34630 cut-off events. For 25382/25422 co-relation queries the response was YES. Maximal size of possible extension queue 1280. Compared 307255 event pairs, 11402 based on Foata normal form. 22/32306 useless extension candidates. Maximal degree in co-relation 94090. Up to 22258 conditions per place. [2023-08-26 08:40:33,720 INFO L140 encePairwiseOnDemand]: 793/802 looper letters, 113 selfloop transitions, 10 changer transitions 40/197 dead transitions. [2023-08-26 08:40:33,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 197 transitions, 1279 flow [2023-08-26 08:40:33,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 08:40:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 08:40:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1633 transitions. [2023-08-26 08:40:33,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5090399002493765 [2023-08-26 08:40:33,723 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1633 transitions. [2023-08-26 08:40:33,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1633 transitions. [2023-08-26 08:40:33,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:33,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1633 transitions. [2023-08-26 08:40:33,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 408.25) internal successors, (1633), 4 states have internal predecessors, (1633), 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 08:40:33,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 802.0) internal successors, (4010), 5 states have internal predecessors, (4010), 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 08:40:33,727 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 802.0) internal successors, (4010), 5 states have internal predecessors, (4010), 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 08:40:33,727 INFO L175 Difference]: Start difference. First operand has 122 places, 120 transitions, 611 flow. Second operand 4 states and 1633 transitions. [2023-08-26 08:40:33,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 197 transitions, 1279 flow [2023-08-26 08:40:33,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 197 transitions, 1279 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:40:33,826 INFO L231 Difference]: Finished difference. Result has 127 places, 118 transitions, 647 flow [2023-08-26 08:40:33,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=647, PETRI_PLACES=127, PETRI_TRANSITIONS=118} [2023-08-26 08:40:33,826 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 15 predicate places. [2023-08-26 08:40:33,827 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 118 transitions, 647 flow [2023-08-26 08:40:33,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 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 08:40:33,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:33,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:40:33,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 08:40:33,827 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:33,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:33,828 INFO L85 PathProgramCache]: Analyzing trace with hash -472048563, now seen corresponding path program 1 times [2023-08-26 08:40:33,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:33,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318404368] [2023-08-26 08:40:33,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:33,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:33,935 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 08:40:33,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:33,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318404368] [2023-08-26 08:40:33,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318404368] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:33,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:33,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:40:33,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004516365] [2023-08-26 08:40:33,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:33,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:40:33,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:33,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:40:33,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:40:33,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 802 [2023-08-26 08:40:33,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 118 transitions, 647 flow. Second operand has 4 states, 4 states have (on average 383.0) internal successors, (1532), 4 states have internal predecessors, (1532), 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 08:40:33,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:33,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 802 [2023-08-26 08:40:33,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:36,848 INFO L124 PetriNetUnfolderBase]: 18001/30338 cut-off events. [2023-08-26 08:40:36,849 INFO L125 PetriNetUnfolderBase]: For 28730/29228 co-relation queries the response was YES. [2023-08-26 08:40:37,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85944 conditions, 30338 events. 18001/30338 cut-off events. For 28730/29228 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 255734 event pairs, 4832 based on Foata normal form. 342/28369 useless extension candidates. Maximal degree in co-relation 85916. Up to 16734 conditions per place. [2023-08-26 08:40:37,070 INFO L140 encePairwiseOnDemand]: 791/802 looper letters, 147 selfloop transitions, 13 changer transitions 13/207 dead transitions. [2023-08-26 08:40:37,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 207 transitions, 1400 flow [2023-08-26 08:40:37,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:40:37,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:40:37,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2010 transitions. [2023-08-26 08:40:37,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012468827930174 [2023-08-26 08:40:37,073 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2010 transitions. [2023-08-26 08:40:37,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2010 transitions. [2023-08-26 08:40:37,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:37,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2010 transitions. [2023-08-26 08:40:37,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 402.0) internal successors, (2010), 5 states have internal predecessors, (2010), 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 08:40:37,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 802.0) internal successors, (4812), 6 states have internal predecessors, (4812), 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 08:40:37,079 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 802.0) internal successors, (4812), 6 states have internal predecessors, (4812), 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 08:40:37,079 INFO L175 Difference]: Start difference. First operand has 127 places, 118 transitions, 647 flow. Second operand 5 states and 2010 transitions. [2023-08-26 08:40:37,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 207 transitions, 1400 flow [2023-08-26 08:40:37,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 207 transitions, 1393 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 08:40:37,365 INFO L231 Difference]: Finished difference. Result has 130 places, 119 transitions, 683 flow [2023-08-26 08:40:37,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=683, PETRI_PLACES=130, PETRI_TRANSITIONS=119} [2023-08-26 08:40:37,366 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 18 predicate places. [2023-08-26 08:40:37,366 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 119 transitions, 683 flow [2023-08-26 08:40:37,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 383.0) internal successors, (1532), 4 states have internal predecessors, (1532), 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 08:40:37,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:37,366 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:40:37,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 08:40:37,367 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:37,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:37,367 INFO L85 PathProgramCache]: Analyzing trace with hash -978175989, now seen corresponding path program 1 times [2023-08-26 08:40:37,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:37,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232679188] [2023-08-26 08:40:37,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:37,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:37,402 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 08:40:37,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:37,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232679188] [2023-08-26 08:40:37,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232679188] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:37,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:37,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:40:37,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347552450] [2023-08-26 08:40:37,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:37,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:40:37,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:37,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:40:37,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:40:37,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 802 [2023-08-26 08:40:37,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 119 transitions, 683 flow. Second operand has 3 states, 3 states have (on average 393.3333333333333) internal successors, (1180), 3 states have internal predecessors, (1180), 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 08:40:37,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:37,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 802 [2023-08-26 08:40:37,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:40,571 INFO L124 PetriNetUnfolderBase]: 19149/33393 cut-off events. [2023-08-26 08:40:40,571 INFO L125 PetriNetUnfolderBase]: For 37952/37996 co-relation queries the response was YES. [2023-08-26 08:40:40,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95726 conditions, 33393 events. 19149/33393 cut-off events. For 37952/37996 co-relation queries the response was YES. Maximal size of possible extension queue 1251. Compared 292883 event pairs, 9728 based on Foata normal form. 0/31441 useless extension candidates. Maximal degree in co-relation 95696. Up to 17043 conditions per place. [2023-08-26 08:40:40,826 INFO L140 encePairwiseOnDemand]: 798/802 looper letters, 135 selfloop transitions, 4 changer transitions 6/179 dead transitions. [2023-08-26 08:40:40,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 179 transitions, 1324 flow [2023-08-26 08:40:40,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:40:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:40:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1238 transitions. [2023-08-26 08:40:40,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.514546965918537 [2023-08-26 08:40:40,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1238 transitions. [2023-08-26 08:40:40,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1238 transitions. [2023-08-26 08:40:40,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:40,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1238 transitions. [2023-08-26 08:40:40,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 412.6666666666667) internal successors, (1238), 3 states have internal predecessors, (1238), 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 08:40:40,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:40,833 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:40,834 INFO L175 Difference]: Start difference. First operand has 130 places, 119 transitions, 683 flow. Second operand 3 states and 1238 transitions. [2023-08-26 08:40:40,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 179 transitions, 1324 flow [2023-08-26 08:40:41,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 179 transitions, 1306 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 08:40:41,086 INFO L231 Difference]: Finished difference. Result has 133 places, 123 transitions, 722 flow [2023-08-26 08:40:41,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=722, PETRI_PLACES=133, PETRI_TRANSITIONS=123} [2023-08-26 08:40:41,087 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 21 predicate places. [2023-08-26 08:40:41,087 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 123 transitions, 722 flow [2023-08-26 08:40:41,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 393.3333333333333) internal successors, (1180), 3 states have internal predecessors, (1180), 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 08:40:41,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:41,087 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:40:41,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 08:40:41,088 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:41,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1700505119, now seen corresponding path program 2 times [2023-08-26 08:40:41,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:41,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210604117] [2023-08-26 08:40:41,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:41,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:41,144 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 08:40:41,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:41,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210604117] [2023-08-26 08:40:41,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210604117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:41,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:41,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:40:41,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795431761] [2023-08-26 08:40:41,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:41,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:40:41,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:41,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:40:41,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:40:41,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 802 [2023-08-26 08:40:41,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 123 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 393.3333333333333) internal successors, (1180), 3 states have internal predecessors, (1180), 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 08:40:41,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:41,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 802 [2023-08-26 08:40:41,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:43,779 INFO L124 PetriNetUnfolderBase]: 15199/26861 cut-off events. [2023-08-26 08:40:43,779 INFO L125 PetriNetUnfolderBase]: For 35899/36060 co-relation queries the response was YES. [2023-08-26 08:40:43,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79481 conditions, 26861 events. 15199/26861 cut-off events. For 35899/36060 co-relation queries the response was YES. Maximal size of possible extension queue 1053. Compared 232826 event pairs, 6737 based on Foata normal form. 593/26488 useless extension candidates. Maximal degree in co-relation 79449. Up to 14515 conditions per place. [2023-08-26 08:40:43,950 INFO L140 encePairwiseOnDemand]: 798/802 looper letters, 130 selfloop transitions, 4 changer transitions 4/172 dead transitions. [2023-08-26 08:40:43,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 172 transitions, 1290 flow [2023-08-26 08:40:43,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:40:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:40:43,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1232 transitions. [2023-08-26 08:40:43,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5120532003325021 [2023-08-26 08:40:43,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1232 transitions. [2023-08-26 08:40:43,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1232 transitions. [2023-08-26 08:40:43,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:43,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1232 transitions. [2023-08-26 08:40:43,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 410.6666666666667) internal successors, (1232), 3 states have internal predecessors, (1232), 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 08:40:43,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:43,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:43,957 INFO L175 Difference]: Start difference. First operand has 133 places, 123 transitions, 722 flow. Second operand 3 states and 1232 transitions. [2023-08-26 08:40:43,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 172 transitions, 1290 flow [2023-08-26 08:40:44,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 172 transitions, 1286 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 08:40:44,138 INFO L231 Difference]: Finished difference. Result has 136 places, 127 transitions, 776 flow [2023-08-26 08:40:44,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=136, PETRI_TRANSITIONS=127} [2023-08-26 08:40:44,138 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 24 predicate places. [2023-08-26 08:40:44,138 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 127 transitions, 776 flow [2023-08-26 08:40:44,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 393.3333333333333) internal successors, (1180), 3 states have internal predecessors, (1180), 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 08:40:44,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:44,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:40:44,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 08:40:44,139 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:44,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash 392279135, now seen corresponding path program 2 times [2023-08-26 08:40:44,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:44,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350113129] [2023-08-26 08:40:44,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:44,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:44,251 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 08:40:44,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:44,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350113129] [2023-08-26 08:40:44,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350113129] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:44,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:44,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:40:44,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121589128] [2023-08-26 08:40:44,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:44,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:40:44,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:44,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:40:44,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:40:44,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 802 [2023-08-26 08:40:44,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 127 transitions, 776 flow. Second operand has 4 states, 4 states have (on average 383.0) internal successors, (1532), 4 states have internal predecessors, (1532), 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 08:40:44,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:44,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 802 [2023-08-26 08:40:44,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:46,940 INFO L124 PetriNetUnfolderBase]: 15154/26172 cut-off events. [2023-08-26 08:40:46,940 INFO L125 PetriNetUnfolderBase]: For 37310/37716 co-relation queries the response was YES. [2023-08-26 08:40:47,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79831 conditions, 26172 events. 15154/26172 cut-off events. For 37310/37716 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 221963 event pairs, 4099 based on Foata normal form. 280/25467 useless extension candidates. Maximal degree in co-relation 79798. Up to 16029 conditions per place. [2023-08-26 08:40:47,141 INFO L140 encePairwiseOnDemand]: 791/802 looper letters, 156 selfloop transitions, 15 changer transitions 11/216 dead transitions. [2023-08-26 08:40:47,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 216 transitions, 1636 flow [2023-08-26 08:40:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:40:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:40:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2000 transitions. [2023-08-26 08:40:47,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49875311720698257 [2023-08-26 08:40:47,144 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2000 transitions. [2023-08-26 08:40:47,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2000 transitions. [2023-08-26 08:40:47,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:47,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2000 transitions. [2023-08-26 08:40:47,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 400.0) internal successors, (2000), 5 states have internal predecessors, (2000), 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 08:40:47,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 802.0) internal successors, (4812), 6 states have internal predecessors, (4812), 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 08:40:47,148 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 802.0) internal successors, (4812), 6 states have internal predecessors, (4812), 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 08:40:47,148 INFO L175 Difference]: Start difference. First operand has 136 places, 127 transitions, 776 flow. Second operand 5 states and 2000 transitions. [2023-08-26 08:40:47,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 216 transitions, 1636 flow [2023-08-26 08:40:47,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 216 transitions, 1612 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-26 08:40:47,285 INFO L231 Difference]: Finished difference. Result has 141 places, 128 transitions, 811 flow [2023-08-26 08:40:47,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=811, PETRI_PLACES=141, PETRI_TRANSITIONS=128} [2023-08-26 08:40:47,285 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 29 predicate places. [2023-08-26 08:40:47,285 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 128 transitions, 811 flow [2023-08-26 08:40:47,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 383.0) internal successors, (1532), 4 states have internal predecessors, (1532), 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 08:40:47,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:47,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:40:47,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 08:40:47,286 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:47,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:47,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2105031959, now seen corresponding path program 1 times [2023-08-26 08:40:47,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:47,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60804869] [2023-08-26 08:40:47,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:47,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:47,320 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 08:40:47,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:47,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60804869] [2023-08-26 08:40:47,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60804869] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:47,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:47,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:40:47,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442746417] [2023-08-26 08:40:47,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:47,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:40:47,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:47,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:40:47,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:40:47,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 802 [2023-08-26 08:40:47,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 128 transitions, 811 flow. Second operand has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 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 08:40:47,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:47,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 802 [2023-08-26 08:40:47,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:50,180 INFO L124 PetriNetUnfolderBase]: 15156/26893 cut-off events. [2023-08-26 08:40:50,181 INFO L125 PetriNetUnfolderBase]: For 39401/39457 co-relation queries the response was YES. [2023-08-26 08:40:50,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82946 conditions, 26893 events. 15156/26893 cut-off events. For 39401/39457 co-relation queries the response was YES. Maximal size of possible extension queue 1039. Compared 234872 event pairs, 8019 based on Foata normal form. 109/25789 useless extension candidates. Maximal degree in co-relation 82911. Up to 15507 conditions per place. [2023-08-26 08:40:50,375 INFO L140 encePairwiseOnDemand]: 798/802 looper letters, 133 selfloop transitions, 2 changer transitions 21/190 dead transitions. [2023-08-26 08:40:50,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 190 transitions, 1521 flow [2023-08-26 08:40:50,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:40:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:40:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1235 transitions. [2023-08-26 08:40:50,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5133000831255196 [2023-08-26 08:40:50,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1235 transitions. [2023-08-26 08:40:50,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1235 transitions. [2023-08-26 08:40:50,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:50,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1235 transitions. [2023-08-26 08:40:50,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 411.6666666666667) internal successors, (1235), 3 states have internal predecessors, (1235), 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 08:40:50,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:50,381 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:50,381 INFO L175 Difference]: Start difference. First operand has 141 places, 128 transitions, 811 flow. Second operand 3 states and 1235 transitions. [2023-08-26 08:40:50,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 190 transitions, 1521 flow [2023-08-26 08:40:50,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 190 transitions, 1502 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 08:40:50,562 INFO L231 Difference]: Finished difference. Result has 143 places, 128 transitions, 810 flow [2023-08-26 08:40:50,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=143, PETRI_TRANSITIONS=128} [2023-08-26 08:40:50,563 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 31 predicate places. [2023-08-26 08:40:50,563 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 128 transitions, 810 flow [2023-08-26 08:40:50,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 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 08:40:50,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:50,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:40:50,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-26 08:40:50,564 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:50,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1876788983, now seen corresponding path program 1 times [2023-08-26 08:40:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:50,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961024643] [2023-08-26 08:40:50,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:50,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:50,651 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 08:40:50,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:50,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961024643] [2023-08-26 08:40:50,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961024643] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:50,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:50,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:40:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972543008] [2023-08-26 08:40:50,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:50,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:40:50,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:50,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:40:50,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:40:50,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 802 [2023-08-26 08:40:50,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 128 transitions, 810 flow. Second operand has 4 states, 4 states have (on average 386.25) internal successors, (1545), 4 states have internal predecessors, (1545), 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 08:40:50,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:50,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 802 [2023-08-26 08:40:50,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:53,560 INFO L124 PetriNetUnfolderBase]: 14464/26746 cut-off events. [2023-08-26 08:40:53,561 INFO L125 PetriNetUnfolderBase]: For 37123/37187 co-relation queries the response was YES. [2023-08-26 08:40:53,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82758 conditions, 26746 events. 14464/26746 cut-off events. For 37123/37187 co-relation queries the response was YES. Maximal size of possible extension queue 1037. Compared 240941 event pairs, 7213 based on Foata normal form. 254/26273 useless extension candidates. Maximal degree in co-relation 82721. Up to 14156 conditions per place. [2023-08-26 08:40:53,758 INFO L140 encePairwiseOnDemand]: 796/802 looper letters, 144 selfloop transitions, 6 changer transitions 10/194 dead transitions. [2023-08-26 08:40:53,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 194 transitions, 1499 flow [2023-08-26 08:40:53,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 08:40:53,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 08:40:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1615 transitions. [2023-08-26 08:40:53,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503428927680798 [2023-08-26 08:40:53,760 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1615 transitions. [2023-08-26 08:40:53,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1615 transitions. [2023-08-26 08:40:53,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:53,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1615 transitions. [2023-08-26 08:40:53,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 403.75) internal successors, (1615), 4 states have internal predecessors, (1615), 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 08:40:53,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 802.0) internal successors, (4010), 5 states have internal predecessors, (4010), 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 08:40:53,764 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 802.0) internal successors, (4010), 5 states have internal predecessors, (4010), 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 08:40:53,764 INFO L175 Difference]: Start difference. First operand has 143 places, 128 transitions, 810 flow. Second operand 4 states and 1615 transitions. [2023-08-26 08:40:53,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 194 transitions, 1499 flow [2023-08-26 08:40:53,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 194 transitions, 1495 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 08:40:53,936 INFO L231 Difference]: Finished difference. Result has 148 places, 134 transitions, 891 flow [2023-08-26 08:40:53,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=891, PETRI_PLACES=148, PETRI_TRANSITIONS=134} [2023-08-26 08:40:53,936 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 36 predicate places. [2023-08-26 08:40:53,936 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 134 transitions, 891 flow [2023-08-26 08:40:53,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 386.25) internal successors, (1545), 4 states have internal predecessors, (1545), 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 08:40:53,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:53,937 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:40:53,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-26 08:40:53,937 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:53,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:53,937 INFO L85 PathProgramCache]: Analyzing trace with hash -249518405, now seen corresponding path program 2 times [2023-08-26 08:40:53,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:53,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537664495] [2023-08-26 08:40:53,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:53,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:53,982 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 08:40:53,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:53,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537664495] [2023-08-26 08:40:53,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537664495] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:53,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:53,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:40:53,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032041246] [2023-08-26 08:40:53,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:53,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:40:53,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:53,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:40:53,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:40:53,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 802 [2023-08-26 08:40:53,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 134 transitions, 891 flow. Second operand has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 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 08:40:53,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:53,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 802 [2023-08-26 08:40:53,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:56,546 INFO L124 PetriNetUnfolderBase]: 12761/23578 cut-off events. [2023-08-26 08:40:56,546 INFO L125 PetriNetUnfolderBase]: For 39007/39047 co-relation queries the response was YES. [2023-08-26 08:40:56,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76269 conditions, 23578 events. 12761/23578 cut-off events. For 39007/39047 co-relation queries the response was YES. Maximal size of possible extension queue 956. Compared 210118 event pairs, 5568 based on Foata normal form. 175/22787 useless extension candidates. Maximal degree in co-relation 76230. Up to 10930 conditions per place. [2023-08-26 08:40:56,693 INFO L140 encePairwiseOnDemand]: 798/802 looper letters, 145 selfloop transitions, 2 changer transitions 11/192 dead transitions. [2023-08-26 08:40:56,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 192 transitions, 1591 flow [2023-08-26 08:40:56,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:40:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:40:56,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1231 transitions. [2023-08-26 08:40:56,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5116375727348296 [2023-08-26 08:40:56,695 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1231 transitions. [2023-08-26 08:40:56,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1231 transitions. [2023-08-26 08:40:56,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:56,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1231 transitions. [2023-08-26 08:40:56,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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 08:40:56,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:56,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 802.0) internal successors, (3208), 4 states have internal predecessors, (3208), 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 08:40:56,699 INFO L175 Difference]: Start difference. First operand has 148 places, 134 transitions, 891 flow. Second operand 3 states and 1231 transitions. [2023-08-26 08:40:56,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 192 transitions, 1591 flow [2023-08-26 08:40:56,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 192 transitions, 1591 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:40:56,853 INFO L231 Difference]: Finished difference. Result has 152 places, 136 transitions, 915 flow [2023-08-26 08:40:56,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=915, PETRI_PLACES=152, PETRI_TRANSITIONS=136} [2023-08-26 08:40:56,853 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 40 predicate places. [2023-08-26 08:40:56,853 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 136 transitions, 915 flow [2023-08-26 08:40:56,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 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 08:40:56,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:56,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:40:56,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-26 08:40:56,854 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:56,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:56,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1096111325, now seen corresponding path program 2 times [2023-08-26 08:40:56,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:56,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319294368] [2023-08-26 08:40:56,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:56,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:40:56,966 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 08:40:56,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:40:56,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319294368] [2023-08-26 08:40:56,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319294368] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:40:56,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:40:56,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:40:56,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65553963] [2023-08-26 08:40:56,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:40:56,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:40:56,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:40:56,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:40:56,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:40:56,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 802 [2023-08-26 08:40:56,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 136 transitions, 915 flow. Second operand has 4 states, 4 states have (on average 386.25) internal successors, (1545), 4 states have internal predecessors, (1545), 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 08:40:56,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:40:56,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 802 [2023-08-26 08:40:56,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:40:59,534 INFO L124 PetriNetUnfolderBase]: 12754/23211 cut-off events. [2023-08-26 08:40:59,534 INFO L125 PetriNetUnfolderBase]: For 41704/41866 co-relation queries the response was YES. [2023-08-26 08:40:59,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77123 conditions, 23211 events. 12754/23211 cut-off events. For 41704/41866 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 203157 event pairs, 6550 based on Foata normal form. 28/22509 useless extension candidates. Maximal degree in co-relation 77082. Up to 13295 conditions per place. [2023-08-26 08:40:59,683 INFO L140 encePairwiseOnDemand]: 794/802 looper letters, 132 selfloop transitions, 14 changer transitions 27/207 dead transitions. [2023-08-26 08:40:59,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 207 transitions, 1666 flow [2023-08-26 08:40:59,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 08:40:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 08:40:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1619 transitions. [2023-08-26 08:40:59,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5046758104738155 [2023-08-26 08:40:59,686 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1619 transitions. [2023-08-26 08:40:59,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1619 transitions. [2023-08-26 08:40:59,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:40:59,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1619 transitions. [2023-08-26 08:40:59,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 404.75) internal successors, (1619), 4 states have internal predecessors, (1619), 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 08:40:59,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 802.0) internal successors, (4010), 5 states have internal predecessors, (4010), 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 08:40:59,690 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 802.0) internal successors, (4010), 5 states have internal predecessors, (4010), 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 08:40:59,690 INFO L175 Difference]: Start difference. First operand has 152 places, 136 transitions, 915 flow. Second operand 4 states and 1619 transitions. [2023-08-26 08:40:59,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 207 transitions, 1666 flow [2023-08-26 08:40:59,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 207 transitions, 1652 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-26 08:40:59,832 INFO L231 Difference]: Finished difference. Result has 157 places, 137 transitions, 1000 flow [2023-08-26 08:40:59,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1000, PETRI_PLACES=157, PETRI_TRANSITIONS=137} [2023-08-26 08:40:59,833 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 45 predicate places. [2023-08-26 08:40:59,833 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 137 transitions, 1000 flow [2023-08-26 08:40:59,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 386.25) internal successors, (1545), 4 states have internal predecessors, (1545), 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 08:40:59,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:40:59,833 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, 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 08:40:59,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-26 08:40:59,833 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:40:59,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:40:59,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1213306424, now seen corresponding path program 1 times [2023-08-26 08:40:59,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:40:59,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606267127] [2023-08-26 08:40:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:40:59,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:40:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:41:00,139 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 08:41:00,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:41:00,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606267127] [2023-08-26 08:41:00,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606267127] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:41:00,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:41:00,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 08:41:00,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265986197] [2023-08-26 08:41:00,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:41:00,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 08:41:00,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:41:00,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 08:41:00,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 08:41:00,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 802 [2023-08-26 08:41:00,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 137 transitions, 1000 flow. Second operand has 5 states, 5 states have (on average 378.2) internal successors, (1891), 5 states have internal predecessors, (1891), 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 08:41:00,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:41:00,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 802 [2023-08-26 08:41:00,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:41:02,483 INFO L124 PetriNetUnfolderBase]: 9734/17672 cut-off events. [2023-08-26 08:41:02,483 INFO L125 PetriNetUnfolderBase]: For 39930/40213 co-relation queries the response was YES. [2023-08-26 08:41:02,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61941 conditions, 17672 events. 9734/17672 cut-off events. For 39930/40213 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 148063 event pairs, 2762 based on Foata normal form. 128/17004 useless extension candidates. Maximal degree in co-relation 61898. Up to 11051 conditions per place. [2023-08-26 08:41:02,589 INFO L140 encePairwiseOnDemand]: 788/802 looper letters, 173 selfloop transitions, 18 changer transitions 22/247 dead transitions. [2023-08-26 08:41:02,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 247 transitions, 2096 flow [2023-08-26 08:41:02,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 08:41:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 08:41:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2363 transitions. [2023-08-26 08:41:02,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4910640066500416 [2023-08-26 08:41:02,592 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2363 transitions. [2023-08-26 08:41:02,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2363 transitions. [2023-08-26 08:41:02,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:41:02,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2363 transitions. [2023-08-26 08:41:02,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 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 08:41:02,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 802.0) internal successors, (5614), 7 states have internal predecessors, (5614), 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 08:41:02,598 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 802.0) internal successors, (5614), 7 states have internal predecessors, (5614), 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 08:41:02,598 INFO L175 Difference]: Start difference. First operand has 157 places, 137 transitions, 1000 flow. Second operand 6 states and 2363 transitions. [2023-08-26 08:41:02,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 247 transitions, 2096 flow [2023-08-26 08:41:02,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 247 transitions, 2076 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-26 08:41:02,695 INFO L231 Difference]: Finished difference. Result has 162 places, 146 transitions, 1140 flow [2023-08-26 08:41:02,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1140, PETRI_PLACES=162, PETRI_TRANSITIONS=146} [2023-08-26 08:41:02,695 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 50 predicate places. [2023-08-26 08:41:02,696 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 146 transitions, 1140 flow [2023-08-26 08:41:02,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 378.2) internal successors, (1891), 5 states have internal predecessors, (1891), 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 08:41:02,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:41:02,696 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, 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 08:41:02,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-26 08:41:02,696 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:41:02,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:41:02,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1850163540, now seen corresponding path program 2 times [2023-08-26 08:41:02,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:41:02,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567839541] [2023-08-26 08:41:02,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:41:02,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:41:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:41:03,008 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 08:41:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:41:03,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567839541] [2023-08-26 08:41:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567839541] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:41:03,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:41:03,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 08:41:03,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490355466] [2023-08-26 08:41:03,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:41:03,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 08:41:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:41:03,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 08:41:03,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 08:41:03,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 802 [2023-08-26 08:41:03,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 146 transitions, 1140 flow. Second operand has 5 states, 5 states have (on average 378.2) internal successors, (1891), 5 states have internal predecessors, (1891), 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 08:41:03,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:41:03,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 802 [2023-08-26 08:41:03,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:41:05,278 INFO L124 PetriNetUnfolderBase]: 9626/17532 cut-off events. [2023-08-26 08:41:05,278 INFO L125 PetriNetUnfolderBase]: For 43880/44406 co-relation queries the response was YES. [2023-08-26 08:41:05,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63405 conditions, 17532 events. 9626/17532 cut-off events. For 43880/44406 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 145875 event pairs, 2314 based on Foata normal form. 265/16991 useless extension candidates. Maximal degree in co-relation 63361. Up to 9048 conditions per place. [2023-08-26 08:41:05,411 INFO L140 encePairwiseOnDemand]: 788/802 looper letters, 178 selfloop transitions, 19 changer transitions 25/256 dead transitions. [2023-08-26 08:41:05,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 256 transitions, 2250 flow [2023-08-26 08:41:05,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 08:41:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 08:41:05,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2363 transitions. [2023-08-26 08:41:05,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4910640066500416 [2023-08-26 08:41:05,414 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2363 transitions. [2023-08-26 08:41:05,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2363 transitions. [2023-08-26 08:41:05,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:41:05,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2363 transitions. [2023-08-26 08:41:05,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 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 08:41:05,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 802.0) internal successors, (5614), 7 states have internal predecessors, (5614), 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 08:41:05,419 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 802.0) internal successors, (5614), 7 states have internal predecessors, (5614), 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 08:41:05,420 INFO L175 Difference]: Start difference. First operand has 162 places, 146 transitions, 1140 flow. Second operand 6 states and 2363 transitions. [2023-08-26 08:41:05,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 256 transitions, 2250 flow [2023-08-26 08:41:05,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 256 transitions, 2246 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 08:41:05,512 INFO L231 Difference]: Finished difference. Result has 168 places, 148 transitions, 1214 flow [2023-08-26 08:41:05,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1214, PETRI_PLACES=168, PETRI_TRANSITIONS=148} [2023-08-26 08:41:05,512 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 56 predicate places. [2023-08-26 08:41:05,512 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 148 transitions, 1214 flow [2023-08-26 08:41:05,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 378.2) internal successors, (1891), 5 states have internal predecessors, (1891), 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 08:41:05,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:41:05,513 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, 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 08:41:05,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-26 08:41:05,513 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:41:05,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:41:05,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1777919618, now seen corresponding path program 3 times [2023-08-26 08:41:05,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:41:05,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361623840] [2023-08-26 08:41:05,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:41:05,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:41:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:41:06,038 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 08:41:06,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:41:06,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361623840] [2023-08-26 08:41:06,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361623840] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:41:06,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:41:06,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 08:41:06,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148813578] [2023-08-26 08:41:06,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:41:06,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 08:41:06,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:41:06,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 08:41:06,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 08:41:06,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 802 [2023-08-26 08:41:06,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 148 transitions, 1214 flow. Second operand has 5 states, 5 states have (on average 378.2) internal successors, (1891), 5 states have internal predecessors, (1891), 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 08:41:06,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:41:06,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 802 [2023-08-26 08:41:06,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:41:08,346 INFO L124 PetriNetUnfolderBase]: 9630/17659 cut-off events. [2023-08-26 08:41:08,347 INFO L125 PetriNetUnfolderBase]: For 52893/53402 co-relation queries the response was YES. [2023-08-26 08:41:08,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65305 conditions, 17659 events. 9630/17659 cut-off events. For 52893/53402 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 148231 event pairs, 2752 based on Foata normal form. 268/17134 useless extension candidates. Maximal degree in co-relation 65258. Up to 10798 conditions per place. [2023-08-26 08:41:08,445 INFO L140 encePairwiseOnDemand]: 788/802 looper letters, 178 selfloop transitions, 19 changer transitions 14/245 dead transitions. [2023-08-26 08:41:08,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 245 transitions, 2187 flow [2023-08-26 08:41:08,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 08:41:08,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 08:41:08,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2361 transitions. [2023-08-26 08:41:08,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4906483790523691 [2023-08-26 08:41:08,448 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2361 transitions. [2023-08-26 08:41:08,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2361 transitions. [2023-08-26 08:41:08,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:41:08,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2361 transitions. [2023-08-26 08:41:08,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 393.5) internal successors, (2361), 6 states have internal predecessors, (2361), 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 08:41:08,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 802.0) internal successors, (5614), 7 states have internal predecessors, (5614), 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 08:41:08,453 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 802.0) internal successors, (5614), 7 states have internal predecessors, (5614), 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 08:41:08,453 INFO L175 Difference]: Start difference. First operand has 168 places, 148 transitions, 1214 flow. Second operand 6 states and 2361 transitions. [2023-08-26 08:41:08,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 245 transitions, 2187 flow [2023-08-26 08:41:08,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 245 transitions, 2164 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 08:41:08,571 INFO L231 Difference]: Finished difference. Result has 173 places, 149 transitions, 1256 flow [2023-08-26 08:41:08,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1256, PETRI_PLACES=173, PETRI_TRANSITIONS=149} [2023-08-26 08:41:08,572 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 61 predicate places. [2023-08-26 08:41:08,572 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 149 transitions, 1256 flow [2023-08-26 08:41:08,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 378.2) internal successors, (1891), 5 states have internal predecessors, (1891), 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 08:41:08,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:41:08,572 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, 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 08:41:08,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-26 08:41:08,573 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:41:08,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:41:08,573 INFO L85 PathProgramCache]: Analyzing trace with hash -557569526, now seen corresponding path program 4 times [2023-08-26 08:41:08,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:41:08,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917909776] [2023-08-26 08:41:08,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:41:08,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:41:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:41:08,843 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 08:41:08,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:41:08,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917909776] [2023-08-26 08:41:08,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917909776] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:41:08,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:41:08,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 08:41:08,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208334939] [2023-08-26 08:41:08,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:41:08,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 08:41:08,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:41:08,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 08:41:08,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 08:41:08,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 802 [2023-08-26 08:41:08,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 149 transitions, 1256 flow. Second operand has 5 states, 5 states have (on average 378.2) internal successors, (1891), 5 states have internal predecessors, (1891), 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 08:41:08,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:41:08,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 802 [2023-08-26 08:41:08,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:41:11,138 INFO L124 PetriNetUnfolderBase]: 9576/17608 cut-off events. [2023-08-26 08:41:11,138 INFO L125 PetriNetUnfolderBase]: For 56561/57152 co-relation queries the response was YES. [2023-08-26 08:41:11,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66452 conditions, 17608 events. 9576/17608 cut-off events. For 56561/57152 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 148261 event pairs, 2728 based on Foata normal form. 289/17084 useless extension candidates. Maximal degree in co-relation 66402. Up to 10534 conditions per place. [2023-08-26 08:41:11,311 INFO L140 encePairwiseOnDemand]: 788/802 looper letters, 180 selfloop transitions, 24 changer transitions 13/251 dead transitions. [2023-08-26 08:41:11,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 251 transitions, 2305 flow [2023-08-26 08:41:11,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 08:41:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 08:41:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2360 transitions. [2023-08-26 08:41:11,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49044056525353286 [2023-08-26 08:41:11,313 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2360 transitions. [2023-08-26 08:41:11,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2360 transitions. [2023-08-26 08:41:11,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:41:11,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2360 transitions. [2023-08-26 08:41:11,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 393.3333333333333) internal successors, (2360), 6 states have internal predecessors, (2360), 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 08:41:11,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 802.0) internal successors, (5614), 7 states have internal predecessors, (5614), 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 08:41:11,317 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 802.0) internal successors, (5614), 7 states have internal predecessors, (5614), 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 08:41:11,317 INFO L175 Difference]: Start difference. First operand has 173 places, 149 transitions, 1256 flow. Second operand 6 states and 2360 transitions. [2023-08-26 08:41:11,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 251 transitions, 2305 flow [2023-08-26 08:41:11,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 251 transitions, 2268 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 08:41:11,453 INFO L231 Difference]: Finished difference. Result has 177 places, 150 transitions, 1299 flow [2023-08-26 08:41:11,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1299, PETRI_PLACES=177, PETRI_TRANSITIONS=150} [2023-08-26 08:41:11,454 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 65 predicate places. [2023-08-26 08:41:11,454 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 150 transitions, 1299 flow [2023-08-26 08:41:11,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 378.2) internal successors, (1891), 5 states have internal predecessors, (1891), 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 08:41:11,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:41:11,455 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, 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 08:41:11,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-26 08:41:11,455 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:41:11,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:41:11,455 INFO L85 PathProgramCache]: Analyzing trace with hash 66035392, now seen corresponding path program 5 times [2023-08-26 08:41:11,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:41:11,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480050542] [2023-08-26 08:41:11,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:41:11,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:41:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:41:11,713 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 08:41:11,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:41:11,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480050542] [2023-08-26 08:41:11,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480050542] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:41:11,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:41:11,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 08:41:11,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670146171] [2023-08-26 08:41:11,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:41:11,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 08:41:11,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:41:11,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 08:41:11,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 08:41:11,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 802 [2023-08-26 08:41:11,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 150 transitions, 1299 flow. Second operand has 5 states, 5 states have (on average 378.2) internal successors, (1891), 5 states have internal predecessors, (1891), 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 08:41:11,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:41:11,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 802 [2023-08-26 08:41:11,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:41:13,830 INFO L124 PetriNetUnfolderBase]: 9298/16900 cut-off events. [2023-08-26 08:41:13,830 INFO L125 PetriNetUnfolderBase]: For 60819/61540 co-relation queries the response was YES. [2023-08-26 08:41:13,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65608 conditions, 16900 events. 9298/16900 cut-off events. For 60819/61540 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 141103 event pairs, 2268 based on Foata normal form. 335/16439 useless extension candidates. Maximal degree in co-relation 65556. Up to 9188 conditions per place. [2023-08-26 08:41:13,948 INFO L140 encePairwiseOnDemand]: 788/802 looper letters, 161 selfloop transitions, 18 changer transitions 43/256 dead transitions. [2023-08-26 08:41:13,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 256 transitions, 2367 flow [2023-08-26 08:41:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 08:41:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 08:41:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2364 transitions. [2023-08-26 08:41:13,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4912718204488778 [2023-08-26 08:41:13,951 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2364 transitions. [2023-08-26 08:41:13,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2364 transitions. [2023-08-26 08:41:13,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:41:13,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2364 transitions. [2023-08-26 08:41:13,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 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 08:41:13,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 802.0) internal successors, (5614), 7 states have internal predecessors, (5614), 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 08:41:13,957 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 802.0) internal successors, (5614), 7 states have internal predecessors, (5614), 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 08:41:13,957 INFO L175 Difference]: Start difference. First operand has 177 places, 150 transitions, 1299 flow. Second operand 6 states and 2364 transitions. [2023-08-26 08:41:13,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 256 transitions, 2367 flow [2023-08-26 08:41:14,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 256 transitions, 2347 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 08:41:14,165 INFO L231 Difference]: Finished difference. Result has 180 places, 146 transitions, 1278 flow [2023-08-26 08:41:14,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=1279, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1278, PETRI_PLACES=180, PETRI_TRANSITIONS=146} [2023-08-26 08:41:14,165 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 68 predicate places. [2023-08-26 08:41:14,165 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 146 transitions, 1278 flow [2023-08-26 08:41:14,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 378.2) internal successors, (1891), 5 states have internal predecessors, (1891), 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 08:41:14,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:41:14,166 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, 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 08:41:14,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-26 08:41:14,166 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-08-26 08:41:14,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:41:14,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1704214884, now seen corresponding path program 6 times [2023-08-26 08:41:14,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:41:14,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708364102] [2023-08-26 08:41:14,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:41:14,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:41:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:41:14,408 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 08:41:14,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:41:14,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708364102] [2023-08-26 08:41:14,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708364102] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:41:14,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:41:14,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 08:41:14,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643817247] [2023-08-26 08:41:14,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:41:14,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 08:41:14,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:41:14,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 08:41:14,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 08:41:14,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 802 [2023-08-26 08:41:14,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 146 transitions, 1278 flow. Second operand has 5 states, 5 states have (on average 378.2) internal successors, (1891), 5 states have internal predecessors, (1891), 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 08:41:14,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:41:14,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 802 [2023-08-26 08:41:14,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:41:16,550 INFO L124 PetriNetUnfolderBase]: 8240/15089 cut-off events. [2023-08-26 08:41:16,550 INFO L125 PetriNetUnfolderBase]: For 58823/59387 co-relation queries the response was YES. [2023-08-26 08:41:16,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60712 conditions, 15089 events. 8240/15089 cut-off events. For 58823/59387 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 126644 event pairs, 2142 based on Foata normal form. 276/14564 useless extension candidates. Maximal degree in co-relation 60659. Up to 8960 conditions per place. [2023-08-26 08:41:16,645 INFO L140 encePairwiseOnDemand]: 788/802 looper letters, 0 selfloop transitions, 0 changer transitions 236/236 dead transitions. [2023-08-26 08:41:16,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 236 transitions, 2215 flow [2023-08-26 08:41:16,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 08:41:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 08:41:16,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2352 transitions. [2023-08-26 08:41:16,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48877805486284287 [2023-08-26 08:41:16,647 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2352 transitions. [2023-08-26 08:41:16,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2352 transitions. [2023-08-26 08:41:16,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:41:16,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2352 transitions. [2023-08-26 08:41:16,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 392.0) internal successors, (2352), 6 states have internal predecessors, (2352), 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 08:41:16,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 802.0) internal successors, (5614), 7 states have internal predecessors, (5614), 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 08:41:16,653 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 802.0) internal successors, (5614), 7 states have internal predecessors, (5614), 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 08:41:16,653 INFO L175 Difference]: Start difference. First operand has 180 places, 146 transitions, 1278 flow. Second operand 6 states and 2352 transitions. [2023-08-26 08:41:16,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 236 transitions, 2215 flow [2023-08-26 08:41:16,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 236 transitions, 2156 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-26 08:41:16,804 INFO L231 Difference]: Finished difference. Result has 174 places, 0 transitions, 0 flow [2023-08-26 08:41:16,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=802, PETRI_DIFFERENCE_MINUEND_FLOW=1213, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=174, PETRI_TRANSITIONS=0} [2023-08-26 08:41:16,805 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 62 predicate places. [2023-08-26 08:41:16,805 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 0 transitions, 0 flow [2023-08-26 08:41:16,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 378.2) internal successors, (1891), 5 states have internal predecessors, (1891), 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 08:41:16,807 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (72 of 73 remaining) [2023-08-26 08:41:16,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (71 of 73 remaining) [2023-08-26 08:41:16,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (70 of 73 remaining) [2023-08-26 08:41:16,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (69 of 73 remaining) [2023-08-26 08:41:16,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (68 of 73 remaining) [2023-08-26 08:41:16,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (67 of 73 remaining) [2023-08-26 08:41:16,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (66 of 73 remaining) [2023-08-26 08:41:16,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (65 of 73 remaining) [2023-08-26 08:41:16,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (64 of 73 remaining) [2023-08-26 08:41:16,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (63 of 73 remaining) [2023-08-26 08:41:16,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (62 of 73 remaining) [2023-08-26 08:41:16,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (61 of 73 remaining) [2023-08-26 08:41:16,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (60 of 73 remaining) [2023-08-26 08:41:16,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (59 of 73 remaining) [2023-08-26 08:41:16,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (58 of 73 remaining) [2023-08-26 08:41:16,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (57 of 73 remaining) [2023-08-26 08:41:16,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (56 of 73 remaining) [2023-08-26 08:41:16,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (55 of 73 remaining) [2023-08-26 08:41:16,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (54 of 73 remaining) [2023-08-26 08:41:16,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (53 of 73 remaining) [2023-08-26 08:41:16,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (52 of 73 remaining) [2023-08-26 08:41:16,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (51 of 73 remaining) [2023-08-26 08:41:16,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (50 of 73 remaining) [2023-08-26 08:41:16,810 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (49 of 73 remaining) [2023-08-26 08:41:16,810 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (48 of 73 remaining) [2023-08-26 08:41:16,810 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (47 of 73 remaining) [2023-08-26 08:41:16,810 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (46 of 73 remaining) [2023-08-26 08:41:16,810 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (45 of 73 remaining) [2023-08-26 08:41:16,810 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (44 of 73 remaining) [2023-08-26 08:41:16,810 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (43 of 73 remaining) [2023-08-26 08:41:16,810 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (42 of 73 remaining) [2023-08-26 08:41:16,810 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (41 of 73 remaining) [2023-08-26 08:41:16,810 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (40 of 73 remaining) [2023-08-26 08:41:16,810 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (39 of 73 remaining) [2023-08-26 08:41:16,810 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (38 of 73 remaining) [2023-08-26 08:41:16,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (37 of 73 remaining) [2023-08-26 08:41:16,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (36 of 73 remaining) [2023-08-26 08:41:16,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (35 of 73 remaining) [2023-08-26 08:41:16,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (34 of 73 remaining) [2023-08-26 08:41:16,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (33 of 73 remaining) [2023-08-26 08:41:16,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (32 of 73 remaining) [2023-08-26 08:41:16,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (31 of 73 remaining) [2023-08-26 08:41:16,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONASSERT (30 of 73 remaining) [2023-08-26 08:41:16,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 73 remaining) [2023-08-26 08:41:16,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 73 remaining) [2023-08-26 08:41:16,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 73 remaining) [2023-08-26 08:41:16,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 73 remaining) [2023-08-26 08:41:16,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 73 remaining) [2023-08-26 08:41:16,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 73 remaining) [2023-08-26 08:41:16,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 73 remaining) [2023-08-26 08:41:16,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 73 remaining) [2023-08-26 08:41:16,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (21 of 73 remaining) [2023-08-26 08:41:16,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 73 remaining) [2023-08-26 08:41:16,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 73 remaining) [2023-08-26 08:41:16,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 73 remaining) [2023-08-26 08:41:16,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 73 remaining) [2023-08-26 08:41:16,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 73 remaining) [2023-08-26 08:41:16,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 73 remaining) [2023-08-26 08:41:16,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 73 remaining) [2023-08-26 08:41:16,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 73 remaining) [2023-08-26 08:41:16,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 73 remaining) [2023-08-26 08:41:16,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 73 remaining) [2023-08-26 08:41:16,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 73 remaining) [2023-08-26 08:41:16,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 73 remaining) [2023-08-26 08:41:16,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 73 remaining) [2023-08-26 08:41:16,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 73 remaining) [2023-08-26 08:41:16,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 73 remaining) [2023-08-26 08:41:16,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 73 remaining) [2023-08-26 08:41:16,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 73 remaining) [2023-08-26 08:41:16,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 73 remaining) [2023-08-26 08:41:16,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 73 remaining) [2023-08-26 08:41:16,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 73 remaining) [2023-08-26 08:41:16,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 73 remaining) [2023-08-26 08:41:16,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-08-26 08:41:16,813 INFO L445 BasicCegarLoop]: Path program histogram: [6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:41:16,818 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 08:41:16,818 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 08:41:16,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 08:41:16 BasicIcfg [2023-08-26 08:41:16,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 08:41:16,822 INFO L158 Benchmark]: Toolchain (without parser) took 97807.22ms. Allocated memory was 356.5MB in the beginning and 15.2GB in the end (delta: 14.9GB). Free memory was 332.2MB in the beginning and 9.9GB in the end (delta: -9.5GB). Peak memory consumption was 5.4GB. Max. memory is 16.0GB. [2023-08-26 08:41:16,822 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 356.5MB. Free memory is still 332.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 08:41:16,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.93ms. Allocated memory is still 356.5MB. Free memory was 332.2MB in the beginning and 320.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-26 08:41:16,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.00ms. Allocated memory is still 356.5MB. Free memory was 320.1MB in the beginning and 317.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 08:41:16,823 INFO L158 Benchmark]: Boogie Preprocessor took 47.45ms. Allocated memory is still 356.5MB. Free memory was 317.3MB in the beginning and 315.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 08:41:16,823 INFO L158 Benchmark]: RCFGBuilder took 644.76ms. Allocated memory is still 356.5MB. Free memory was 315.4MB in the beginning and 287.5MB in the end (delta: 27.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-26 08:41:16,823 INFO L158 Benchmark]: TraceAbstraction took 96845.80ms. Allocated memory was 356.5MB in the beginning and 15.2GB in the end (delta: 14.9GB). Free memory was 286.8MB in the beginning and 9.9GB in the end (delta: -9.6GB). Peak memory consumption was 5.3GB. Max. memory is 16.0GB. [2023-08-26 08:41:16,824 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.13ms. Allocated memory is still 356.5MB. Free memory is still 332.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 205.93ms. Allocated memory is still 356.5MB. Free memory was 332.2MB in the beginning and 320.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.00ms. Allocated memory is still 356.5MB. Free memory was 320.1MB in the beginning and 317.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 47.45ms. Allocated memory is still 356.5MB. Free memory was 317.3MB in the beginning and 315.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 644.76ms. Allocated memory is still 356.5MB. Free memory was 315.4MB in the beginning and 287.5MB in the end (delta: 27.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 96845.80ms. Allocated memory was 356.5MB in the beginning and 15.2GB in the end (delta: 14.9GB). Free memory was 286.8MB in the beginning and 9.9GB in the end (delta: -9.6GB). Peak memory consumption was 5.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.4s, 379 PlacesBefore, 112 PlacesAfterwards, 390 TransitionsBefore, 115 TransitionsAfterwards, 42486 CoEnabledTransitionPairs, 9 FixpointIterations, 159 TrivialSequentialCompositions, 165 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 56 ConcurrentYvCompositions, 8 ChoiceCompositions, 398 TotalNumberOfCompositions, 158594 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 86030, independent: 84529, independent conditional: 0, independent unconditional: 84529, dependent: 1501, dependent conditional: 0, dependent unconditional: 1501, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 25202, independent: 25071, independent conditional: 0, independent unconditional: 25071, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 86030, independent: 59458, independent conditional: 0, independent unconditional: 59458, dependent: 1370, dependent conditional: 0, dependent unconditional: 1370, unknown: 25202, unknown conditional: 0, unknown unconditional: 25202] , Statistics on independence cache: Total cache size (in pairs): 2477, Positive cache size: 2405, Positive conditional cache size: 0, Positive unconditional cache size: 2405, Negative cache size: 72, Negative conditional cache size: 0, Negative unconditional cache size: 72, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 21]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 591 locations, 73 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: 96.6s, OverallIterations: 35, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 84.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1656 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1656 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5841 IncrementalHoareTripleChecker+Invalid, 5923 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 26 mSDtfsCounter, 5841 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1299occurred in iteration=33, InterpolantAutomatonStates: 136, 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.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1040 NumberOfCodeBlocks, 1040 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1005 ConstructedInterpolants, 0 QuantifiedInterpolants, 3103 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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 - AllSpecificationsHoldResult: All specifications hold 43 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-08-26 08:41:16,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...