/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 INSUFFICIENT_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/pthread-atomic/peterson-b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 07:54:57,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 07:54:57,538 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-25 07:54:57,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 07:54:57,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 07:54:57,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 07:54:57,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 07:54:57,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 07:54:57,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 07:54:57,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 07:54:57,579 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 07:54:57,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 07:54:57,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 07:54:57,581 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 07:54:57,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 07:54:57,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 07:54:57,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 07:54:57,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 07:54:57,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 07:54:57,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 07:54:57,582 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 07:54:57,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 07:54:57,583 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 07:54:57,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 07:54:57,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 07:54:57,584 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 07:54:57,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 07:54:57,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 07:54:57,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 07:54:57,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 07:54:57,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 07:54:57,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 07:54:57,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 07:54:57,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 07:54:57,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 07:54:57,587 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 -> INSUFFICIENT_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-25 07:54:57,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 07:54:57,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 07:54:57,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 07:54:57,930 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 07:54:57,930 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 07:54:57,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/peterson-b.i [2023-08-25 07:54:59,071 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 07:54:59,346 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 07:54:59,346 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson-b.i [2023-08-25 07:54:59,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3a81d38/67de21004cf54e90b8b6bc4fbbe32986/FLAGc6d7697eb [2023-08-25 07:54:59,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3a81d38/67de21004cf54e90b8b6bc4fbbe32986 [2023-08-25 07:54:59,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 07:54:59,369 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 07:54:59,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 07:54:59,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 07:54:59,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 07:54:59,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:54:59" (1/1) ... [2023-08-25 07:54:59,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fd39d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:59, skipping insertion in model container [2023-08-25 07:54:59,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:54:59" (1/1) ... [2023-08-25 07:54:59,412 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 07:54:59,637 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 07:54:59,645 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 07:54:59,663 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [249] [2023-08-25 07:54:59,664 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [249] [2023-08-25 07:54:59,681 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 07:54:59,711 INFO L206 MainTranslator]: Completed translation [2023-08-25 07:54:59,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:59 WrapperNode [2023-08-25 07:54:59,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 07:54:59,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 07:54:59,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 07:54:59,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 07:54:59,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:59" (1/1) ... [2023-08-25 07:54:59,730 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:59" (1/1) ... [2023-08-25 07:54:59,755 INFO L138 Inliner]: procedures = 167, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 143 [2023-08-25 07:54:59,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 07:54:59,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 07:54:59,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 07:54:59,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 07:54:59,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:59" (1/1) ... [2023-08-25 07:54:59,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:59" (1/1) ... [2023-08-25 07:54:59,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:59" (1/1) ... [2023-08-25 07:54:59,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:59" (1/1) ... [2023-08-25 07:54:59,790 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:59" (1/1) ... [2023-08-25 07:54:59,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:59" (1/1) ... [2023-08-25 07:54:59,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:59" (1/1) ... [2023-08-25 07:54:59,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:59" (1/1) ... [2023-08-25 07:54:59,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 07:54:59,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 07:54:59,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 07:54:59,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 07:54:59,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:59" (1/1) ... [2023-08-25 07:54:59,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 07:54:59,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:54:59,842 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-25 07:54:59,862 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-25 07:54:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 07:54:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-08-25 07:54:59,885 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-08-25 07:54:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-25 07:54:59,885 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-25 07:54:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 07:54:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 07:54:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 07:54:59,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 07:54:59,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 07:54:59,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 07:54:59,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 07:54:59,887 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 07:54:59,995 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 07:54:59,997 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 07:55:00,273 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 07:55:00,282 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 07:55:00,284 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-25 07:55:00,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:55:00 BoogieIcfgContainer [2023-08-25 07:55:00,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 07:55:00,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 07:55:00,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 07:55:00,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 07:55:00,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 07:54:59" (1/3) ... [2023-08-25 07:55:00,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f524615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:55:00, skipping insertion in model container [2023-08-25 07:55:00,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:54:59" (2/3) ... [2023-08-25 07:55:00,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f524615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:55:00, skipping insertion in model container [2023-08-25 07:55:00,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:55:00" (3/3) ... [2023-08-25 07:55:00,292 INFO L112 eAbstractionObserver]: Analyzing ICFG peterson-b.i [2023-08-25 07:55:00,306 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 07:55:00,306 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-25 07:55:00,306 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 07:55:00,379 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-25 07:55:00,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 162 transitions, 340 flow [2023-08-25 07:55:00,503 INFO L124 PetriNetUnfolderBase]: 10/160 cut-off events. [2023-08-25 07:55:00,503 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 07:55:00,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 160 events. 10/160 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 329 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2023-08-25 07:55:00,511 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 162 transitions, 340 flow [2023-08-25 07:55:00,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 151 transitions, 311 flow [2023-08-25 07:55:00,524 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 07:55:00,532 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 151 transitions, 311 flow [2023-08-25 07:55:00,534 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 151 transitions, 311 flow [2023-08-25 07:55:00,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 151 transitions, 311 flow [2023-08-25 07:55:00,565 INFO L124 PetriNetUnfolderBase]: 10/151 cut-off events. [2023-08-25 07:55:00,565 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-25 07:55:00,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 151 events. 10/151 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 330 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2023-08-25 07:55:00,572 INFO L119 LiptonReduction]: Number of co-enabled transitions 9396 [2023-08-25 07:55:02,609 INFO L134 LiptonReduction]: Checked pairs total: 33507 [2023-08-25 07:55:02,609 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-25 07:55:02,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 07:55:02,626 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;@717ed349, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 07:55:02,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2023-08-25 07:55:02,628 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 07:55:02,628 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-25 07:55:02,628 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 07:55:02,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:55:02,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-25 07:55:02,629 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-25 07:55:02,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:55:02,634 INFO L85 PathProgramCache]: Analyzing trace with hash 572533813, now seen corresponding path program 1 times [2023-08-25 07:55:02,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:55:02,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677934467] [2023-08-25 07:55:02,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:55:02,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:55:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:55:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:55:02,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:55:02,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677934467] [2023-08-25 07:55:02,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677934467] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:55:02,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:55:02,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:55:02,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797712067] [2023-08-25 07:55:02,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:55:02,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:55:02,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:55:02,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:55:02,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:55:02,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 256 [2023-08-25 07:55:02,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:02,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:55:02,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 256 [2023-08-25 07:55:02,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:55:03,122 INFO L124 PetriNetUnfolderBase]: 1084/2333 cut-off events. [2023-08-25 07:55:03,122 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-25 07:55:03,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4153 conditions, 2333 events. 1084/2333 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 14578 event pairs, 820 based on Foata normal form. 72/1956 useless extension candidates. Maximal degree in co-relation 3990. Up to 1566 conditions per place. [2023-08-25 07:55:03,139 INFO L140 encePairwiseOnDemand]: 243/256 looper letters, 60 selfloop transitions, 4 changer transitions 0/92 dead transitions. [2023-08-25 07:55:03,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 92 transitions, 324 flow [2023-08-25 07:55:03,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:55:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:55:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2023-08-25 07:55:03,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6432291666666666 [2023-08-25 07:55:03,152 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2023-08-25 07:55:03,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2023-08-25 07:55:03,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:55:03,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2023-08-25 07:55:03,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:03,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:03,163 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:03,165 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 171 flow. Second operand 3 states and 494 transitions. [2023-08-25 07:55:03,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 92 transitions, 324 flow [2023-08-25 07:55:03,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 92 transitions, 318 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-25 07:55:03,172 INFO L231 Difference]: Finished difference. Result has 74 places, 73 transitions, 174 flow [2023-08-25 07:55:03,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=74, PETRI_TRANSITIONS=73} [2023-08-25 07:55:03,176 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2023-08-25 07:55:03,176 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 73 transitions, 174 flow [2023-08-25 07:55:03,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:03,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:55:03,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:55:03,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 07:55:03,177 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-25 07:55:03,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:55:03,178 INFO L85 PathProgramCache]: Analyzing trace with hash 483409270, now seen corresponding path program 1 times [2023-08-25 07:55:03,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:55:03,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014703415] [2023-08-25 07:55:03,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:55:03,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:55:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:55:03,231 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-25 07:55:03,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:55:03,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014703415] [2023-08-25 07:55:03,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014703415] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:55:03,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:55:03,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:55:03,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778494986] [2023-08-25 07:55:03,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:55:03,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:55:03,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:55:03,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:55:03,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:55:03,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 256 [2023-08-25 07:55:03,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 73 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:03,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:55:03,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 256 [2023-08-25 07:55:03,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:55:03,504 INFO L124 PetriNetUnfolderBase]: 1145/2490 cut-off events. [2023-08-25 07:55:03,504 INFO L125 PetriNetUnfolderBase]: For 226/253 co-relation queries the response was YES. [2023-08-25 07:55:03,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4615 conditions, 2490 events. 1145/2490 cut-off events. For 226/253 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 16028 event pairs, 841 based on Foata normal form. 0/2012 useless extension candidates. Maximal degree in co-relation 3512. Up to 1661 conditions per place. [2023-08-25 07:55:03,518 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 62 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2023-08-25 07:55:03,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 96 transitions, 361 flow [2023-08-25 07:55:03,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:55:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:55:03,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2023-08-25 07:55:03,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.62890625 [2023-08-25 07:55:03,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 483 transitions. [2023-08-25 07:55:03,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 483 transitions. [2023-08-25 07:55:03,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:55:03,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 483 transitions. [2023-08-25 07:55:03,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:03,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:03,525 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:03,525 INFO L175 Difference]: Start difference. First operand has 74 places, 73 transitions, 174 flow. Second operand 3 states and 483 transitions. [2023-08-25 07:55:03,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 96 transitions, 361 flow [2023-08-25 07:55:03,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 07:55:03,529 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 196 flow [2023-08-25 07:55:03,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2023-08-25 07:55:03,529 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2023-08-25 07:55:03,530 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 196 flow [2023-08-25 07:55:03,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:03,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:55:03,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:55:03,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 07:55:03,531 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-25 07:55:03,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:55:03,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1040218407, now seen corresponding path program 1 times [2023-08-25 07:55:03,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:55:03,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116501960] [2023-08-25 07:55:03,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:55:03,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:55:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:55:03,584 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-25 07:55:03,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:55:03,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116501960] [2023-08-25 07:55:03,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116501960] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:55:03,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:55:03,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:55:03,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568101330] [2023-08-25 07:55:03,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:55:03,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:55:03,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:55:03,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:55:03,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:55:03,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 256 [2023-08-25 07:55:03,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:03,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:55:03,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 256 [2023-08-25 07:55:03,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:55:03,841 INFO L124 PetriNetUnfolderBase]: 1259/2664 cut-off events. [2023-08-25 07:55:03,841 INFO L125 PetriNetUnfolderBase]: For 317/370 co-relation queries the response was YES. [2023-08-25 07:55:03,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5092 conditions, 2664 events. 1259/2664 cut-off events. For 317/370 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 17371 event pairs, 967 based on Foata normal form. 0/2134 useless extension candidates. Maximal degree in co-relation 3850. Up to 1935 conditions per place. [2023-08-25 07:55:03,859 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 63 selfloop transitions, 4 changer transitions 0/98 dead transitions. [2023-08-25 07:55:03,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 98 transitions, 384 flow [2023-08-25 07:55:03,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:55:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:55:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2023-08-25 07:55:03,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6171875 [2023-08-25 07:55:03,861 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 474 transitions. [2023-08-25 07:55:03,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 474 transitions. [2023-08-25 07:55:03,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:55:03,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 474 transitions. [2023-08-25 07:55:03,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:03,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:03,864 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:03,865 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 196 flow. Second operand 3 states and 474 transitions. [2023-08-25 07:55:03,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 98 transitions, 384 flow [2023-08-25 07:55:03,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 98 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 07:55:03,868 INFO L231 Difference]: Finished difference. Result has 77 places, 79 transitions, 214 flow [2023-08-25 07:55:03,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=77, PETRI_TRANSITIONS=79} [2023-08-25 07:55:03,869 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2023-08-25 07:55:03,870 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 214 flow [2023-08-25 07:55:03,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:03,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:55:03,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:55:03,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 07:55:03,871 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-25 07:55:03,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:55:03,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1077413557, now seen corresponding path program 1 times [2023-08-25 07:55:03,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:55:03,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128933618] [2023-08-25 07:55:03,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:55:03,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:55:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:55:03,903 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-25 07:55:03,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:55:03,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128933618] [2023-08-25 07:55:03,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128933618] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:55:03,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:55:03,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:55:03,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732786540] [2023-08-25 07:55:03,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:55:03,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:55:03,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:55:03,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:55:03,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:55:03,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 256 [2023-08-25 07:55:03,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:03,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:55:03,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 256 [2023-08-25 07:55:03,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:55:04,247 INFO L124 PetriNetUnfolderBase]: 1745/3804 cut-off events. [2023-08-25 07:55:04,247 INFO L125 PetriNetUnfolderBase]: For 412/457 co-relation queries the response was YES. [2023-08-25 07:55:04,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7371 conditions, 3804 events. 1745/3804 cut-off events. For 412/457 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 27132 event pairs, 530 based on Foata normal form. 0/3095 useless extension candidates. Maximal degree in co-relation 6202. Up to 1542 conditions per place. [2023-08-25 07:55:04,271 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 77 selfloop transitions, 5 changer transitions 0/113 dead transitions. [2023-08-25 07:55:04,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 113 transitions, 461 flow [2023-08-25 07:55:04,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:55:04,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:55:04,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2023-08-25 07:55:04,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6497395833333334 [2023-08-25 07:55:04,273 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2023-08-25 07:55:04,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2023-08-25 07:55:04,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:55:04,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2023-08-25 07:55:04,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:04,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:04,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:04,277 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 214 flow. Second operand 3 states and 499 transitions. [2023-08-25 07:55:04,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 113 transitions, 461 flow [2023-08-25 07:55:04,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 113 transitions, 457 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 07:55:04,281 INFO L231 Difference]: Finished difference. Result has 80 places, 84 transitions, 258 flow [2023-08-25 07:55:04,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=80, PETRI_TRANSITIONS=84} [2023-08-25 07:55:04,282 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 2 predicate places. [2023-08-25 07:55:04,282 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 258 flow [2023-08-25 07:55:04,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:04,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:55:04,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:55:04,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 07:55:04,283 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-25 07:55:04,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:55:04,283 INFO L85 PathProgramCache]: Analyzing trace with hash 220740320, now seen corresponding path program 1 times [2023-08-25 07:55:04,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:55:04,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875460182] [2023-08-25 07:55:04,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:55:04,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:55:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:55:04,311 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-25 07:55:04,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:55:04,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875460182] [2023-08-25 07:55:04,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875460182] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:55:04,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:55:04,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:55:04,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32052673] [2023-08-25 07:55:04,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:55:04,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:55:04,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:55:04,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:55:04,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:55:04,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 256 [2023-08-25 07:55:04,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:04,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:55:04,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 256 [2023-08-25 07:55:04,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:55:04,672 INFO L124 PetriNetUnfolderBase]: 2130/4379 cut-off events. [2023-08-25 07:55:04,672 INFO L125 PetriNetUnfolderBase]: For 786/913 co-relation queries the response was YES. [2023-08-25 07:55:04,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8718 conditions, 4379 events. 2130/4379 cut-off events. For 786/913 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 31253 event pairs, 1470 based on Foata normal form. 26/3524 useless extension candidates. Maximal degree in co-relation 7468. Up to 3200 conditions per place. [2023-08-25 07:55:04,706 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 67 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2023-08-25 07:55:04,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 106 transitions, 457 flow [2023-08-25 07:55:04,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:55:04,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:55:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2023-08-25 07:55:04,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6171875 [2023-08-25 07:55:04,715 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 474 transitions. [2023-08-25 07:55:04,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 474 transitions. [2023-08-25 07:55:04,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:55:04,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 474 transitions. [2023-08-25 07:55:04,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:04,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:04,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:04,720 INFO L175 Difference]: Start difference. First operand has 80 places, 84 transitions, 258 flow. Second operand 3 states and 474 transitions. [2023-08-25 07:55:04,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 106 transitions, 457 flow [2023-08-25 07:55:04,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 106 transitions, 447 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 07:55:04,725 INFO L231 Difference]: Finished difference. Result has 81 places, 87 transitions, 279 flow [2023-08-25 07:55:04,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=81, PETRI_TRANSITIONS=87} [2023-08-25 07:55:04,728 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 3 predicate places. [2023-08-25 07:55:04,728 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 87 transitions, 279 flow [2023-08-25 07:55:04,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:04,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:55:04,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:55:04,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 07:55:04,729 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr2Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-25 07:55:04,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:55:04,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1678209179, now seen corresponding path program 1 times [2023-08-25 07:55:04,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:55:04,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942103954] [2023-08-25 07:55:04,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:55:04,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:55:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:55:04,792 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-25 07:55:04,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:55:04,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942103954] [2023-08-25 07:55:04,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942103954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:55:04,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:55:04,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:55:04,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888251627] [2023-08-25 07:55:04,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:55:04,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:55:04,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:55:04,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:55:04,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:55:04,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 256 [2023-08-25 07:55:04,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 87 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:04,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:55:04,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 256 [2023-08-25 07:55:04,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:55:05,302 INFO L124 PetriNetUnfolderBase]: 2722/5763 cut-off events. [2023-08-25 07:55:05,302 INFO L125 PetriNetUnfolderBase]: For 1316/1492 co-relation queries the response was YES. [2023-08-25 07:55:05,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11831 conditions, 5763 events. 2722/5763 cut-off events. For 1316/1492 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 43790 event pairs, 806 based on Foata normal form. 24/4747 useless extension candidates. Maximal degree in co-relation 8702. Up to 2304 conditions per place. [2023-08-25 07:55:05,347 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 82 selfloop transitions, 5 changer transitions 0/121 dead transitions. [2023-08-25 07:55:05,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 121 transitions, 546 flow [2023-08-25 07:55:05,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:55:05,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:55:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2023-08-25 07:55:05,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6471354166666666 [2023-08-25 07:55:05,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2023-08-25 07:55:05,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2023-08-25 07:55:05,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:55:05,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2023-08-25 07:55:05,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:05,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:05,352 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:05,352 INFO L175 Difference]: Start difference. First operand has 81 places, 87 transitions, 279 flow. Second operand 3 states and 497 transitions. [2023-08-25 07:55:05,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 121 transitions, 546 flow [2023-08-25 07:55:05,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 121 transitions, 541 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 07:55:05,357 INFO L231 Difference]: Finished difference. Result has 84 places, 92 transitions, 322 flow [2023-08-25 07:55:05,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=84, PETRI_TRANSITIONS=92} [2023-08-25 07:55:05,358 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 6 predicate places. [2023-08-25 07:55:05,358 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 92 transitions, 322 flow [2023-08-25 07:55:05,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:05,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:55:05,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:55:05,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 07:55:05,359 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-25 07:55:05,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:55:05,360 INFO L85 PathProgramCache]: Analyzing trace with hash -936206302, now seen corresponding path program 1 times [2023-08-25 07:55:05,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:55:05,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371685222] [2023-08-25 07:55:05,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:55:05,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:55:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:55:05,382 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-25 07:55:05,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:55:05,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371685222] [2023-08-25 07:55:05,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371685222] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 07:55:05,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 07:55:05,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 07:55:05,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620712226] [2023-08-25 07:55:05,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 07:55:05,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 07:55:05,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:55:05,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 07:55:05,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 07:55:05,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 256 [2023-08-25 07:55:05,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 92 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:05,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:55:05,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 256 [2023-08-25 07:55:05,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:55:06,160 INFO L124 PetriNetUnfolderBase]: 5247/11010 cut-off events. [2023-08-25 07:55:06,161 INFO L125 PetriNetUnfolderBase]: For 3091/3460 co-relation queries the response was YES. [2023-08-25 07:55:06,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22906 conditions, 11010 events. 5247/11010 cut-off events. For 3091/3460 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 94932 event pairs, 1807 based on Foata normal form. 80/9065 useless extension candidates. Maximal degree in co-relation 15768. Up to 4330 conditions per place. [2023-08-25 07:55:06,239 INFO L140 encePairwiseOnDemand]: 248/256 looper letters, 94 selfloop transitions, 8 changer transitions 0/139 dead transitions. [2023-08-25 07:55:06,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 139 transitions, 679 flow [2023-08-25 07:55:06,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 07:55:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 07:55:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2023-08-25 07:55:06,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6484375 [2023-08-25 07:55:06,242 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 498 transitions. [2023-08-25 07:55:06,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions. [2023-08-25 07:55:06,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:55:06,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions. [2023-08-25 07:55:06,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:06,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:06,246 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:06,246 INFO L175 Difference]: Start difference. First operand has 84 places, 92 transitions, 322 flow. Second operand 3 states and 498 transitions. [2023-08-25 07:55:06,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 139 transitions, 679 flow [2023-08-25 07:55:06,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 139 transitions, 665 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 07:55:06,254 INFO L231 Difference]: Finished difference. Result has 86 places, 100 transitions, 396 flow [2023-08-25 07:55:06,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=86, PETRI_TRANSITIONS=100} [2023-08-25 07:55:06,255 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 8 predicate places. [2023-08-25 07:55:06,255 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 100 transitions, 396 flow [2023-08-25 07:55:06,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:55:06,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:55:06,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:55:06,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 07:55:06,258 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-25 07:55:06,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:55:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash -268228267, now seen corresponding path program 1 times [2023-08-25 07:55:06,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:55:06,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973491191] [2023-08-25 07:55:06,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:55:06,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:55:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 07:55:06,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-25 07:55:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 07:55:06,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-25 07:55:06,318 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-25 07:55:06,319 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr2Err0ASSERT_VIOLATIONDATA_RACE (35 of 36 remaining) [2023-08-25 07:55:06,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2023-08-25 07:55:06,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2023-08-25 07:55:06,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2023-08-25 07:55:06,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2023-08-25 07:55:06,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2023-08-25 07:55:06,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (29 of 36 remaining) [2023-08-25 07:55:06,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONASSERT (28 of 36 remaining) [2023-08-25 07:55:06,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2023-08-25 07:55:06,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2023-08-25 07:55:06,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2023-08-25 07:55:06,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2023-08-25 07:55:06,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2023-08-25 07:55:06,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2023-08-25 07:55:06,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2023-08-25 07:55:06,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONASSERT (20 of 36 remaining) [2023-08-25 07:55:06,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2023-08-25 07:55:06,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2023-08-25 07:55:06,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2023-08-25 07:55:06,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 36 remaining) [2023-08-25 07:55:06,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 36 remaining) [2023-08-25 07:55:06,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (14 of 36 remaining) [2023-08-25 07:55:06,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (13 of 36 remaining) [2023-08-25 07:55:06,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (12 of 36 remaining) [2023-08-25 07:55:06,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2023-08-25 07:55:06,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2023-08-25 07:55:06,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONASSERT (9 of 36 remaining) [2023-08-25 07:55:06,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2023-08-25 07:55:06,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2023-08-25 07:55:06,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2023-08-25 07:55:06,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2023-08-25 07:55:06,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2023-08-25 07:55:06,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2023-08-25 07:55:06,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2023-08-25 07:55:06,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONASSERT (1 of 36 remaining) [2023-08-25 07:55:06,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2023-08-25 07:55:06,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 07:55:06,338 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:55:06,345 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 07:55:06,345 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 07:55:06,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 07:55:06 BasicIcfg [2023-08-25 07:55:06,380 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 07:55:06,380 INFO L158 Benchmark]: Toolchain (without parser) took 7010.89ms. Allocated memory was 358.6MB in the beginning and 629.1MB in the end (delta: 270.5MB). Free memory was 333.8MB in the beginning and 329.2MB in the end (delta: 4.6MB). Peak memory consumption was 276.7MB. Max. memory is 16.0GB. [2023-08-25 07:55:06,381 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 358.6MB. Free memory was 336.8MB in the beginning and 336.8MB in the end (delta: 86.2kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 07:55:06,381 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.72ms. Allocated memory is still 358.6MB. Free memory was 333.8MB in the beginning and 314.4MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-25 07:55:06,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.67ms. Allocated memory is still 358.6MB. Free memory was 314.4MB in the beginning and 312.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 07:55:06,381 INFO L158 Benchmark]: Boogie Preprocessor took 54.63ms. Allocated memory is still 358.6MB. Free memory was 312.3MB in the beginning and 310.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 07:55:06,381 INFO L158 Benchmark]: RCFGBuilder took 474.52ms. Allocated memory is still 358.6MB. Free memory was 310.2MB in the beginning and 293.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-08-25 07:55:06,382 INFO L158 Benchmark]: TraceAbstraction took 6092.53ms. Allocated memory was 358.6MB in the beginning and 629.1MB in the end (delta: 270.5MB). Free memory was 292.4MB in the beginning and 329.2MB in the end (delta: -36.8MB). Peak memory consumption was 236.9MB. Max. memory is 16.0GB. [2023-08-25 07:55:06,383 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 358.6MB. Free memory was 336.8MB in the beginning and 336.8MB in the end (delta: 86.2kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 341.72ms. Allocated memory is still 358.6MB. Free memory was 333.8MB in the beginning and 314.4MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.67ms. Allocated memory is still 358.6MB. Free memory was 314.4MB in the beginning and 312.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.63ms. Allocated memory is still 358.6MB. Free memory was 312.3MB in the beginning and 310.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 474.52ms. Allocated memory is still 358.6MB. Free memory was 310.2MB in the beginning and 293.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 6092.53ms. Allocated memory was 358.6MB in the beginning and 629.1MB in the end (delta: 270.5MB). Free memory was 292.4MB in the beginning and 329.2MB in the end (delta: -36.8MB). Peak memory consumption was 236.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 249]: Unsoundness Warning unspecified type, defaulting to int C: short [249] - GenericResultAtLocation [Line: 249]: Unsoundness Warning unspecified type, defaulting to int C: short [249] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 148 PlacesBefore, 78 PlacesAfterwards, 151 TransitionsBefore, 81 TransitionsAfterwards, 9396 CoEnabledTransitionPairs, 5 FixpointIterations, 17 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 0 ChoiceCompositions, 94 TotalNumberOfCompositions, 33507 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14724, independent: 14113, independent conditional: 0, independent unconditional: 14113, dependent: 611, dependent conditional: 0, dependent unconditional: 611, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4868, independent: 4766, independent conditional: 0, independent unconditional: 4766, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14724, independent: 9347, independent conditional: 0, independent unconditional: 9347, dependent: 509, dependent conditional: 0, dependent unconditional: 509, unknown: 4868, unknown conditional: 0, unknown unconditional: 4868] , Statistics on independence cache: Total cache size (in pairs): 1042, Positive cache size: 976, Positive conditional cache size: 0, Positive unconditional cache size: 976, Negative cache size: 66, Negative conditional cache size: 0, Negative unconditional cache size: 66, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - DataRaceFoundResult [Line: 697]: Data race detected Data race detected The following path leads to a data race: [L684] 0 int flag1 = 0, flag2 = 0; [L685] 0 int turn; [L686] 0 int x; [L706] 0 pthread_t t1, t2; [L707] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=0, t1={5:0}, t2={3:0}, turn=0, x=0] [L688] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L689] 1 turn = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=1, x=0] [L708] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=1, flag2=0, pthread_create(&t2, 0, thr2, 0)=1, t1={5:0}, t2={3:0}, turn=1, x=0] [L697] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2 = 1=51, flag2=1, turn=1, x=0] [L690] 1 flag2==1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=1, turn=1, x=0] [L697] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2 = 1=51, flag2=1, turn=1, x=0] Now there is a data race on ~flag2~0 between C: flag2==1 [690] and C: flag2 = 1 [697] - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 689]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 255 locations, 36 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 174 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 708 IncrementalHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 42 mSDtfsCounter, 708 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=396occurred in iteration=7, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 72 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-25 07:55:06,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...