/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/popl20-three-array-max.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 10:53:23,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 10:53:23,390 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 10:53:23,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 10:53:23,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 10:53:23,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 10:53:23,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 10:53:23,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 10:53:23,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 10:53:23,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 10:53:23,430 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 10:53:23,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 10:53:23,430 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 10:53:23,431 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 10:53:23,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 10:53:23,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 10:53:23,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 10:53:23,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 10:53:23,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 10:53:23,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 10:53:23,433 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 10:53:23,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 10:53:23,434 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 10:53:23,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 10:53:23,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 10:53:23,435 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 10:53:23,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 10:53:23,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 10:53:23,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 10:53:23,436 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 10:53:23,437 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 10:53:23,437 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 10:53:23,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 10:53:23,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 10:53:23,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 10:53:23,437 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 10:53:23,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 10:53:23,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 10:53:23,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 10:53:23,747 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 10:53:23,748 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 10:53:23,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2023-08-26 10:53:24,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 10:53:25,203 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 10:53:25,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2023-08-26 10:53:25,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb17be7e/66a2cd55847c4bb4994996139244bb86/FLAG9d298292a [2023-08-26 10:53:25,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb17be7e/66a2cd55847c4bb4994996139244bb86 [2023-08-26 10:53:25,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 10:53:25,227 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 10:53:25,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 10:53:25,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 10:53:25,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 10:53:25,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 10:53:25" (1/1) ... [2023-08-26 10:53:25,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2296072e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:53:25, skipping insertion in model container [2023-08-26 10:53:25,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 10:53:25" (1/1) ... [2023-08-26 10:53:25,252 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 10:53:25,402 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 10:53:25,410 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 10:53:25,442 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 10:53:25,452 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 10:53:25,452 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 10:53:25,458 INFO L206 MainTranslator]: Completed translation [2023-08-26 10:53:25,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:53:25 WrapperNode [2023-08-26 10:53:25,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 10:53:25,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 10:53:25,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 10:53:25,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 10:53:25,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:53:25" (1/1) ... [2023-08-26 10:53:25,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:53:25" (1/1) ... [2023-08-26 10:53:25,542 INFO L138 Inliner]: procedures = 26, calls = 58, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 381 [2023-08-26 10:53:25,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 10:53:25,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 10:53:25,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 10:53:25,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 10:53:25,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:53:25" (1/1) ... [2023-08-26 10:53:25,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:53:25" (1/1) ... [2023-08-26 10:53:25,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:53:25" (1/1) ... [2023-08-26 10:53:25,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:53:25" (1/1) ... [2023-08-26 10:53:25,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:53:25" (1/1) ... [2023-08-26 10:53:25,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:53:25" (1/1) ... [2023-08-26 10:53:25,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:53:25" (1/1) ... [2023-08-26 10:53:25,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:53:25" (1/1) ... [2023-08-26 10:53:25,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 10:53:25,632 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 10:53:25,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 10:53:25,632 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 10:53:25,633 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:53:25" (1/1) ... [2023-08-26 10:53:25,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 10:53:25,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:53:25,667 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 10:53:25,681 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 10:53:25,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 10:53:25,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 10:53:25,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 10:53:25,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 10:53:25,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 10:53:25,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 10:53:25,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 10:53:25,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 10:53:25,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 10:53:25,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 10:53:25,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 10:53:25,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 10:53:25,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 10:53:25,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-26 10:53:25,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 10:53:25,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 10:53:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 10:53:25,711 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 10:53:25,854 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 10:53:25,856 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 10:53:26,621 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 10:53:26,744 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 10:53:26,744 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-26 10:53:26,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 10:53:26 BoogieIcfgContainer [2023-08-26 10:53:26,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 10:53:26,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 10:53:26,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 10:53:26,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 10:53:26,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 10:53:25" (1/3) ... [2023-08-26 10:53:26,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c8b6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 10:53:26, skipping insertion in model container [2023-08-26 10:53:26,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:53:25" (2/3) ... [2023-08-26 10:53:26,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c8b6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 10:53:26, skipping insertion in model container [2023-08-26 10:53:26,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 10:53:26" (3/3) ... [2023-08-26 10:53:26,753 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2023-08-26 10:53:26,765 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 10:53:26,766 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2023-08-26 10:53:26,766 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 10:53:26,881 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-26 10:53:26,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 489 places, 506 transitions, 1036 flow [2023-08-26 10:53:27,091 INFO L124 PetriNetUnfolderBase]: 27/503 cut-off events. [2023-08-26 10:53:27,091 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 10:53:27,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 503 events. 27/503 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 651 event pairs, 0 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 404. Up to 2 conditions per place. [2023-08-26 10:53:27,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 489 places, 506 transitions, 1036 flow [2023-08-26 10:53:27,112 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 475 places, 492 transitions, 1002 flow [2023-08-26 10:53:27,115 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 10:53:27,126 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 475 places, 492 transitions, 1002 flow [2023-08-26 10:53:27,128 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 475 places, 492 transitions, 1002 flow [2023-08-26 10:53:27,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 475 places, 492 transitions, 1002 flow [2023-08-26 10:53:27,221 INFO L124 PetriNetUnfolderBase]: 27/492 cut-off events. [2023-08-26 10:53:27,222 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 10:53:27,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 492 events. 27/492 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 652 event pairs, 0 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 404. Up to 2 conditions per place. [2023-08-26 10:53:27,233 INFO L119 LiptonReduction]: Number of co-enabled transitions 14004 [2023-08-26 10:53:57,768 INFO L134 LiptonReduction]: Checked pairs total: 116695 [2023-08-26 10:53:57,768 INFO L136 LiptonReduction]: Total number of compositions: 512 [2023-08-26 10:53:57,781 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 10:53:57,787 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;@36fe4053, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 10:53:57,787 INFO L358 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2023-08-26 10:53:57,789 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 10:53:57,789 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 10:53:57,789 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 10:53:57,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:53:57,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 10:53:57,790 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-26 10:53:57,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:53:57,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1982, now seen corresponding path program 1 times [2023-08-26 10:53:57,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:53:57,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933442121] [2023-08-26 10:53:57,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:53:57,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:53:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:53:57,898 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 10:53:57,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:53:57,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933442121] [2023-08-26 10:53:57,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933442121] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:53:57,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:53:57,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 10:53:57,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734282202] [2023-08-26 10:53:57,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:53:57,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 10:53:57,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:53:57,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 10:53:57,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 10:53:57,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 464 out of 1018 [2023-08-26 10:53:57,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 144 transitions, 306 flow. Second operand has 2 states, 2 states have (on average 464.5) internal successors, (929), 2 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:53:57,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:53:57,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 464 of 1018 [2023-08-26 10:53:57,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:53:58,423 INFO L124 PetriNetUnfolderBase]: 1139/2880 cut-off events. [2023-08-26 10:53:58,424 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-08-26 10:53:58,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4485 conditions, 2880 events. 1139/2880 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 22220 event pairs, 599 based on Foata normal form. 437/2712 useless extension candidates. Maximal degree in co-relation 4044. Up to 1506 conditions per place. [2023-08-26 10:53:58,446 INFO L140 encePairwiseOnDemand]: 972/1018 looper letters, 36 selfloop transitions, 0 changer transitions 0/98 dead transitions. [2023-08-26 10:53:58,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 98 transitions, 286 flow [2023-08-26 10:53:58,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 10:53:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 10:53:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1010 transitions. [2023-08-26 10:53:58,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960707269155206 [2023-08-26 10:53:58,467 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1010 transitions. [2023-08-26 10:53:58,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1010 transitions. [2023-08-26 10:53:58,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:53:58,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1010 transitions. [2023-08-26 10:53:58,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 505.0) internal successors, (1010), 2 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:53:58,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 1018.0) internal successors, (3054), 3 states have internal predecessors, (3054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:53:58,488 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 1018.0) internal successors, (3054), 3 states have internal predecessors, (3054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:53:58,490 INFO L175 Difference]: Start difference. First operand has 142 places, 144 transitions, 306 flow. Second operand 2 states and 1010 transitions. [2023-08-26 10:53:58,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 98 transitions, 286 flow [2023-08-26 10:53:58,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 98 transitions, 274 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-26 10:53:58,498 INFO L231 Difference]: Finished difference. Result has 94 places, 98 transitions, 202 flow [2023-08-26 10:53:58,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=202, PETRI_PLACES=94, PETRI_TRANSITIONS=98} [2023-08-26 10:53:58,504 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -48 predicate places. [2023-08-26 10:53:58,504 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 98 transitions, 202 flow [2023-08-26 10:53:58,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 464.5) internal successors, (929), 2 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:53:58,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:53:58,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:53:58,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 10:53:58,506 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-26 10:53:58,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:53:58,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1131874658, now seen corresponding path program 1 times [2023-08-26 10:53:58,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:53:58,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106496775] [2023-08-26 10:53:58,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:53:58,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:53:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:53:58,777 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 10:53:58,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:53:58,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106496775] [2023-08-26 10:53:58,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106496775] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:53:58,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:53:58,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:53:58,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585957299] [2023-08-26 10:53:58,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:53:58,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:53:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:53:58,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:53:58,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:53:58,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 1018 [2023-08-26 10:53:58,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 98 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 442.3333333333333) internal successors, (1327), 3 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:53:58,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:53:58,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 1018 [2023-08-26 10:53:58,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:53:59,285 INFO L124 PetriNetUnfolderBase]: 2055/4529 cut-off events. [2023-08-26 10:53:59,285 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-08-26 10:53:59,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7429 conditions, 4529 events. 2055/4529 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 33591 event pairs, 1462 based on Foata normal form. 0/3580 useless extension candidates. Maximal degree in co-relation 7426. Up to 2836 conditions per place. [2023-08-26 10:53:59,311 INFO L140 encePairwiseOnDemand]: 1014/1018 looper letters, 39 selfloop transitions, 1 changer transitions 0/95 dead transitions. [2023-08-26 10:53:59,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 95 transitions, 276 flow [2023-08-26 10:53:59,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:53:59,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:53:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1363 transitions. [2023-08-26 10:53:59,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44629993451211525 [2023-08-26 10:53:59,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1363 transitions. [2023-08-26 10:53:59,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1363 transitions. [2023-08-26 10:53:59,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:53:59,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1363 transitions. [2023-08-26 10:53:59,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:53:59,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:53:59,328 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:53:59,328 INFO L175 Difference]: Start difference. First operand has 94 places, 98 transitions, 202 flow. Second operand 3 states and 1363 transitions. [2023-08-26 10:53:59,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 95 transitions, 276 flow [2023-08-26 10:53:59,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 95 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 10:53:59,332 INFO L231 Difference]: Finished difference. Result has 93 places, 95 transitions, 198 flow [2023-08-26 10:53:59,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=93, PETRI_TRANSITIONS=95} [2023-08-26 10:53:59,334 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -49 predicate places. [2023-08-26 10:53:59,334 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 95 transitions, 198 flow [2023-08-26 10:53:59,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 442.3333333333333) internal successors, (1327), 3 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:53:59,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:53:59,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:53:59,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 10:53:59,343 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-26 10:53:59,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:53:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1105207622, now seen corresponding path program 1 times [2023-08-26 10:53:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:53:59,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827476452] [2023-08-26 10:53:59,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:53:59,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:53:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:53:59,474 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 10:53:59,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:53:59,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827476452] [2023-08-26 10:53:59,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827476452] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:53:59,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:53:59,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:53:59,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754585491] [2023-08-26 10:53:59,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:53:59,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:53:59,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:53:59,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:53:59,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:53:59,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 1018 [2023-08-26 10:53:59,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 95 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 451.6666666666667) internal successors, (1355), 3 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:53:59,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:53:59,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 1018 [2023-08-26 10:53:59,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:53:59,923 INFO L124 PetriNetUnfolderBase]: 1507/3592 cut-off events. [2023-08-26 10:53:59,924 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-08-26 10:53:59,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5639 conditions, 3592 events. 1507/3592 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 28062 event pairs, 828 based on Foata normal form. 0/2973 useless extension candidates. Maximal degree in co-relation 5635. Up to 1987 conditions per place. [2023-08-26 10:53:59,947 INFO L140 encePairwiseOnDemand]: 1015/1018 looper letters, 38 selfloop transitions, 1 changer transitions 0/93 dead transitions. [2023-08-26 10:53:59,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 93 transitions, 272 flow [2023-08-26 10:53:59,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:53:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:53:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1388 transitions. [2023-08-26 10:53:59,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4544859201047806 [2023-08-26 10:53:59,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1388 transitions. [2023-08-26 10:53:59,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1388 transitions. [2023-08-26 10:53:59,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:53:59,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1388 transitions. [2023-08-26 10:53:59,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 462.6666666666667) internal successors, (1388), 3 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:53:59,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:53:59,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:53:59,962 INFO L175 Difference]: Start difference. First operand has 93 places, 95 transitions, 198 flow. Second operand 3 states and 1388 transitions. [2023-08-26 10:53:59,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 93 transitions, 272 flow [2023-08-26 10:53:59,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 93 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:53:59,966 INFO L231 Difference]: Finished difference. Result has 92 places, 93 transitions, 195 flow [2023-08-26 10:53:59,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=92, PETRI_TRANSITIONS=93} [2023-08-26 10:53:59,967 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -50 predicate places. [2023-08-26 10:53:59,967 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 93 transitions, 195 flow [2023-08-26 10:53:59,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.6666666666667) internal successors, (1355), 3 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:53:59,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:53:59,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:53:59,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 10:53:59,972 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-26 10:53:59,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:53:59,972 INFO L85 PathProgramCache]: Analyzing trace with hash 796348320, now seen corresponding path program 1 times [2023-08-26 10:53:59,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:53:59,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163490255] [2023-08-26 10:53:59,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:53:59,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:00,168 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 10:54:00,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:00,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163490255] [2023-08-26 10:54:00,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163490255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:00,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:00,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:54:00,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21353401] [2023-08-26 10:54:00,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:00,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:54:00,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:00,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:54:00,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:54:00,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 1018 [2023-08-26 10:54:00,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 93 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:00,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:00,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 1018 [2023-08-26 10:54:00,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:00,585 INFO L124 PetriNetUnfolderBase]: 1139/2775 cut-off events. [2023-08-26 10:54:00,586 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-08-26 10:54:00,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4324 conditions, 2775 events. 1139/2775 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 20797 event pairs, 599 based on Foata normal form. 0/2194 useless extension candidates. Maximal degree in co-relation 4320. Up to 1506 conditions per place. [2023-08-26 10:54:00,602 INFO L140 encePairwiseOnDemand]: 1015/1018 looper letters, 35 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2023-08-26 10:54:00,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 94 transitions, 271 flow [2023-08-26 10:54:00,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:54:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:54:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2023-08-26 10:54:00,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4151931892599869 [2023-08-26 10:54:00,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1268 transitions. [2023-08-26 10:54:00,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1268 transitions. [2023-08-26 10:54:00,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:00,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1268 transitions. [2023-08-26 10:54:00,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 422.6666666666667) internal successors, (1268), 3 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:00,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:00,617 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:00,617 INFO L175 Difference]: Start difference. First operand has 92 places, 93 transitions, 195 flow. Second operand 3 states and 1268 transitions. [2023-08-26 10:54:00,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 94 transitions, 271 flow [2023-08-26 10:54:00,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:54:00,619 INFO L231 Difference]: Finished difference. Result has 94 places, 94 transitions, 206 flow [2023-08-26 10:54:00,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=94, PETRI_TRANSITIONS=94} [2023-08-26 10:54:00,622 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -48 predicate places. [2023-08-26 10:54:00,622 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 94 transitions, 206 flow [2023-08-26 10:54:00,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:00,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:00,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:54:00,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 10:54:00,623 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-26 10:54:00,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:00,624 INFO L85 PathProgramCache]: Analyzing trace with hash 532974789, now seen corresponding path program 1 times [2023-08-26 10:54:00,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:00,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741425623] [2023-08-26 10:54:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:00,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:54:00,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:00,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741425623] [2023-08-26 10:54:00,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741425623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:00,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:00,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 10:54:00,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296850271] [2023-08-26 10:54:00,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:00,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 10:54:00,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:00,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 10:54:00,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 10:54:00,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 1018 [2023-08-26 10:54:00,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 400.75) internal successors, (1603), 4 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:00,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:00,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 1018 [2023-08-26 10:54:00,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:01,215 INFO L124 PetriNetUnfolderBase]: 1139/2777 cut-off events. [2023-08-26 10:54:01,215 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-08-26 10:54:01,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4334 conditions, 2777 events. 1139/2777 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 20772 event pairs, 599 based on Foata normal form. 0/2195 useless extension candidates. Maximal degree in co-relation 4329. Up to 1505 conditions per place. [2023-08-26 10:54:01,237 INFO L140 encePairwiseOnDemand]: 1011/1018 looper letters, 33 selfloop transitions, 6 changer transitions 0/96 dead transitions. [2023-08-26 10:54:01,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 288 flow [2023-08-26 10:54:01,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 10:54:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 10:54:01,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1633 transitions. [2023-08-26 10:54:01,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40103143418467585 [2023-08-26 10:54:01,241 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1633 transitions. [2023-08-26 10:54:01,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1633 transitions. [2023-08-26 10:54:01,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:01,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1633 transitions. [2023-08-26 10:54:01,246 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 10:54:01,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1018.0) internal successors, (5090), 5 states have internal predecessors, (5090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:01,254 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1018.0) internal successors, (5090), 5 states have internal predecessors, (5090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:01,254 INFO L175 Difference]: Start difference. First operand has 94 places, 94 transitions, 206 flow. Second operand 4 states and 1633 transitions. [2023-08-26 10:54:01,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 288 flow [2023-08-26 10:54:01,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 284 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 10:54:01,260 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 230 flow [2023-08-26 10:54:01,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2023-08-26 10:54:01,262 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -45 predicate places. [2023-08-26 10:54:01,262 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 230 flow [2023-08-26 10:54:01,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 400.75) internal successors, (1603), 4 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:01,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:01,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:54:01,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 10:54:01,264 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-26 10:54:01,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash -343018578, now seen corresponding path program 1 times [2023-08-26 10:54:01,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:01,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739847426] [2023-08-26 10:54:01,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:01,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:01,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 10:54:01,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:01,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739847426] [2023-08-26 10:54:01,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739847426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:01,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:01,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:54:01,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992452505] [2023-08-26 10:54:01,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:01,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:54:01,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:01,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:54:01,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:54:01,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 1018 [2023-08-26 10:54:01,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:01,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:01,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 1018 [2023-08-26 10:54:01,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:05,362 INFO L124 PetriNetUnfolderBase]: 18088/24524 cut-off events. [2023-08-26 10:54:05,362 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-26 10:54:05,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48031 conditions, 24524 events. 18088/24524 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 144945 event pairs, 5719 based on Foata normal form. 0/19471 useless extension candidates. Maximal degree in co-relation 48025. Up to 13554 conditions per place. [2023-08-26 10:54:05,541 INFO L140 encePairwiseOnDemand]: 1011/1018 looper letters, 236 selfloop transitions, 9 changer transitions 0/265 dead transitions. [2023-08-26 10:54:05,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 265 transitions, 1061 flow [2023-08-26 10:54:05,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:54:05,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:54:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2487 transitions. [2023-08-26 10:54:05,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4071709233791749 [2023-08-26 10:54:05,549 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2487 transitions. [2023-08-26 10:54:05,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2487 transitions. [2023-08-26 10:54:05,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:05,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2487 transitions. [2023-08-26 10:54:05,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 414.5) internal successors, (2487), 6 states have internal predecessors, (2487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:05,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:05,565 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:05,565 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 230 flow. Second operand 6 states and 2487 transitions. [2023-08-26 10:54:05,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 265 transitions, 1061 flow [2023-08-26 10:54:05,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 265 transitions, 1060 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:54:05,570 INFO L231 Difference]: Finished difference. Result has 106 places, 104 transitions, 293 flow [2023-08-26 10:54:05,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=106, PETRI_TRANSITIONS=104} [2023-08-26 10:54:05,573 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -36 predicate places. [2023-08-26 10:54:05,573 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 104 transitions, 293 flow [2023-08-26 10:54:05,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:05,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:05,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:54:05,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 10:54:05,575 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-26 10:54:05,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:05,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1021553860, now seen corresponding path program 1 times [2023-08-26 10:54:05,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:05,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522144125] [2023-08-26 10:54:05,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:05,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 10:54:05,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:05,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522144125] [2023-08-26 10:54:05,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522144125] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:54:05,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370858281] [2023-08-26 10:54:05,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:05,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:54:05,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:54:05,760 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:54:05,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 10:54:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:06,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 10:54:06,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:54:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 10:54:06,159 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:54:06,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 10:54:06,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370858281] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:54:06,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:54:06,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-26 10:54:06,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926501087] [2023-08-26 10:54:06,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:54:06,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 10:54:06,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:06,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 10:54:06,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-08-26 10:54:06,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 1018 [2023-08-26 10:54:06,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 104 transitions, 293 flow. Second operand has 12 states, 12 states have (on average 368.25) internal successors, (4419), 12 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:06,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:06,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 1018 [2023-08-26 10:54:06,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:07,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1833] L61-2-->L61-6: Formula: (let ((.cse7 (* |v_thread2Thread1of1ForFork2_~i~1#1_58| 4))) (let ((.cse4 (+ v_~C~0.offset_140 .cse7)) (.cse3 (+ v_~B~0.offset_138 .cse7)) (.cse2 (+ v_~A~0.offset_136 .cse7)) (.cse0 (+ |v_thread2Thread1of1ForFork2_~i~1#1_58| 1)) (.cse1 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_#race~B~0_97| 0) (= |v_#race~A~0_99| 0) (= .cse0 |v_thread2Thread1of1ForFork2_~i~1#1_57|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| (ite (or (<= |v_thread2Thread1of1ForFork2_plus_~b#1_17| 0) (<= .cse1 2147483647)) 1 0)) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| (select (select |v_#memory_int_267| v_~A~0.base_136) .cse2)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| (select (select |v_#memory_int_267| v_~B~0.base_138) .cse3)) (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483648)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|) (= (store |v_#memory_int_267| v_~C~0.base_140 (store (select |v_#memory_int_267| v_~C~0.base_140) .cse4 |v_thread2Thread1of1ForFork2_plus_#res#1_17|)) |v_#memory_int_266|) (<= |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483647) (= |v_#race_765| (let ((.cse5 (let ((.cse9 (store |v_#race_766| v_~A~0.base_136 (store (store (store (store (select |v_#race_766| v_~A~0.base_136) .cse2 0) (+ v_~A~0.offset_136 .cse7 1) 0) (+ v_~A~0.offset_136 2 .cse7) 0) (+ v_~A~0.offset_136 3 .cse7) 0)))) (store .cse9 v_~B~0.base_138 (store (store (store (store (select .cse9 v_~B~0.base_138) .cse3 0) (+ v_~B~0.offset_138 .cse7 1) 0) (+ v_~B~0.offset_138 2 .cse7) 0) (+ v_~B~0.offset_138 3 .cse7) 0))))) (store .cse5 v_~C~0.base_140 (let ((.cse8 (+ v_~C~0.offset_140 3 .cse7))) (let ((.cse6 (select (select |v_#race_765| v_~C~0.base_140) .cse8))) (store (store (store (store (select .cse5 v_~C~0.base_140) .cse4 .cse6) (+ v_~C~0.offset_140 .cse7 1) .cse6) (+ v_~C~0.offset_140 2 .cse7) .cse6) .cse8 .cse6)))))) (= v_~p~0_45 .cse0) (< |v_thread2Thread1of1ForFork2_~i~1#1_58| v_~N~0_81) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| |v_thread2Thread1of1ForFork2_plus_~a#1_17|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|) (= |v_thread2Thread1of1ForFork2_plus_#res#1_17| .cse1) (= 0 |v_#race~C~0_145|)))) InVars {#race=|v_#race_766|, ~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_58|, ~C~0.base=v_~C~0.base_140, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_267|, ~N~0=v_~N~0_81, ~B~0.offset=v_~B~0.offset_138} OutVars{~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_57|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_17|, ~C~0.base=v_~C~0.base_140, thread2Thread1of1ForFork2_#t~ret11#1=|v_thread2Thread1of1ForFork2_#t~ret11#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, #race~B~0=|v_#race~B~0_97|, thread2Thread1of1ForFork2_#t~nondet13#1=|v_thread2Thread1of1ForFork2_#t~nondet13#1_13|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_29|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_17|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_17|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_21|, ~B~0.offset=v_~B~0.offset_138, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_17|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_17|, #race=|v_#race_765|, ~N~0=v_~N~0_81, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_17|, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, #race~p~0=|v_#race~p~0_58|, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_266|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_13|, ~p~0=v_~p~0_45, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_99|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~ret11#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, #race~B~0, thread2Thread1of1ForFork2_#t~nondet13#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, thread2Thread1of1ForFork2_#t~post8#1, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][83], [501#(= |#race~A~0| 0), Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 99#L48-7true, 533#(and (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 1)), 492#true, 510#(<= 1 ~N~0), 325#L73-4true, Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 516#true, 432#L61-6true, Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 92#L109-6true]) [2023-08-26 10:54:07,161 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-26 10:54:07,161 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-26 10:54:07,161 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 10:54:07,161 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-26 10:54:07,162 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1833] L61-2-->L61-6: Formula: (let ((.cse7 (* |v_thread2Thread1of1ForFork2_~i~1#1_58| 4))) (let ((.cse4 (+ v_~C~0.offset_140 .cse7)) (.cse3 (+ v_~B~0.offset_138 .cse7)) (.cse2 (+ v_~A~0.offset_136 .cse7)) (.cse0 (+ |v_thread2Thread1of1ForFork2_~i~1#1_58| 1)) (.cse1 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_#race~B~0_97| 0) (= |v_#race~A~0_99| 0) (= .cse0 |v_thread2Thread1of1ForFork2_~i~1#1_57|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| (ite (or (<= |v_thread2Thread1of1ForFork2_plus_~b#1_17| 0) (<= .cse1 2147483647)) 1 0)) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| (select (select |v_#memory_int_267| v_~A~0.base_136) .cse2)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| (select (select |v_#memory_int_267| v_~B~0.base_138) .cse3)) (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483648)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|) (= (store |v_#memory_int_267| v_~C~0.base_140 (store (select |v_#memory_int_267| v_~C~0.base_140) .cse4 |v_thread2Thread1of1ForFork2_plus_#res#1_17|)) |v_#memory_int_266|) (<= |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483647) (= |v_#race_765| (let ((.cse5 (let ((.cse9 (store |v_#race_766| v_~A~0.base_136 (store (store (store (store (select |v_#race_766| v_~A~0.base_136) .cse2 0) (+ v_~A~0.offset_136 .cse7 1) 0) (+ v_~A~0.offset_136 2 .cse7) 0) (+ v_~A~0.offset_136 3 .cse7) 0)))) (store .cse9 v_~B~0.base_138 (store (store (store (store (select .cse9 v_~B~0.base_138) .cse3 0) (+ v_~B~0.offset_138 .cse7 1) 0) (+ v_~B~0.offset_138 2 .cse7) 0) (+ v_~B~0.offset_138 3 .cse7) 0))))) (store .cse5 v_~C~0.base_140 (let ((.cse8 (+ v_~C~0.offset_140 3 .cse7))) (let ((.cse6 (select (select |v_#race_765| v_~C~0.base_140) .cse8))) (store (store (store (store (select .cse5 v_~C~0.base_140) .cse4 .cse6) (+ v_~C~0.offset_140 .cse7 1) .cse6) (+ v_~C~0.offset_140 2 .cse7) .cse6) .cse8 .cse6)))))) (= v_~p~0_45 .cse0) (< |v_thread2Thread1of1ForFork2_~i~1#1_58| v_~N~0_81) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| |v_thread2Thread1of1ForFork2_plus_~a#1_17|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|) (= |v_thread2Thread1of1ForFork2_plus_#res#1_17| .cse1) (= 0 |v_#race~C~0_145|)))) InVars {#race=|v_#race_766|, ~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_58|, ~C~0.base=v_~C~0.base_140, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_267|, ~N~0=v_~N~0_81, ~B~0.offset=v_~B~0.offset_138} OutVars{~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_57|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_17|, ~C~0.base=v_~C~0.base_140, thread2Thread1of1ForFork2_#t~ret11#1=|v_thread2Thread1of1ForFork2_#t~ret11#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, #race~B~0=|v_#race~B~0_97|, thread2Thread1of1ForFork2_#t~nondet13#1=|v_thread2Thread1of1ForFork2_#t~nondet13#1_13|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_29|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_17|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_17|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_21|, ~B~0.offset=v_~B~0.offset_138, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_17|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_17|, #race=|v_#race_765|, ~N~0=v_~N~0_81, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_17|, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, #race~p~0=|v_#race~p~0_58|, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_266|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_13|, ~p~0=v_~p~0_45, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_99|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~ret11#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, #race~B~0, thread2Thread1of1ForFork2_#t~nondet13#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, thread2Thread1of1ForFork2_#t~post8#1, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][83], [501#(= |#race~A~0| 0), 24#L76true, Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 99#L48-7true, 533#(and (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 1)), 492#true, 510#(<= 1 ~N~0), Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 516#true, 432#L61-6true, Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 92#L109-6true]) [2023-08-26 10:54:07,162 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-26 10:54:07,162 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-26 10:54:07,162 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 10:54:07,162 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-26 10:54:07,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1464] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem41#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][102], [501#(= |#race~A~0| 0), Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 492#true, 510#(<= 1 ~N~0), 325#L73-4true, Black: 516#true, Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 440#L109-7true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 360#thread2EXITtrue, Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 532#(<= ~N~0 1)]) [2023-08-26 10:54:07,266 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-26 10:54:07,266 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-26 10:54:07,266 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 10:54:07,267 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 10:54:07,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1833] L61-2-->L61-6: Formula: (let ((.cse7 (* |v_thread2Thread1of1ForFork2_~i~1#1_58| 4))) (let ((.cse4 (+ v_~C~0.offset_140 .cse7)) (.cse3 (+ v_~B~0.offset_138 .cse7)) (.cse2 (+ v_~A~0.offset_136 .cse7)) (.cse0 (+ |v_thread2Thread1of1ForFork2_~i~1#1_58| 1)) (.cse1 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_#race~B~0_97| 0) (= |v_#race~A~0_99| 0) (= .cse0 |v_thread2Thread1of1ForFork2_~i~1#1_57|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| (ite (or (<= |v_thread2Thread1of1ForFork2_plus_~b#1_17| 0) (<= .cse1 2147483647)) 1 0)) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| (select (select |v_#memory_int_267| v_~A~0.base_136) .cse2)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| (select (select |v_#memory_int_267| v_~B~0.base_138) .cse3)) (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483648)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|) (= (store |v_#memory_int_267| v_~C~0.base_140 (store (select |v_#memory_int_267| v_~C~0.base_140) .cse4 |v_thread2Thread1of1ForFork2_plus_#res#1_17|)) |v_#memory_int_266|) (<= |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483647) (= |v_#race_765| (let ((.cse5 (let ((.cse9 (store |v_#race_766| v_~A~0.base_136 (store (store (store (store (select |v_#race_766| v_~A~0.base_136) .cse2 0) (+ v_~A~0.offset_136 .cse7 1) 0) (+ v_~A~0.offset_136 2 .cse7) 0) (+ v_~A~0.offset_136 3 .cse7) 0)))) (store .cse9 v_~B~0.base_138 (store (store (store (store (select .cse9 v_~B~0.base_138) .cse3 0) (+ v_~B~0.offset_138 .cse7 1) 0) (+ v_~B~0.offset_138 2 .cse7) 0) (+ v_~B~0.offset_138 3 .cse7) 0))))) (store .cse5 v_~C~0.base_140 (let ((.cse8 (+ v_~C~0.offset_140 3 .cse7))) (let ((.cse6 (select (select |v_#race_765| v_~C~0.base_140) .cse8))) (store (store (store (store (select .cse5 v_~C~0.base_140) .cse4 .cse6) (+ v_~C~0.offset_140 .cse7 1) .cse6) (+ v_~C~0.offset_140 2 .cse7) .cse6) .cse8 .cse6)))))) (= v_~p~0_45 .cse0) (< |v_thread2Thread1of1ForFork2_~i~1#1_58| v_~N~0_81) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| |v_thread2Thread1of1ForFork2_plus_~a#1_17|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|) (= |v_thread2Thread1of1ForFork2_plus_#res#1_17| .cse1) (= 0 |v_#race~C~0_145|)))) InVars {#race=|v_#race_766|, ~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_58|, ~C~0.base=v_~C~0.base_140, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_267|, ~N~0=v_~N~0_81, ~B~0.offset=v_~B~0.offset_138} OutVars{~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_57|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_17|, ~C~0.base=v_~C~0.base_140, thread2Thread1of1ForFork2_#t~ret11#1=|v_thread2Thread1of1ForFork2_#t~ret11#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, #race~B~0=|v_#race~B~0_97|, thread2Thread1of1ForFork2_#t~nondet13#1=|v_thread2Thread1of1ForFork2_#t~nondet13#1_13|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_29|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_17|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_17|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_21|, ~B~0.offset=v_~B~0.offset_138, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_17|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_17|, #race=|v_#race_765|, ~N~0=v_~N~0_81, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_17|, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, #race~p~0=|v_#race~p~0_58|, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_266|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_13|, ~p~0=v_~p~0_45, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_99|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~ret11#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, #race~B~0, thread2Thread1of1ForFork2_#t~nondet13#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, thread2Thread1of1ForFork2_#t~post8#1, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][84], [501#(= |#race~A~0| 0), Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 492#true, 510#(<= 1 ~N~0), 325#L73-4true, Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 40#thread1EXITtrue, 516#true, 432#L61-6true, 532#(<= ~N~0 1), Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 92#L109-6true]) [2023-08-26 10:54:07,267 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-26 10:54:07,267 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 10:54:07,267 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-26 10:54:07,268 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 10:54:07,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1464] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem41#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][102], [501#(= |#race~A~0| 0), 24#L76true, Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 492#true, 510#(<= 1 ~N~0), Black: 516#true, Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 440#L109-7true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 360#thread2EXITtrue, 532#(<= ~N~0 1), Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))]) [2023-08-26 10:54:07,269 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-26 10:54:07,269 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-26 10:54:07,269 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 10:54:07,269 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 10:54:07,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1833] L61-2-->L61-6: Formula: (let ((.cse7 (* |v_thread2Thread1of1ForFork2_~i~1#1_58| 4))) (let ((.cse4 (+ v_~C~0.offset_140 .cse7)) (.cse3 (+ v_~B~0.offset_138 .cse7)) (.cse2 (+ v_~A~0.offset_136 .cse7)) (.cse0 (+ |v_thread2Thread1of1ForFork2_~i~1#1_58| 1)) (.cse1 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_#race~B~0_97| 0) (= |v_#race~A~0_99| 0) (= .cse0 |v_thread2Thread1of1ForFork2_~i~1#1_57|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| (ite (or (<= |v_thread2Thread1of1ForFork2_plus_~b#1_17| 0) (<= .cse1 2147483647)) 1 0)) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| (select (select |v_#memory_int_267| v_~A~0.base_136) .cse2)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| (select (select |v_#memory_int_267| v_~B~0.base_138) .cse3)) (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483648)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|) (= (store |v_#memory_int_267| v_~C~0.base_140 (store (select |v_#memory_int_267| v_~C~0.base_140) .cse4 |v_thread2Thread1of1ForFork2_plus_#res#1_17|)) |v_#memory_int_266|) (<= |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483647) (= |v_#race_765| (let ((.cse5 (let ((.cse9 (store |v_#race_766| v_~A~0.base_136 (store (store (store (store (select |v_#race_766| v_~A~0.base_136) .cse2 0) (+ v_~A~0.offset_136 .cse7 1) 0) (+ v_~A~0.offset_136 2 .cse7) 0) (+ v_~A~0.offset_136 3 .cse7) 0)))) (store .cse9 v_~B~0.base_138 (store (store (store (store (select .cse9 v_~B~0.base_138) .cse3 0) (+ v_~B~0.offset_138 .cse7 1) 0) (+ v_~B~0.offset_138 2 .cse7) 0) (+ v_~B~0.offset_138 3 .cse7) 0))))) (store .cse5 v_~C~0.base_140 (let ((.cse8 (+ v_~C~0.offset_140 3 .cse7))) (let ((.cse6 (select (select |v_#race_765| v_~C~0.base_140) .cse8))) (store (store (store (store (select .cse5 v_~C~0.base_140) .cse4 .cse6) (+ v_~C~0.offset_140 .cse7 1) .cse6) (+ v_~C~0.offset_140 2 .cse7) .cse6) .cse8 .cse6)))))) (= v_~p~0_45 .cse0) (< |v_thread2Thread1of1ForFork2_~i~1#1_58| v_~N~0_81) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| |v_thread2Thread1of1ForFork2_plus_~a#1_17|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|) (= |v_thread2Thread1of1ForFork2_plus_#res#1_17| .cse1) (= 0 |v_#race~C~0_145|)))) InVars {#race=|v_#race_766|, ~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_58|, ~C~0.base=v_~C~0.base_140, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_267|, ~N~0=v_~N~0_81, ~B~0.offset=v_~B~0.offset_138} OutVars{~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_57|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_17|, ~C~0.base=v_~C~0.base_140, thread2Thread1of1ForFork2_#t~ret11#1=|v_thread2Thread1of1ForFork2_#t~ret11#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, #race~B~0=|v_#race~B~0_97|, thread2Thread1of1ForFork2_#t~nondet13#1=|v_thread2Thread1of1ForFork2_#t~nondet13#1_13|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_29|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_17|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_17|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_21|, ~B~0.offset=v_~B~0.offset_138, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_17|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_17|, #race=|v_#race_765|, ~N~0=v_~N~0_81, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_17|, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, #race~p~0=|v_#race~p~0_58|, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_266|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_13|, ~p~0=v_~p~0_45, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_99|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~ret11#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, #race~B~0, thread2Thread1of1ForFork2_#t~nondet13#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, thread2Thread1of1ForFork2_#t~post8#1, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][84], [501#(= |#race~A~0| 0), 24#L76true, Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 492#true, 510#(<= 1 ~N~0), Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 40#thread1EXITtrue, 516#true, 432#L61-6true, 532#(<= ~N~0 1), Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 92#L109-6true]) [2023-08-26 10:54:07,270 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-26 10:54:07,270 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 10:54:07,270 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 10:54:07,270 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-26 10:54:08,634 INFO L124 PetriNetUnfolderBase]: 10452/15700 cut-off events. [2023-08-26 10:54:08,634 INFO L125 PetriNetUnfolderBase]: For 7571/8309 co-relation queries the response was YES. [2023-08-26 10:54:08,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35789 conditions, 15700 events. 10452/15700 cut-off events. For 7571/8309 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 104666 event pairs, 5381 based on Foata normal form. 2/12452 useless extension candidates. Maximal degree in co-relation 35779. Up to 12548 conditions per place. [2023-08-26 10:54:08,735 INFO L140 encePairwiseOnDemand]: 1008/1018 looper letters, 103 selfloop transitions, 22 changer transitions 0/161 dead transitions. [2023-08-26 10:54:08,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 161 transitions, 744 flow [2023-08-26 10:54:08,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 10:54:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 10:54:08,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3408 transitions. [2023-08-26 10:54:08,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3719711853307138 [2023-08-26 10:54:08,744 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3408 transitions. [2023-08-26 10:54:08,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3408 transitions. [2023-08-26 10:54:08,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:08,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3408 transitions. [2023-08-26 10:54:08,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 378.6666666666667) internal successors, (3408), 9 states have internal predecessors, (3408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:08,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 1018.0) internal successors, (10180), 10 states have internal predecessors, (10180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:08,771 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 1018.0) internal successors, (10180), 10 states have internal predecessors, (10180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:08,771 INFO L175 Difference]: Start difference. First operand has 106 places, 104 transitions, 293 flow. Second operand 9 states and 3408 transitions. [2023-08-26 10:54:08,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 161 transitions, 744 flow [2023-08-26 10:54:08,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 161 transitions, 744 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 10:54:08,792 INFO L231 Difference]: Finished difference. Result has 118 places, 120 transitions, 448 flow [2023-08-26 10:54:08,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=448, PETRI_PLACES=118, PETRI_TRANSITIONS=120} [2023-08-26 10:54:08,793 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -24 predicate places. [2023-08-26 10:54:08,793 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 120 transitions, 448 flow [2023-08-26 10:54:08,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 368.25) internal successors, (4419), 12 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:08,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:08,795 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] [2023-08-26 10:54:08,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 10:54:09,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:54:09,000 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-26 10:54:09,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:09,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1391896879, now seen corresponding path program 1 times [2023-08-26 10:54:09,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:09,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495037079] [2023-08-26 10:54:09,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:09,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:09,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 10:54:09,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:09,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495037079] [2023-08-26 10:54:09,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495037079] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:54:09,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656041796] [2023-08-26 10:54:09,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:09,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:54:09,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:54:09,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:54:09,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 10:54:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:09,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 10:54:09,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:54:09,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 10:54:09,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:54:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 10:54:09,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656041796] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:54:09,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:54:09,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-26 10:54:09,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595441609] [2023-08-26 10:54:09,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:54:09,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 10:54:09,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:09,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 10:54:09,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-08-26 10:54:09,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 1018 [2023-08-26 10:54:09,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 120 transitions, 448 flow. Second operand has 12 states, 12 states have (on average 396.0833333333333) internal successors, (4753), 12 states have internal predecessors, (4753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:09,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:09,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 1018 [2023-08-26 10:54:09,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:10,799 INFO L124 PetriNetUnfolderBase]: 2836/6491 cut-off events. [2023-08-26 10:54:10,799 INFO L125 PetriNetUnfolderBase]: For 1632/1702 co-relation queries the response was YES. [2023-08-26 10:54:10,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12301 conditions, 6491 events. 2836/6491 cut-off events. For 1632/1702 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 54120 event pairs, 1472 based on Foata normal form. 112/5256 useless extension candidates. Maximal degree in co-relation 12286. Up to 3405 conditions per place. [2023-08-26 10:54:10,842 INFO L140 encePairwiseOnDemand]: 1008/1018 looper letters, 69 selfloop transitions, 22 changer transitions 0/152 dead transitions. [2023-08-26 10:54:10,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 152 transitions, 718 flow [2023-08-26 10:54:10,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 10:54:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 10:54:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3634 transitions. [2023-08-26 10:54:10,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39663828858327876 [2023-08-26 10:54:10,854 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3634 transitions. [2023-08-26 10:54:10,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3634 transitions. [2023-08-26 10:54:10,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:10,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3634 transitions. [2023-08-26 10:54:10,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 403.77777777777777) internal successors, (3634), 9 states have internal predecessors, (3634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:10,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 1018.0) internal successors, (10180), 10 states have internal predecessors, (10180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:10,875 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 1018.0) internal successors, (10180), 10 states have internal predecessors, (10180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:10,875 INFO L175 Difference]: Start difference. First operand has 118 places, 120 transitions, 448 flow. Second operand 9 states and 3634 transitions. [2023-08-26 10:54:10,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 152 transitions, 718 flow [2023-08-26 10:54:10,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 152 transitions, 690 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-26 10:54:10,888 INFO L231 Difference]: Finished difference. Result has 127 places, 122 transitions, 489 flow [2023-08-26 10:54:10,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=489, PETRI_PLACES=127, PETRI_TRANSITIONS=122} [2023-08-26 10:54:10,888 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -15 predicate places. [2023-08-26 10:54:10,889 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 122 transitions, 489 flow [2023-08-26 10:54:10,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 396.0833333333333) internal successors, (4753), 12 states have internal predecessors, (4753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:10,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:10,890 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:54:10,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 10:54:11,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-08-26 10:54:11,097 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-26 10:54:11,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:11,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1399204042, now seen corresponding path program 2 times [2023-08-26 10:54:11,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:11,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031469416] [2023-08-26 10:54:11,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:11,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-26 10:54:11,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:11,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031469416] [2023-08-26 10:54:11,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031469416] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:11,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:11,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:54:11,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107291358] [2023-08-26 10:54:11,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:11,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:54:11,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:11,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:54:11,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:54:11,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 1018 [2023-08-26 10:54:11,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 122 transitions, 489 flow. Second operand has 6 states, 6 states have (on average 368.8333333333333) internal successors, (2213), 6 states have internal predecessors, (2213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:11,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:11,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 1018 [2023-08-26 10:54:11,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:17,094 INFO L124 PetriNetUnfolderBase]: 32994/46701 cut-off events. [2023-08-26 10:54:17,094 INFO L125 PetriNetUnfolderBase]: For 37782/38322 co-relation queries the response was YES. [2023-08-26 10:54:17,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120330 conditions, 46701 events. 32994/46701 cut-off events. For 37782/38322 co-relation queries the response was YES. Maximal size of possible extension queue 1420. Compared 307531 event pairs, 6905 based on Foata normal form. 280/38880 useless extension candidates. Maximal degree in co-relation 120312. Up to 24395 conditions per place. [2023-08-26 10:54:17,386 INFO L140 encePairwiseOnDemand]: 1002/1018 looper letters, 207 selfloop transitions, 33 changer transitions 0/256 dead transitions. [2023-08-26 10:54:17,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 256 transitions, 1485 flow [2023-08-26 10:54:17,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:54:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:54:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2378 transitions. [2023-08-26 10:54:17,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3893254747871644 [2023-08-26 10:54:17,392 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2378 transitions. [2023-08-26 10:54:17,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2378 transitions. [2023-08-26 10:54:17,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:17,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2378 transitions. [2023-08-26 10:54:17,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 396.3333333333333) internal successors, (2378), 6 states have internal predecessors, (2378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:17,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:17,406 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:17,406 INFO L175 Difference]: Start difference. First operand has 127 places, 122 transitions, 489 flow. Second operand 6 states and 2378 transitions. [2023-08-26 10:54:17,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 256 transitions, 1485 flow [2023-08-26 10:54:17,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 256 transitions, 1448 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-26 10:54:17,542 INFO L231 Difference]: Finished difference. Result has 131 places, 154 transitions, 798 flow [2023-08-26 10:54:17,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=798, PETRI_PLACES=131, PETRI_TRANSITIONS=154} [2023-08-26 10:54:17,543 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -11 predicate places. [2023-08-26 10:54:17,543 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 154 transitions, 798 flow [2023-08-26 10:54:17,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 368.8333333333333) internal successors, (2213), 6 states have internal predecessors, (2213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:17,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:17,544 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:54:17,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 10:54:17,544 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-26 10:54:17,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:17,545 INFO L85 PathProgramCache]: Analyzing trace with hash 425666570, now seen corresponding path program 1 times [2023-08-26 10:54:17,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:17,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13355933] [2023-08-26 10:54:17,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:17,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-26 10:54:17,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:17,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13355933] [2023-08-26 10:54:17,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13355933] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:17,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:17,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:54:17,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195798862] [2023-08-26 10:54:17,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:17,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:54:17,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:17,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:54:17,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:54:17,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 1018 [2023-08-26 10:54:17,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 154 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:17,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:17,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 1018 [2023-08-26 10:54:17,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:20,191 INFO L124 PetriNetUnfolderBase]: 9971/19279 cut-off events. [2023-08-26 10:54:20,191 INFO L125 PetriNetUnfolderBase]: For 42941/45595 co-relation queries the response was YES. [2023-08-26 10:54:20,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55471 conditions, 19279 events. 9971/19279 cut-off events. For 42941/45595 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 166181 event pairs, 1634 based on Foata normal form. 106/16100 useless extension candidates. Maximal degree in co-relation 55449. Up to 7026 conditions per place. [2023-08-26 10:54:20,330 INFO L140 encePairwiseOnDemand]: 1013/1018 looper letters, 128 selfloop transitions, 7 changer transitions 0/204 dead transitions. [2023-08-26 10:54:20,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 204 transitions, 1427 flow [2023-08-26 10:54:20,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:54:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:54:20,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1417 transitions. [2023-08-26 10:54:20,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4639816633922724 [2023-08-26 10:54:20,334 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1417 transitions. [2023-08-26 10:54:20,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1417 transitions. [2023-08-26 10:54:20,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:20,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1417 transitions. [2023-08-26 10:54:20,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 472.3333333333333) internal successors, (1417), 3 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:20,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:20,343 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:20,343 INFO L175 Difference]: Start difference. First operand has 131 places, 154 transitions, 798 flow. Second operand 3 states and 1417 transitions. [2023-08-26 10:54:20,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 204 transitions, 1427 flow [2023-08-26 10:54:20,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 204 transitions, 1427 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 10:54:20,382 INFO L231 Difference]: Finished difference. Result has 133 places, 158 transitions, 849 flow [2023-08-26 10:54:20,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=849, PETRI_PLACES=133, PETRI_TRANSITIONS=158} [2023-08-26 10:54:20,383 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -9 predicate places. [2023-08-26 10:54:20,383 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 158 transitions, 849 flow [2023-08-26 10:54:20,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:20,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:20,384 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:54:20,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 10:54:20,384 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-26 10:54:20,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:20,385 INFO L85 PathProgramCache]: Analyzing trace with hash 310768637, now seen corresponding path program 1 times [2023-08-26 10:54:20,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:20,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513389138] [2023-08-26 10:54:20,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:20,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-26 10:54:20,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:20,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513389138] [2023-08-26 10:54:20,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513389138] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:20,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:20,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:54:20,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939268169] [2023-08-26 10:54:20,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:20,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:54:20,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:20,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:54:20,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:54:20,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 1018 [2023-08-26 10:54:20,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 158 transitions, 849 flow. Second operand has 3 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:20,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:20,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 1018 [2023-08-26 10:54:20,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:23,313 INFO L124 PetriNetUnfolderBase]: 11468/21453 cut-off events. [2023-08-26 10:54:23,313 INFO L125 PetriNetUnfolderBase]: For 52019/54635 co-relation queries the response was YES. [2023-08-26 10:54:23,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63346 conditions, 21453 events. 11468/21453 cut-off events. For 52019/54635 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 183061 event pairs, 4364 based on Foata normal form. 106/18443 useless extension candidates. Maximal degree in co-relation 63323. Up to 14036 conditions per place. [2023-08-26 10:54:23,444 INFO L140 encePairwiseOnDemand]: 1015/1018 looper letters, 88 selfloop transitions, 4 changer transitions 0/156 dead transitions. [2023-08-26 10:54:23,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 156 transitions, 1029 flow [2023-08-26 10:54:23,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:54:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:54:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1388 transitions. [2023-08-26 10:54:23,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4544859201047806 [2023-08-26 10:54:23,447 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1388 transitions. [2023-08-26 10:54:23,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1388 transitions. [2023-08-26 10:54:23,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:23,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1388 transitions. [2023-08-26 10:54:23,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 462.6666666666667) internal successors, (1388), 3 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:23,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:23,454 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:23,454 INFO L175 Difference]: Start difference. First operand has 133 places, 158 transitions, 849 flow. Second operand 3 states and 1388 transitions. [2023-08-26 10:54:23,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 156 transitions, 1029 flow [2023-08-26 10:54:23,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 156 transitions, 1022 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:54:23,494 INFO L231 Difference]: Finished difference. Result has 132 places, 156 transitions, 846 flow [2023-08-26 10:54:23,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=846, PETRI_PLACES=132, PETRI_TRANSITIONS=156} [2023-08-26 10:54:23,495 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -10 predicate places. [2023-08-26 10:54:23,495 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 156 transitions, 846 flow [2023-08-26 10:54:23,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:23,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:23,496 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:54:23,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 10:54:23,496 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-26 10:54:23,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash -610811521, now seen corresponding path program 2 times [2023-08-26 10:54:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:23,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496357965] [2023-08-26 10:54:23,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:23,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-26 10:54:25,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:25,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496357965] [2023-08-26 10:54:25,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496357965] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:25,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:25,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 10:54:25,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135692864] [2023-08-26 10:54:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:25,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 10:54:25,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:25,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 10:54:25,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-26 10:54:25,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 1018 [2023-08-26 10:54:25,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 156 transitions, 846 flow. Second operand has 11 states, 11 states have (on average 343.72727272727275) internal successors, (3781), 11 states have internal predecessors, (3781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:25,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:25,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 1018 [2023-08-26 10:54:25,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:32,742 INFO L124 PetriNetUnfolderBase]: 45996/63477 cut-off events. [2023-08-26 10:54:32,742 INFO L125 PetriNetUnfolderBase]: For 85499/86534 co-relation queries the response was YES. [2023-08-26 10:54:32,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190491 conditions, 63477 events. 45996/63477 cut-off events. For 85499/86534 co-relation queries the response was YES. Maximal size of possible extension queue 1488. Compared 414899 event pairs, 6116 based on Foata normal form. 1392/55775 useless extension candidates. Maximal degree in co-relation 190467. Up to 21058 conditions per place. [2023-08-26 10:54:33,184 INFO L140 encePairwiseOnDemand]: 1012/1018 looper letters, 384 selfloop transitions, 8 changer transitions 0/407 dead transitions. [2023-08-26 10:54:33,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 407 transitions, 2786 flow [2023-08-26 10:54:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 10:54:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 10:54:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2635 transitions. [2023-08-26 10:54:33,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36977266348582655 [2023-08-26 10:54:33,190 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2635 transitions. [2023-08-26 10:54:33,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2635 transitions. [2023-08-26 10:54:33,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:33,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2635 transitions. [2023-08-26 10:54:33,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 376.42857142857144) internal successors, (2635), 7 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:33,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 1018.0) internal successors, (8144), 8 states have internal predecessors, (8144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:33,202 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 1018.0) internal successors, (8144), 8 states have internal predecessors, (8144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:33,202 INFO L175 Difference]: Start difference. First operand has 132 places, 156 transitions, 846 flow. Second operand 7 states and 2635 transitions. [2023-08-26 10:54:33,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 407 transitions, 2786 flow [2023-08-26 10:54:34,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 407 transitions, 2775 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 10:54:34,011 INFO L231 Difference]: Finished difference. Result has 135 places, 155 transitions, 847 flow [2023-08-26 10:54:34,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=847, PETRI_PLACES=135, PETRI_TRANSITIONS=155} [2023-08-26 10:54:34,011 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -7 predicate places. [2023-08-26 10:54:34,011 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 155 transitions, 847 flow [2023-08-26 10:54:34,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 343.72727272727275) internal successors, (3781), 11 states have internal predecessors, (3781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:34,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:34,012 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 10:54:34,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 10:54:34,013 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-26 10:54:34,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:34,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1111436342, now seen corresponding path program 1 times [2023-08-26 10:54:34,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:34,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574271755] [2023-08-26 10:54:34,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:34,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 10:54:34,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:34,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574271755] [2023-08-26 10:54:34,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574271755] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:34,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:34,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:54:34,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644245820] [2023-08-26 10:54:34,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:34,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:54:34,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:34,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:54:34,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:54:34,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 1018 [2023-08-26 10:54:34,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 155 transitions, 847 flow. Second operand has 6 states, 6 states have (on average 378.3333333333333) internal successors, (2270), 6 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:34,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:34,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 1018 [2023-08-26 10:54:34,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:41,556 INFO L124 PetriNetUnfolderBase]: 41312/58702 cut-off events. [2023-08-26 10:54:41,557 INFO L125 PetriNetUnfolderBase]: For 100138/100585 co-relation queries the response was YES. [2023-08-26 10:54:41,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179117 conditions, 58702 events. 41312/58702 cut-off events. For 100138/100585 co-relation queries the response was YES. Maximal size of possible extension queue 1397. Compared 389520 event pairs, 20700 based on Foata normal form. 272/50622 useless extension candidates. Maximal degree in co-relation 179094. Up to 52520 conditions per place. [2023-08-26 10:54:41,981 INFO L140 encePairwiseOnDemand]: 1011/1018 looper letters, 173 selfloop transitions, 13 changer transitions 0/205 dead transitions. [2023-08-26 10:54:41,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 205 transitions, 1401 flow [2023-08-26 10:54:41,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:54:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:54:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2358 transitions. [2023-08-26 10:54:41,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38605108055009824 [2023-08-26 10:54:41,986 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2358 transitions. [2023-08-26 10:54:41,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2358 transitions. [2023-08-26 10:54:41,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:41,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2358 transitions. [2023-08-26 10:54:41,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 393.0) internal successors, (2358), 6 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:41,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:41,997 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:41,997 INFO L175 Difference]: Start difference. First operand has 135 places, 155 transitions, 847 flow. Second operand 6 states and 2358 transitions. [2023-08-26 10:54:41,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 205 transitions, 1401 flow [2023-08-26 10:54:42,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 205 transitions, 1387 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 10:54:42,168 INFO L231 Difference]: Finished difference. Result has 140 places, 167 transitions, 975 flow [2023-08-26 10:54:42,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=975, PETRI_PLACES=140, PETRI_TRANSITIONS=167} [2023-08-26 10:54:42,169 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -2 predicate places. [2023-08-26 10:54:42,169 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 167 transitions, 975 flow [2023-08-26 10:54:42,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 378.3333333333333) internal successors, (2270), 6 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:42,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:42,170 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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 10:54:42,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 10:54:42,170 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-26 10:54:42,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:42,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1032675538, now seen corresponding path program 1 times [2023-08-26 10:54:42,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:42,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799312470] [2023-08-26 10:54:42,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:42,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-26 10:54:43,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:43,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799312470] [2023-08-26 10:54:43,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799312470] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:43,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:43,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 10:54:43,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726059960] [2023-08-26 10:54:43,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:43,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 10:54:43,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:43,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 10:54:43,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-26 10:54:43,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 1018 [2023-08-26 10:54:43,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 167 transitions, 975 flow. Second operand has 9 states, 9 states have (on average 332.3333333333333) internal successors, (2991), 9 states have internal predecessors, (2991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:43,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:43,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 1018 [2023-08-26 10:54:43,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:54:56,923 INFO L124 PetriNetUnfolderBase]: 81953/115395 cut-off events. [2023-08-26 10:54:56,923 INFO L125 PetriNetUnfolderBase]: For 173834/175247 co-relation queries the response was YES. [2023-08-26 10:54:57,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341295 conditions, 115395 events. 81953/115395 cut-off events. For 173834/175247 co-relation queries the response was YES. Maximal size of possible extension queue 1722. Compared 789257 event pairs, 29860 based on Foata normal form. 281/99422 useless extension candidates. Maximal degree in co-relation 341268. Up to 59574 conditions per place. [2023-08-26 10:54:58,036 INFO L140 encePairwiseOnDemand]: 1003/1018 looper letters, 336 selfloop transitions, 66 changer transitions 0/413 dead transitions. [2023-08-26 10:54:58,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 413 transitions, 3315 flow [2023-08-26 10:54:58,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 10:54:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 10:54:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3521 transitions. [2023-08-26 10:54:58,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34587426326129667 [2023-08-26 10:54:58,043 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 3521 transitions. [2023-08-26 10:54:58,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 3521 transitions. [2023-08-26 10:54:58,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:54:58,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 3521 transitions. [2023-08-26 10:54:58,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 352.1) internal successors, (3521), 10 states have internal predecessors, (3521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:58,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 1018.0) internal successors, (11198), 11 states have internal predecessors, (11198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:58,057 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 1018.0) internal successors, (11198), 11 states have internal predecessors, (11198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:58,058 INFO L175 Difference]: Start difference. First operand has 140 places, 167 transitions, 975 flow. Second operand 10 states and 3521 transitions. [2023-08-26 10:54:58,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 413 transitions, 3315 flow [2023-08-26 10:54:58,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 413 transitions, 3299 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-08-26 10:54:58,641 INFO L231 Difference]: Finished difference. Result has 153 places, 219 transitions, 1738 flow [2023-08-26 10:54:58,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1738, PETRI_PLACES=153, PETRI_TRANSITIONS=219} [2023-08-26 10:54:58,641 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 11 predicate places. [2023-08-26 10:54:58,641 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 219 transitions, 1738 flow [2023-08-26 10:54:58,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 332.3333333333333) internal successors, (2991), 9 states have internal predecessors, (2991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:58,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:54:58,642 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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 10:54:58,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 10:54:58,642 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-26 10:54:58,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:54:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1041916758, now seen corresponding path program 2 times [2023-08-26 10:54:58,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:54:58,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6903645] [2023-08-26 10:54:58,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:54:58,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:54:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:54:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-26 10:54:59,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:54:59,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6903645] [2023-08-26 10:54:59,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6903645] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:54:59,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:54:59,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 10:54:59,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107586409] [2023-08-26 10:54:59,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:54:59,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 10:54:59,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:54:59,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 10:54:59,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-26 10:54:59,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 1018 [2023-08-26 10:54:59,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 219 transitions, 1738 flow. Second operand has 9 states, 9 states have (on average 332.3333333333333) internal successors, (2991), 9 states have internal predecessors, (2991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:54:59,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:54:59,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 1018 [2023-08-26 10:54:59,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:55:17,108 INFO L124 PetriNetUnfolderBase]: 98370/137245 cut-off events. [2023-08-26 10:55:17,108 INFO L125 PetriNetUnfolderBase]: For 440278/442197 co-relation queries the response was YES. [2023-08-26 10:55:17,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476019 conditions, 137245 events. 98370/137245 cut-off events. For 440278/442197 co-relation queries the response was YES. Maximal size of possible extension queue 1864. Compared 931096 event pairs, 19917 based on Foata normal form. 530/119580 useless extension candidates. Maximal degree in co-relation 475987. Up to 73990 conditions per place. [2023-08-26 10:55:18,361 INFO L140 encePairwiseOnDemand]: 1003/1018 looper letters, 309 selfloop transitions, 156 changer transitions 0/476 dead transitions. [2023-08-26 10:55:18,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 476 transitions, 4595 flow [2023-08-26 10:55:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 10:55:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 10:55:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3869 transitions. [2023-08-26 10:55:18,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.345508126451152 [2023-08-26 10:55:18,367 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3869 transitions. [2023-08-26 10:55:18,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3869 transitions. [2023-08-26 10:55:18,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:55:18,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3869 transitions. [2023-08-26 10:55:18,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 351.72727272727275) internal successors, (3869), 11 states have internal predecessors, (3869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:55:18,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 1018.0) internal successors, (12216), 12 states have internal predecessors, (12216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:55:18,381 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 1018.0) internal successors, (12216), 12 states have internal predecessors, (12216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:55:18,381 INFO L175 Difference]: Start difference. First operand has 153 places, 219 transitions, 1738 flow. Second operand 11 states and 3869 transitions. [2023-08-26 10:55:18,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 476 transitions, 4595 flow [2023-08-26 10:55:23,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 476 transitions, 4559 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-26 10:55:23,760 INFO L231 Difference]: Finished difference. Result has 162 places, 312 transitions, 3565 flow [2023-08-26 10:55:23,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=1696, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3565, PETRI_PLACES=162, PETRI_TRANSITIONS=312} [2023-08-26 10:55:23,761 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 20 predicate places. [2023-08-26 10:55:23,761 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 312 transitions, 3565 flow [2023-08-26 10:55:23,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 332.3333333333333) internal successors, (2991), 9 states have internal predecessors, (2991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:55:23,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:55:23,762 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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 10:55:23,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 10:55:23,762 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-26 10:55:23,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:55:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash -753888379, now seen corresponding path program 1 times [2023-08-26 10:55:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:55:23,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622734675] [2023-08-26 10:55:23,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:55:23,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:55:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:55:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-26 10:55:24,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:55:24,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622734675] [2023-08-26 10:55:24,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622734675] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:55:24,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:55:24,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:55:24,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395970847] [2023-08-26 10:55:24,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:55:24,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:55:24,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:55:24,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:55:24,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:55:24,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 1018 [2023-08-26 10:55:24,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 312 transitions, 3565 flow. Second operand has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:55:24,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:55:24,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 1018 [2023-08-26 10:55:24,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:55:43,890 INFO L124 PetriNetUnfolderBase]: 101368/141687 cut-off events. [2023-08-26 10:55:43,890 INFO L125 PetriNetUnfolderBase]: For 754446/758804 co-relation queries the response was YES. [2023-08-26 10:55:44,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 542891 conditions, 141687 events. 101368/141687 cut-off events. For 754446/758804 co-relation queries the response was YES. Maximal size of possible extension queue 2008. Compared 973907 event pairs, 34607 based on Foata normal form. 3649/126674 useless extension candidates. Maximal degree in co-relation 542855. Up to 103060 conditions per place. [2023-08-26 10:55:45,505 INFO L140 encePairwiseOnDemand]: 1004/1018 looper letters, 380 selfloop transitions, 123 changer transitions 0/520 dead transitions. [2023-08-26 10:55:45,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 520 transitions, 6813 flow [2023-08-26 10:55:45,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:55:45,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:55:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2356 transitions. [2023-08-26 10:55:45,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3857236411263916 [2023-08-26 10:55:45,508 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2356 transitions. [2023-08-26 10:55:45,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2356 transitions. [2023-08-26 10:55:45,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:55:45,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2356 transitions. [2023-08-26 10:55:45,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 392.6666666666667) internal successors, (2356), 6 states have internal predecessors, (2356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:55:45,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:55:45,516 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:55:45,516 INFO L175 Difference]: Start difference. First operand has 162 places, 312 transitions, 3565 flow. Second operand 6 states and 2356 transitions. [2023-08-26 10:55:45,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 520 transitions, 6813 flow [2023-08-26 10:56:03,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 520 transitions, 6335 flow, removed 230 selfloop flow, removed 4 redundant places. [2023-08-26 10:56:03,832 INFO L231 Difference]: Finished difference. Result has 168 places, 424 transitions, 5503 flow [2023-08-26 10:56:03,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=3375, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5503, PETRI_PLACES=168, PETRI_TRANSITIONS=424} [2023-08-26 10:56:03,833 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 26 predicate places. [2023-08-26 10:56:03,833 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 424 transitions, 5503 flow [2023-08-26 10:56:03,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:56:03,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:56:03,834 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:56:03,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 10:56:03,834 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-26 10:56:03,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:56:03,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1070465364, now seen corresponding path program 3 times [2023-08-26 10:56:03,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:56:03,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421411455] [2023-08-26 10:56:03,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:56:03,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:56:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:56:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 10:56:04,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:56:04,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421411455] [2023-08-26 10:56:04,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421411455] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:56:04,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733882024] [2023-08-26 10:56:04,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 10:56:04,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:56:04,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:56:04,101 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:56:04,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 10:56:04,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 10:56:04,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 10:56:04,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-26 10:56:04,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:56:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 10:56:05,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:56:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 10:56:05,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733882024] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:56:05,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:56:05,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-08-26 10:56:05,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104915008] [2023-08-26 10:56:05,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:56:05,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-26 10:56:05,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:56:05,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-26 10:56:05,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-08-26 10:56:05,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 1018 [2023-08-26 10:56:05,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 424 transitions, 5503 flow. Second operand has 17 states, 17 states have (on average 395.8235294117647) internal successors, (6729), 17 states have internal predecessors, (6729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:56:05,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:56:05,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 1018 [2023-08-26 10:56:05,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand