./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/airline-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/airline-25.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0d81069750f24e52e04bdb7efecd6d77b64aec41e058c154f75fbba11e6c11d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:01:04,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:01:04,828 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 06:01:04,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:01:04,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:01:04,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:01:04,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:01:04,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:01:04,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:01:04,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:01:04,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:01:04,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:01:04,870 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:01:04,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:01:04,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:01:04,871 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:01:04,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:01:04,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:01:04,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:01:04,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:01:04,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:01:04,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:01:04,876 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 06:01:04,876 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:01:04,876 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:01:04,876 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:01:04,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:01:04,877 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:01:04,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:01:04,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:01:04,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:01:04,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:01:04,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:01:04,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:01:04,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 06:01:04,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:01:04,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:01:04,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:01:04,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:01:04,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:01:04,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:01:04,879 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0d81069750f24e52e04bdb7efecd6d77b64aec41e058c154f75fbba11e6c11d [2024-11-19 06:01:05,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:01:05,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:01:05,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:01:05,117 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:01:05,118 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:01:05,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/airline-25.i [2024-11-19 06:01:06,374 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:01:06,605 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:01:06,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/airline-25.i [2024-11-19 06:01:06,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e013051/f0fc88a334e444b3ae6a1cafe000bc61/FLAGa5e838d3b [2024-11-19 06:01:06,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e013051/f0fc88a334e444b3ae6a1cafe000bc61 [2024-11-19 06:01:06,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:01:06,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:01:06,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:01:06,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:01:06,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:01:06,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:01:06" (1/1) ... [2024-11-19 06:01:06,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25c11fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:06, skipping insertion in model container [2024-11-19 06:01:06,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:01:06" (1/1) ... [2024-11-19 06:01:06,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:01:07,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:01:07,288 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:01:07,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:01:07,370 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:01:07,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:07 WrapperNode [2024-11-19 06:01:07,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:01:07,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:01:07,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:01:07,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:01:07,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:07" (1/1) ... [2024-11-19 06:01:07,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:07" (1/1) ... [2024-11-19 06:01:07,418 INFO L138 Inliner]: procedures = 162, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2024-11-19 06:01:07,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:01:07,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:01:07,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:01:07,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:01:07,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:07" (1/1) ... [2024-11-19 06:01:07,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:07" (1/1) ... [2024-11-19 06:01:07,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:07" (1/1) ... [2024-11-19 06:01:07,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:07" (1/1) ... [2024-11-19 06:01:07,437 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:07" (1/1) ... [2024-11-19 06:01:07,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:07" (1/1) ... [2024-11-19 06:01:07,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:07" (1/1) ... [2024-11-19 06:01:07,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:07" (1/1) ... [2024-11-19 06:01:07,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:01:07,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:01:07,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:01:07,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:01:07,466 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:07" (1/1) ... [2024-11-19 06:01:07,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:01:07,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:01:07,504 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:01:07,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:01:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 06:01:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 06:01:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 06:01:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:01:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:01:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2024-11-19 06:01:07,570 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2024-11-19 06:01:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:01:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 06:01:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 06:01:07,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:01:07,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:01:07,572 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 06:01:07,733 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:01:07,738 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:01:07,972 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 06:01:07,973 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:01:08,009 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:01:08,010 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 06:01:08,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:01:08 BoogieIcfgContainer [2024-11-19 06:01:08,010 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:01:08,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:01:08,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:01:08,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:01:08,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:01:06" (1/3) ... [2024-11-19 06:01:08,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b12fc6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:01:08, skipping insertion in model container [2024-11-19 06:01:08,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:01:07" (2/3) ... [2024-11-19 06:01:08,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b12fc6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:01:08, skipping insertion in model container [2024-11-19 06:01:08,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:01:08" (3/3) ... [2024-11-19 06:01:08,020 INFO L112 eAbstractionObserver]: Analyzing ICFG airline-25.i [2024-11-19 06:01:08,034 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:01:08,034 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-19 06:01:08,034 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 06:01:08,089 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 06:01:08,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 99 transitions, 205 flow [2024-11-19 06:01:08,169 INFO L124 PetriNetUnfolderBase]: 11/144 cut-off events. [2024-11-19 06:01:08,170 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 06:01:08,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 144 events. 11/144 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 307 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 70. Up to 4 conditions per place. [2024-11-19 06:01:08,176 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 99 transitions, 205 flow [2024-11-19 06:01:08,180 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 99 transitions, 205 flow [2024-11-19 06:01:08,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:01:08,193 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@63f7bc41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:01:08,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-19 06:01:08,197 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:01:08,197 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2024-11-19 06:01:08,198 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:01:08,198 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:01:08,200 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:08,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-19 06:01:08,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:01:08,205 INFO L85 PathProgramCache]: Analyzing trace with hash -694234630, now seen corresponding path program 1 times [2024-11-19 06:01:08,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:01:08,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073095374] [2024-11-19 06:01:08,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:08,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:01:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:01:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:01:08,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:01:08,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073095374] [2024-11-19 06:01:08,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073095374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:01:08,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:01:08,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 06:01:08,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973146727] [2024-11-19 06:01:08,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:01:08,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:01:08,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:01:08,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:01:08,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:01:08,375 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 99 [2024-11-19 06:01:08,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 99 transitions, 205 flow. Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:08,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:01:08,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 99 [2024-11-19 06:01:08,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:01:08,417 INFO L124 PetriNetUnfolderBase]: 3/127 cut-off events. [2024-11-19 06:01:08,418 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-19 06:01:08,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 3/127 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 253 event pairs, 0 based on Foata normal form. 10/121 useless extension candidates. Maximal degree in co-relation 64. Up to 8 conditions per place. [2024-11-19 06:01:08,421 INFO L140 encePairwiseOnDemand]: 90/99 looper letters, 7 selfloop transitions, 0 changer transitions 0/88 dead transitions. [2024-11-19 06:01:08,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 88 transitions, 197 flow [2024-11-19 06:01:08,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:01:08,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-19 06:01:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 180 transitions. [2024-11-19 06:01:08,432 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2024-11-19 06:01:08,433 INFO L175 Difference]: Start difference. First operand has 95 places, 99 transitions, 205 flow. Second operand 2 states and 180 transitions. [2024-11-19 06:01:08,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 88 transitions, 197 flow [2024-11-19 06:01:08,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 197 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:01:08,438 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 183 flow [2024-11-19 06:01:08,443 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=183, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2024-11-19 06:01:08,446 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -6 predicate places. [2024-11-19 06:01:08,447 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 183 flow [2024-11-19 06:01:08,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:08,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:01:08,447 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:08,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:01:08,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-19 06:01:08,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:01:08,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1899843324, now seen corresponding path program 1 times [2024-11-19 06:01:08,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:01:08,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557077283] [2024-11-19 06:01:08,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:01:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:01:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:01:08,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:01:08,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557077283] [2024-11-19 06:01:08,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557077283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:01:08,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:01:08,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:01:08,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712485732] [2024-11-19 06:01:08,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:01:08,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:01:08,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:01:08,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:01:08,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:01:08,609 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 99 [2024-11-19 06:01:08,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:08,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:01:08,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 99 [2024-11-19 06:01:08,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:01:08,666 INFO L124 PetriNetUnfolderBase]: 10/174 cut-off events. [2024-11-19 06:01:08,667 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 06:01:08,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 174 events. 10/174 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 441 event pairs, 0 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 203. Up to 23 conditions per place. [2024-11-19 06:01:08,670 INFO L140 encePairwiseOnDemand]: 96/99 looper letters, 13 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-11-19 06:01:08,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 217 flow [2024-11-19 06:01:08,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:01:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:01:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2024-11-19 06:01:08,673 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8215488215488216 [2024-11-19 06:01:08,673 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 183 flow. Second operand 3 states and 244 transitions. [2024-11-19 06:01:08,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 217 flow [2024-11-19 06:01:08,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 217 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:01:08,679 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 191 flow [2024-11-19 06:01:08,679 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2024-11-19 06:01:08,680 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -3 predicate places. [2024-11-19 06:01:08,680 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 191 flow [2024-11-19 06:01:08,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:08,681 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:01:08,681 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:08,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:01:08,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-19 06:01:08,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:01:08,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1901875597, now seen corresponding path program 1 times [2024-11-19 06:01:08,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:01:08,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317665483] [2024-11-19 06:01:08,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:08,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:01:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:01:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:01:09,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:01:09,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317665483] [2024-11-19 06:01:09,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317665483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:01:09,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:01:09,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:01:09,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17527782] [2024-11-19 06:01:09,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:01:09,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:01:09,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:01:09,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:01:09,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:01:09,310 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 99 [2024-11-19 06:01:09,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:09,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:01:09,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 99 [2024-11-19 06:01:09,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:01:09,394 INFO L124 PetriNetUnfolderBase]: 33/198 cut-off events. [2024-11-19 06:01:09,394 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-19 06:01:09,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 198 events. 33/198 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 653 event pairs, 9 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 292. Up to 56 conditions per place. [2024-11-19 06:01:09,396 INFO L140 encePairwiseOnDemand]: 93/99 looper letters, 28 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2024-11-19 06:01:09,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 95 transitions, 271 flow [2024-11-19 06:01:09,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:01:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:01:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 412 transitions. [2024-11-19 06:01:09,401 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6936026936026936 [2024-11-19 06:01:09,402 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 191 flow. Second operand 6 states and 412 transitions. [2024-11-19 06:01:09,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 95 transitions, 271 flow [2024-11-19 06:01:09,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 95 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:01:09,405 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 195 flow [2024-11-19 06:01:09,405 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2024-11-19 06:01:09,406 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -1 predicate places. [2024-11-19 06:01:09,407 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 195 flow [2024-11-19 06:01:09,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:09,407 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:01:09,407 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:09,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:01:09,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-19 06:01:09,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:01:09,409 INFO L85 PathProgramCache]: Analyzing trace with hash -517437541, now seen corresponding path program 1 times [2024-11-19 06:01:09,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:01:09,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661021034] [2024-11-19 06:01:09,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:09,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:01:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:01:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:01:09,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:01:09,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661021034] [2024-11-19 06:01:09,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661021034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:01:09,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:01:09,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:01:09,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893150943] [2024-11-19 06:01:09,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:01:09,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:01:09,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:01:09,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:01:09,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:01:09,453 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 99 [2024-11-19 06:01:09,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:09,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:01:09,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 99 [2024-11-19 06:01:09,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:01:09,484 INFO L124 PetriNetUnfolderBase]: 1/154 cut-off events. [2024-11-19 06:01:09,484 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2024-11-19 06:01:09,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 154 events. 1/154 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 309 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 179. Up to 7 conditions per place. [2024-11-19 06:01:09,486 INFO L140 encePairwiseOnDemand]: 96/99 looper letters, 8 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2024-11-19 06:01:09,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 87 transitions, 218 flow [2024-11-19 06:01:09,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:01:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:01:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2024-11-19 06:01:09,488 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.835016835016835 [2024-11-19 06:01:09,490 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 195 flow. Second operand 3 states and 248 transitions. [2024-11-19 06:01:09,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 87 transitions, 218 flow [2024-11-19 06:01:09,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 87 transitions, 208 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 06:01:09,492 INFO L231 Difference]: Finished difference. Result has 90 places, 86 transitions, 187 flow [2024-11-19 06:01:09,492 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=90, PETRI_TRANSITIONS=86} [2024-11-19 06:01:09,492 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -5 predicate places. [2024-11-19 06:01:09,492 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 187 flow [2024-11-19 06:01:09,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:09,493 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:01:09,493 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:09,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:01:09,494 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-19 06:01:09,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:01:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash -343848704, now seen corresponding path program 1 times [2024-11-19 06:01:09,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:01:09,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839578278] [2024-11-19 06:01:09,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:09,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:01:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:01:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:01:09,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:01:09,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839578278] [2024-11-19 06:01:09,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839578278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:01:09,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:01:09,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:01:09,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494890390] [2024-11-19 06:01:09,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:01:09,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:01:09,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:01:09,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:01:09,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:01:09,545 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 99 [2024-11-19 06:01:09,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:09,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:01:09,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 99 [2024-11-19 06:01:09,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:01:09,578 INFO L124 PetriNetUnfolderBase]: 8/228 cut-off events. [2024-11-19 06:01:09,579 INFO L125 PetriNetUnfolderBase]: For 10/18 co-relation queries the response was YES. [2024-11-19 06:01:09,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 228 events. 8/228 cut-off events. For 10/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 817 event pairs, 4 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 272. Up to 25 conditions per place. [2024-11-19 06:01:09,582 INFO L140 encePairwiseOnDemand]: 93/99 looper letters, 12 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2024-11-19 06:01:09,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 89 transitions, 228 flow [2024-11-19 06:01:09,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:01:09,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:01:09,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2024-11-19 06:01:09,584 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8282828282828283 [2024-11-19 06:01:09,584 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 187 flow. Second operand 3 states and 246 transitions. [2024-11-19 06:01:09,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 89 transitions, 228 flow [2024-11-19 06:01:09,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 89 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:01:09,587 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 211 flow [2024-11-19 06:01:09,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2024-11-19 06:01:09,588 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -4 predicate places. [2024-11-19 06:01:09,590 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 211 flow [2024-11-19 06:01:09,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:09,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:01:09,590 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:09,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:01:09,590 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-19 06:01:09,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:01:09,592 INFO L85 PathProgramCache]: Analyzing trace with hash -773710453, now seen corresponding path program 1 times [2024-11-19 06:01:09,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:01:09,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078503525] [2024-11-19 06:01:09,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:09,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:01:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:01:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:01:09,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:01:09,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078503525] [2024-11-19 06:01:09,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078503525] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:01:09,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945929001] [2024-11-19 06:01:09,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:09,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:01:09,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:01:09,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:01:09,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:01:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:01:09,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:01:09,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:01:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:01:09,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:01:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:01:09,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945929001] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:01:09,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:01:09,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 06:01:09,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176401438] [2024-11-19 06:01:09,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:01:09,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:01:09,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:01:09,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:01:09,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:01:10,033 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 99 [2024-11-19 06:01:10,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 211 flow. Second operand has 10 states, 10 states have (on average 75.4) internal successors, (754), 10 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:10,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:01:10,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 99 [2024-11-19 06:01:10,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:01:10,089 INFO L124 PetriNetUnfolderBase]: 9/101 cut-off events. [2024-11-19 06:01:10,089 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-19 06:01:10,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 101 events. 9/101 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 194 event pairs, 0 based on Foata normal form. 3/100 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2024-11-19 06:01:10,092 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 15 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2024-11-19 06:01:10,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 182 flow [2024-11-19 06:01:10,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:01:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:01:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 458 transitions. [2024-11-19 06:01:10,093 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7710437710437711 [2024-11-19 06:01:10,093 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 211 flow. Second operand 6 states and 458 transitions. [2024-11-19 06:01:10,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 182 flow [2024-11-19 06:01:10,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 59 transitions, 160 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 06:01:10,095 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 116 flow [2024-11-19 06:01:10,095 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2024-11-19 06:01:10,095 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -36 predicate places. [2024-11-19 06:01:10,095 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 116 flow [2024-11-19 06:01:10,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.4) internal successors, (754), 10 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:10,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:01:10,096 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:10,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 06:01:10,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 06:01:10,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-19 06:01:10,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:01:10,302 INFO L85 PathProgramCache]: Analyzing trace with hash -542448446, now seen corresponding path program 1 times [2024-11-19 06:01:10,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:01:10,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661077000] [2024-11-19 06:01:10,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:10,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:01:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:01:10,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:01:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:01:10,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:01:10,352 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:01:10,353 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2024-11-19 06:01:10,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-11-19 06:01:10,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-11-19 06:01:10,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-11-19 06:01:10,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-11-19 06:01:10,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-11-19 06:01:10,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-11-19 06:01:10,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-11-19 06:01:10,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-11-19 06:01:10,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-11-19 06:01:10,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-11-19 06:01:10,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-11-19 06:01:10,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-11-19 06:01:10,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-11-19 06:01:10,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-11-19 06:01:10,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:01:10,359 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:10,361 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 06:01:10,361 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-19 06:01:10,380 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 06:01:10,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 120 transitions, 256 flow [2024-11-19 06:01:10,403 INFO L124 PetriNetUnfolderBase]: 22/256 cut-off events. [2024-11-19 06:01:10,403 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 06:01:10,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 256 events. 22/256 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 600 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2024-11-19 06:01:10,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 120 transitions, 256 flow [2024-11-19 06:01:10,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 120 transitions, 256 flow [2024-11-19 06:01:10,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:01:10,409 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@63f7bc41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:01:10,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-11-19 06:01:10,411 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:01:10,411 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2024-11-19 06:01:10,411 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:01:10,411 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:01:10,411 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:10,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-19 06:01:10,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:01:10,413 INFO L85 PathProgramCache]: Analyzing trace with hash 424036858, now seen corresponding path program 1 times [2024-11-19 06:01:10,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:01:10,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85640024] [2024-11-19 06:01:10,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:01:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:01:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:01:10,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:01:10,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85640024] [2024-11-19 06:01:10,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85640024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:01:10,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:01:10,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 06:01:10,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006185480] [2024-11-19 06:01:10,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:01:10,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:01:10,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:01:10,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:01:10,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:01:10,427 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2024-11-19 06:01:10,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 120 transitions, 256 flow. Second operand has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:10,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:01:10,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2024-11-19 06:01:10,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:01:10,466 INFO L124 PetriNetUnfolderBase]: 19/254 cut-off events. [2024-11-19 06:01:10,466 INFO L125 PetriNetUnfolderBase]: For 38/44 co-relation queries the response was YES. [2024-11-19 06:01:10,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 254 events. 19/254 cut-off events. For 38/44 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 732 event pairs, 4 based on Foata normal form. 26/246 useless extension candidates. Maximal degree in co-relation 144. Up to 30 conditions per place. [2024-11-19 06:01:10,468 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 11 selfloop transitions, 0 changer transitions 0/107 dead transitions. [2024-11-19 06:01:10,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 107 transitions, 252 flow [2024-11-19 06:01:10,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:01:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-19 06:01:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 216 transitions. [2024-11-19 06:01:10,469 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9 [2024-11-19 06:01:10,469 INFO L175 Difference]: Start difference. First operand has 115 places, 120 transitions, 256 flow. Second operand 2 states and 216 transitions. [2024-11-19 06:01:10,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 107 transitions, 252 flow [2024-11-19 06:01:10,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 107 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:01:10,471 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 230 flow [2024-11-19 06:01:10,471 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=230, PETRI_PLACES=107, PETRI_TRANSITIONS=107} [2024-11-19 06:01:10,471 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -8 predicate places. [2024-11-19 06:01:10,471 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 230 flow [2024-11-19 06:01:10,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:10,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:01:10,472 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:10,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:01:10,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-19 06:01:10,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:01:10,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1451332092, now seen corresponding path program 1 times [2024-11-19 06:01:10,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:01:10,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403354900] [2024-11-19 06:01:10,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:10,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:01:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:01:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:01:10,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:01:10,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403354900] [2024-11-19 06:01:10,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403354900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:01:10,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:01:10,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:01:10,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232018092] [2024-11-19 06:01:10,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:01:10,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:01:10,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:01:10,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:01:10,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:01:10,515 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2024-11-19 06:01:10,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:10,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:01:10,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2024-11-19 06:01:10,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:01:10,584 INFO L124 PetriNetUnfolderBase]: 60/451 cut-off events. [2024-11-19 06:01:10,585 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-11-19 06:01:10,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 451 events. 60/451 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2086 event pairs, 24 based on Foata normal form. 1/395 useless extension candidates. Maximal degree in co-relation 568. Up to 97 conditions per place. [2024-11-19 06:01:10,590 INFO L140 encePairwiseOnDemand]: 117/120 looper letters, 18 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2024-11-19 06:01:10,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 110 transitions, 276 flow [2024-11-19 06:01:10,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:01:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:01:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2024-11-19 06:01:10,591 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2024-11-19 06:01:10,591 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 230 flow. Second operand 3 states and 294 transitions. [2024-11-19 06:01:10,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 110 transitions, 276 flow [2024-11-19 06:01:10,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 110 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:01:10,594 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 242 flow [2024-11-19 06:01:10,594 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2024-11-19 06:01:10,594 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -5 predicate places. [2024-11-19 06:01:10,595 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 242 flow [2024-11-19 06:01:10,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:10,596 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:01:10,596 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:10,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:01:10,596 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-19 06:01:10,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:01:10,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1947140101, now seen corresponding path program 1 times [2024-11-19 06:01:10,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:01:10,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69259101] [2024-11-19 06:01:10,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:10,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:01:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:01:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:01:10,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:01:10,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69259101] [2024-11-19 06:01:10,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69259101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:01:10,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:01:10,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:01:10,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98079963] [2024-11-19 06:01:10,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:01:10,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:01:10,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:01:10,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:01:10,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:01:10,858 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 120 [2024-11-19 06:01:10,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:10,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:01:10,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 120 [2024-11-19 06:01:10,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:01:10,983 INFO L124 PetriNetUnfolderBase]: 185/628 cut-off events. [2024-11-19 06:01:10,983 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-19 06:01:10,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 628 events. 185/628 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3492 event pairs, 55 based on Foata normal form. 0/568 useless extension candidates. Maximal degree in co-relation 974. Up to 214 conditions per place. [2024-11-19 06:01:10,988 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 41 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2024-11-19 06:01:10,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 123 transitions, 364 flow [2024-11-19 06:01:10,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:01:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:01:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2024-11-19 06:01:10,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7138888888888889 [2024-11-19 06:01:10,990 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 242 flow. Second operand 6 states and 514 transitions. [2024-11-19 06:01:10,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 123 transitions, 364 flow [2024-11-19 06:01:10,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 123 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 06:01:10,992 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 248 flow [2024-11-19 06:01:10,993 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2024-11-19 06:01:10,994 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -2 predicate places. [2024-11-19 06:01:10,994 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 248 flow [2024-11-19 06:01:10,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:10,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:01:10,995 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:10,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:01:10,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-19 06:01:10,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:01:10,996 INFO L85 PathProgramCache]: Analyzing trace with hash -709870816, now seen corresponding path program 1 times [2024-11-19 06:01:10,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:01:10,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886325903] [2024-11-19 06:01:10,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:10,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:01:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:01:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:01:11,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:01:11,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886325903] [2024-11-19 06:01:11,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886325903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:01:11,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:01:11,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:01:11,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639821551] [2024-11-19 06:01:11,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:01:11,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:01:11,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:01:11,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:01:11,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:01:11,043 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2024-11-19 06:01:11,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 107 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:11,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:01:11,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2024-11-19 06:01:11,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:01:11,139 INFO L124 PetriNetUnfolderBase]: 60/772 cut-off events. [2024-11-19 06:01:11,139 INFO L125 PetriNetUnfolderBase]: For 122/386 co-relation queries the response was YES. [2024-11-19 06:01:11,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 772 events. 60/772 cut-off events. For 122/386 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5064 event pairs, 9 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 951. Up to 62 conditions per place. [2024-11-19 06:01:11,143 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 22 selfloop transitions, 6 changer transitions 0/118 dead transitions. [2024-11-19 06:01:11,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 118 transitions, 337 flow [2024-11-19 06:01:11,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:01:11,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:01:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2024-11-19 06:01:11,145 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8416666666666667 [2024-11-19 06:01:11,145 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 248 flow. Second operand 3 states and 303 transitions. [2024-11-19 06:01:11,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 118 transitions, 337 flow [2024-11-19 06:01:11,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 118 transitions, 327 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 06:01:11,147 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 290 flow [2024-11-19 06:01:11,147 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2024-11-19 06:01:11,148 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2024-11-19 06:01:11,148 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 290 flow [2024-11-19 06:01:11,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:11,148 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:01:11,149 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:11,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:01:11,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-19 06:01:11,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:01:11,149 INFO L85 PathProgramCache]: Analyzing trace with hash 657915091, now seen corresponding path program 1 times [2024-11-19 06:01:11,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:01:11,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897493312] [2024-11-19 06:01:11,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:11,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:01:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:01:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:01:11,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:01:11,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897493312] [2024-11-19 06:01:11,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897493312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:01:11,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:01:11,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:01:11,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95490521] [2024-11-19 06:01:11,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:01:11,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:01:11,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:01:11,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:01:11,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:01:11,186 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 120 [2024-11-19 06:01:11,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:11,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:01:11,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 120 [2024-11-19 06:01:11,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:01:11,370 INFO L124 PetriNetUnfolderBase]: 273/1920 cut-off events. [2024-11-19 06:01:11,370 INFO L125 PetriNetUnfolderBase]: For 374/820 co-relation queries the response was YES. [2024-11-19 06:01:11,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1920 events. 273/1920 cut-off events. For 374/820 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 16766 event pairs, 93 based on Foata normal form. 1/1652 useless extension candidates. Maximal degree in co-relation 2702. Up to 395 conditions per place. [2024-11-19 06:01:11,379 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 27 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2024-11-19 06:01:11,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 126 transitions, 405 flow [2024-11-19 06:01:11,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:01:11,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:01:11,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2024-11-19 06:01:11,380 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2024-11-19 06:01:11,381 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 290 flow. Second operand 3 states and 300 transitions. [2024-11-19 06:01:11,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 126 transitions, 405 flow [2024-11-19 06:01:11,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 126 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:01:11,384 INFO L231 Difference]: Finished difference. Result has 114 places, 121 transitions, 348 flow [2024-11-19 06:01:11,385 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=114, PETRI_TRANSITIONS=121} [2024-11-19 06:01:11,386 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -1 predicate places. [2024-11-19 06:01:11,386 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 121 transitions, 348 flow [2024-11-19 06:01:11,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:11,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:01:11,387 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:11,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:01:11,387 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-19 06:01:11,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:01:11,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1536806754, now seen corresponding path program 1 times [2024-11-19 06:01:11,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:01:11,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089763239] [2024-11-19 06:01:11,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:11,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:01:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:01:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:01:11,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:01:11,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089763239] [2024-11-19 06:01:11,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089763239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:01:11,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342459246] [2024-11-19 06:01:11,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:11,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:01:11,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:01:11,458 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:01:11,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:01:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:01:11,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:01:11,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:01:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:01:11,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:01:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:01:11,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342459246] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:01:11,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:01:11,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 06:01:11,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126228701] [2024-11-19 06:01:11,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:01:11,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:01:11,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:01:11,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:01:11,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:01:11,693 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 120 [2024-11-19 06:01:11,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 121 transitions, 348 flow. Second operand has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:11,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:01:11,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 120 [2024-11-19 06:01:11,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:01:11,824 INFO L124 PetriNetUnfolderBase]: 168/824 cut-off events. [2024-11-19 06:01:11,824 INFO L125 PetriNetUnfolderBase]: For 366/427 co-relation queries the response was YES. [2024-11-19 06:01:11,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 824 events. 168/824 cut-off events. For 366/427 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5933 event pairs, 5 based on Foata normal form. 37/806 useless extension candidates. Maximal degree in co-relation 1449. Up to 104 conditions per place. [2024-11-19 06:01:11,831 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 47 selfloop transitions, 7 changer transitions 0/119 dead transitions. [2024-11-19 06:01:11,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 119 transitions, 508 flow [2024-11-19 06:01:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:01:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 06:01:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 832 transitions. [2024-11-19 06:01:11,833 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7703703703703704 [2024-11-19 06:01:11,833 INFO L175 Difference]: Start difference. First operand has 114 places, 121 transitions, 348 flow. Second operand 9 states and 832 transitions. [2024-11-19 06:01:11,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 119 transitions, 508 flow [2024-11-19 06:01:11,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 119 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:01:11,836 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 260 flow [2024-11-19 06:01:11,836 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=260, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2024-11-19 06:01:11,837 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -27 predicate places. [2024-11-19 06:01:11,837 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 260 flow [2024-11-19 06:01:11,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:11,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:01:11,838 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:11,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:01:12,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 06:01:12,043 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-19 06:01:12,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:01:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1661324039, now seen corresponding path program 1 times [2024-11-19 06:01:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:01:12,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984132510] [2024-11-19 06:01:12,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:12,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:01:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:01:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:01:12,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:01:12,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984132510] [2024-11-19 06:01:12,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984132510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:01:12,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:01:12,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:01:12,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944058735] [2024-11-19 06:01:12,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:01:12,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:01:12,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:01:12,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:01:12,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:01:12,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2024-11-19 06:01:12,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:12,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:01:12,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2024-11-19 06:01:12,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:01:12,184 INFO L124 PetriNetUnfolderBase]: 28/295 cut-off events. [2024-11-19 06:01:12,185 INFO L125 PetriNetUnfolderBase]: For 44/46 co-relation queries the response was YES. [2024-11-19 06:01:12,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 295 events. 28/295 cut-off events. For 44/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1438 event pairs, 4 based on Foata normal form. 7/284 useless extension candidates. Maximal degree in co-relation 461. Up to 29 conditions per place. [2024-11-19 06:01:12,187 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 23 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2024-11-19 06:01:12,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 97 transitions, 363 flow [2024-11-19 06:01:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:01:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 06:01:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2024-11-19 06:01:12,189 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8216666666666667 [2024-11-19 06:01:12,189 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 260 flow. Second operand 5 states and 493 transitions. [2024-11-19 06:01:12,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 97 transitions, 363 flow [2024-11-19 06:01:12,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 97 transitions, 348 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-19 06:01:12,193 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 280 flow [2024-11-19 06:01:12,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2024-11-19 06:01:12,194 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -26 predicate places. [2024-11-19 06:01:12,195 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 280 flow [2024-11-19 06:01:12,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:12,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:01:12,195 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:12,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:01:12,195 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-19 06:01:12,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:01:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash 659768417, now seen corresponding path program 1 times [2024-11-19 06:01:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:01:12,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970113890] [2024-11-19 06:01:12,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:01:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:01:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:01:12,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:01:12,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970113890] [2024-11-19 06:01:12,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970113890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:01:12,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:01:12,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:01:12,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547118017] [2024-11-19 06:01:12,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:01:12,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:01:12,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:01:12,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:01:12,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:01:12,271 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2024-11-19 06:01:12,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:12,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:01:12,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2024-11-19 06:01:12,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:01:12,316 INFO L124 PetriNetUnfolderBase]: 22/261 cut-off events. [2024-11-19 06:01:12,316 INFO L125 PetriNetUnfolderBase]: For 108/116 co-relation queries the response was YES. [2024-11-19 06:01:12,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 261 events. 22/261 cut-off events. For 108/116 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1072 event pairs, 4 based on Foata normal form. 12/264 useless extension candidates. Maximal degree in co-relation 449. Up to 33 conditions per place. [2024-11-19 06:01:12,318 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 19 selfloop transitions, 7 changer transitions 0/94 dead transitions. [2024-11-19 06:01:12,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 94 transitions, 361 flow [2024-11-19 06:01:12,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:01:12,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 06:01:12,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 489 transitions. [2024-11-19 06:01:12,319 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.815 [2024-11-19 06:01:12,320 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 280 flow. Second operand 5 states and 489 transitions. [2024-11-19 06:01:12,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 94 transitions, 361 flow [2024-11-19 06:01:12,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 94 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 06:01:12,322 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 314 flow [2024-11-19 06:01:12,322 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=314, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2024-11-19 06:01:12,323 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -21 predicate places. [2024-11-19 06:01:12,323 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 314 flow [2024-11-19 06:01:12,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:01:12,324 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:01:12,324 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:12,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:01:12,324 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-11-19 06:01:12,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:01:12,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1201801134, now seen corresponding path program 1 times [2024-11-19 06:01:12,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:01:12,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555977057] [2024-11-19 06:01:12,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:12,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:01:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:01:12,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:01:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:01:12,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:01:12,363 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:01:12,364 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (18 of 19 remaining) [2024-11-19 06:01:12,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2024-11-19 06:01:12,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2024-11-19 06:01:12,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2024-11-19 06:01:12,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2024-11-19 06:01:12,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2024-11-19 06:01:12,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2024-11-19 06:01:12,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2024-11-19 06:01:12,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2024-11-19 06:01:12,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2024-11-19 06:01:12,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2024-11-19 06:01:12,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 19 remaining) [2024-11-19 06:01:12,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2024-11-19 06:01:12,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2024-11-19 06:01:12,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2024-11-19 06:01:12,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2024-11-19 06:01:12,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2024-11-19 06:01:12,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2024-11-19 06:01:12,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2024-11-19 06:01:12,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:01:12,367 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:12,424 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-19 06:01:12,424 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:01:12,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:01:12 BasicIcfg [2024-11-19 06:01:12,428 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:01:12,429 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:01:12,429 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:01:12,429 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:01:12,430 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:01:08" (3/4) ... [2024-11-19 06:01:12,430 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 06:01:12,483 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 06:01:12,483 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:01:12,484 INFO L158 Benchmark]: Toolchain (without parser) took 5539.12ms. Allocated memory was 136.3MB in the beginning and 218.1MB in the end (delta: 81.8MB). Free memory was 80.8MB in the beginning and 79.5MB in the end (delta: 1.3MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. [2024-11-19 06:01:12,484 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 136.3MB. Free memory was 96.1MB in the beginning and 96.0MB in the end (delta: 69.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:01:12,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.31ms. Allocated memory is still 136.3MB. Free memory was 80.8MB in the beginning and 58.0MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 06:01:12,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.60ms. Allocated memory is still 136.3MB. Free memory was 58.0MB in the beginning and 55.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:01:12,484 INFO L158 Benchmark]: Boogie Preprocessor took 29.82ms. Allocated memory is still 136.3MB. Free memory was 55.7MB in the beginning and 54.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:01:12,484 INFO L158 Benchmark]: RCFGBuilder took 548.48ms. Allocated memory was 136.3MB in the beginning and 180.4MB in the end (delta: 44.0MB). Free memory was 106.4MB in the beginning and 135.1MB in the end (delta: -28.6MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-19 06:01:12,485 INFO L158 Benchmark]: TraceAbstraction took 4416.57ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 134.0MB in the beginning and 91.0MB in the end (delta: 43.0MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2024-11-19 06:01:12,485 INFO L158 Benchmark]: Witness Printer took 54.19ms. Allocated memory is still 218.1MB. Free memory was 90.0MB in the beginning and 79.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 06:01:12,486 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.17ms. Allocated memory is still 136.3MB. Free memory was 96.1MB in the beginning and 96.0MB in the end (delta: 69.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.31ms. Allocated memory is still 136.3MB. Free memory was 80.8MB in the beginning and 58.0MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.60ms. Allocated memory is still 136.3MB. Free memory was 58.0MB in the beginning and 55.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.82ms. Allocated memory is still 136.3MB. Free memory was 55.7MB in the beginning and 54.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 548.48ms. Allocated memory was 136.3MB in the beginning and 180.4MB in the end (delta: 44.0MB). Free memory was 106.4MB in the beginning and 135.1MB in the end (delta: -28.6MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4416.57ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 134.0MB in the beginning and 91.0MB in the end (delta: 43.0MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. * Witness Printer took 54.19ms. Allocated memory is still 218.1MB. Free memory was 90.0MB in the beginning and 79.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 722]: Data race detected Data race detected The following path leads to a data race: [L717] 0 int numberOfSeatsSold; VAL [numberOfSeatsSold=0] [L718] 0 int stopSales; VAL [numberOfSeatsSold=0, stopSales=0] [L719] 0 int numOfTickets; VAL [numOfTickets=0, numberOfSeatsSold=0, stopSales=0] [L736] 0 pthread_t salethreads[25]; VAL [\old(argc)=102, \old(argv)={106:103}, argc=102, numOfTickets=0, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L738] 0 numOfTickets = 25 VAL [\old(argc)=102, \old(argv)={106:103}, argc=102, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L741] 0 numberOfSeatsSold = 0 VAL [\old(argc)=102, \old(argv)={106:103}, argc=102, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L744] 0 stopSales = 0 VAL [\old(argc)=102, \old(argv)={106:103}, argc=102, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] 0 int i = 0; VAL [\old(argc)=102, \old(argv)={106:103}, argc=102, i=0, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] COND TRUE 0 i < 25 VAL [\old(argc)=102, \old(argv)={106:103}, argc=102, i=0, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=102, \old(argv)={106:103}, argc=102, i=0, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=102, \old(argv)={106:103}, argc=102, i=0, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L721] 1 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L746] 0 i++ VAL [\old(arg)={0:0}, \old(argc)=102, \old(argv)={106:103}, arg={0:0}, argc=102, i=1, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] COND TRUE 0 i < 25 VAL [\old(arg)={0:0}, \old(argc)=102, \old(argv)={106:103}, arg={0:0}, argc=102, i=1, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=102, \old(argv)={106:103}, arg={0:0}, argc=102, i=1, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=102, \old(argv)={106:103}, arg={0:0}, argc=102, i=1, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L721] 2 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 1 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L721] 2 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 2 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L723] COND FALSE 1 !(_numberOfSeatsSold >= (25 - (((25 / 10) == 0) ? 1 : (25 / 10)))) VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1 VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=25, numberOfSeatsSold=1, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=25, numberOfSeatsSold=1, stopSales=0] Now there is a data race on ~numberOfSeatsSold~0 between C: numberOfSeatsSold = _numberOfSeatsSold + 1 [729] and C: int _numberOfSeatsSold = numberOfSeatsSold; [722] - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 111 locations, 15 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: 2.2s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 356 IncrementalHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 9 mSDtfsCounter, 356 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=5, InterpolantAutomatonStates: 23, 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.9s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 499 SizeOfPredicates, 2 NumberOfNonLiveVariables, 127 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 0/3 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 129 locations, 19 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: 2.0s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 317 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 215 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 596 IncrementalHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 16 mSDtfsCounter, 596 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=5, InterpolantAutomatonStates: 36, 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.5s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 386 ConstructedInterpolants, 0 QuantifiedInterpolants, 775 SizeOfPredicates, 2 NumberOfNonLiveVariables, 127 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 22/25 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! [2024-11-19 06:01:12,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE