./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:10:54,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:10:54,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:10:54,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:10:54,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:10:54,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:10:54,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:10:54,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:10:54,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:10:54,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:10:54,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:10:54,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:10:54,442 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:10:54,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:10:54,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:10:54,443 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:10:54,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:10:54,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:10:54,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:10:54,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:10:54,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:10:54,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:10:54,450 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:10:54,451 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:10:54,451 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:10:54,452 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:10:54,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:10:54,452 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:10:54,453 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:10:54,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:10:54,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:10:54,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:10:54,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:10:54,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:10:54,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:10:54,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:10:54,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:10:54,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:10:54,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:10:54,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:10:54,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:10:54,457 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-clean/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-clean/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 -> 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 [2024-10-11 17:10:54,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:10:54,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:10:54,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:10:54,740 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:10:54,741 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:10:54,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i [2024-10-11 17:10:56,191 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:10:56,429 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:10:56,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i [2024-10-11 17:10:56,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2fec48b79/1a1a64f6c3a04a2ead58e15c77a89ccd/FLAG04815512f [2024-10-11 17:10:56,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2fec48b79/1a1a64f6c3a04a2ead58e15c77a89ccd [2024-10-11 17:10:56,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:10:56,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:10:56,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:10:56,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:10:56,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:10:56,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:10:56" (1/1) ... [2024-10-11 17:10:56,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32beaaa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:56, skipping insertion in model container [2024-10-11 17:10:56,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:10:56" (1/1) ... [2024-10-11 17:10:56,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:10:57,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:10:57,229 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:10:57,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:10:57,341 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:10:57,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:57 WrapperNode [2024-10-11 17:10:57,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:10:57,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:10:57,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:10:57,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:10:57,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:57" (1/1) ... [2024-10-11 17:10:57,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:57" (1/1) ... [2024-10-11 17:10:57,405 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 108 [2024-10-11 17:10:57,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:10:57,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:10:57,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:10:57,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:10:57,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:57" (1/1) ... [2024-10-11 17:10:57,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:57" (1/1) ... [2024-10-11 17:10:57,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:57" (1/1) ... [2024-10-11 17:10:57,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:57" (1/1) ... [2024-10-11 17:10:57,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:57" (1/1) ... [2024-10-11 17:10:57,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:57" (1/1) ... [2024-10-11 17:10:57,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:57" (1/1) ... [2024-10-11 17:10:57,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:57" (1/1) ... [2024-10-11 17:10:57,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:10:57,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:10:57,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:10:57,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:10:57,465 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:57" (1/1) ... [2024-10-11 17:10:57,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:10:57,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:10:57,507 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:10:57,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:10:57,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:10:57,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:10:57,558 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 17:10:57,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:10:57,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:10:57,558 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-11 17:10:57,559 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-11 17:10:57,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:10:57,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:10:57,559 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 17:10:57,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:10:57,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:10:57,561 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:10:57,689 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:10:57,693 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:10:58,056 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:10:58,057 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:10:58,105 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:10:58,107 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-11 17:10:58,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:10:58 BoogieIcfgContainer [2024-10-11 17:10:58,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:10:58,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:10:58,112 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:10:58,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:10:58,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:10:56" (1/3) ... [2024-10-11 17:10:58,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b33e0c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:10:58, skipping insertion in model container [2024-10-11 17:10:58,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:57" (2/3) ... [2024-10-11 17:10:58,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b33e0c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:10:58, skipping insertion in model container [2024-10-11 17:10:58,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:10:58" (3/3) ... [2024-10-11 17:10:58,118 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_37-indirect_racing.i [2024-10-11 17:10:58,135 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:10:58,136 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-10-11 17:10:58,136 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:10:58,213 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 17:10:58,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 185 transitions, 377 flow [2024-10-11 17:10:58,387 INFO L124 PetriNetUnfolderBase]: 19/248 cut-off events. [2024-10-11 17:10:58,387 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:10:58,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 248 events. 19/248 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 135. Up to 4 conditions per place. [2024-10-11 17:10:58,403 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 185 transitions, 377 flow [2024-10-11 17:10:58,411 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 185 transitions, 377 flow [2024-10-11 17:10:58,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:10:58,434 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;@384e7a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:10:58,434 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-11 17:10:58,446 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:10:58,447 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-10-11 17:10:58,447 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:10:58,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:58,448 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] [2024-10-11 17:10:58,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:10:58,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:58,454 INFO L85 PathProgramCache]: Analyzing trace with hash -519905131, now seen corresponding path program 1 times [2024-10-11 17:10:58,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:58,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725277962] [2024-10-11 17:10:58,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:58,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:58,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:58,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725277962] [2024-10-11 17:10:58,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725277962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:58,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:58,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:58,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856837694] [2024-10-11 17:10:58,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:58,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:58,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:58,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:58,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:58,786 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 185 [2024-10-11 17:10:58,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 185 transitions, 377 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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-10-11 17:10:58,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:58,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 185 [2024-10-11 17:10:58,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:58,918 INFO L124 PetriNetUnfolderBase]: 25/497 cut-off events. [2024-10-11 17:10:58,918 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:10:58,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 497 events. 25/497 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1943 event pairs, 24 based on Foata normal form. 54/500 useless extension candidates. Maximal degree in co-relation 451. Up to 69 conditions per place. [2024-10-11 17:10:58,924 INFO L140 encePairwiseOnDemand]: 170/185 looper letters, 16 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2024-10-11 17:10:58,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 383 flow [2024-10-11 17:10:58,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2024-10-11 17:10:58,940 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8828828828828829 [2024-10-11 17:10:58,942 INFO L175 Difference]: Start difference. First operand has 175 places, 185 transitions, 377 flow. Second operand 3 states and 490 transitions. [2024-10-11 17:10:58,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 383 flow [2024-10-11 17:10:58,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 170 transitions, 383 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:58,952 INFO L231 Difference]: Finished difference. Result has 174 places, 170 transitions, 351 flow [2024-10-11 17:10:58,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=174, PETRI_TRANSITIONS=170} [2024-10-11 17:10:58,958 INFO L277 CegarLoopForPetriNet]: 175 programPoint places, -1 predicate places. [2024-10-11 17:10:58,959 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 351 flow [2024-10-11 17:10:58,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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-10-11 17:10:58,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:58,960 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-10-11 17:10:58,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:10:58,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:10:58,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:58,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1412609993, now seen corresponding path program 1 times [2024-10-11 17:10:58,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:58,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694327766] [2024-10-11 17:10:58,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:58,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:59,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:59,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:59,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694327766] [2024-10-11 17:10:59,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694327766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:59,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:59,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:59,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320758887] [2024-10-11 17:10:59,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:59,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:59,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:59,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:59,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:59,070 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 185 [2024-10-11 17:10:59,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 170 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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-10-11 17:10:59,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:59,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 185 [2024-10-11 17:10:59,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:59,187 INFO L124 PetriNetUnfolderBase]: 25/494 cut-off events. [2024-10-11 17:10:59,188 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:10:59,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 494 events. 25/494 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1936 event pairs, 24 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 530. Up to 66 conditions per place. [2024-10-11 17:10:59,191 INFO L140 encePairwiseOnDemand]: 182/185 looper letters, 14 selfloop transitions, 1 changer transitions 0/168 dead transitions. [2024-10-11 17:10:59,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 168 transitions, 377 flow [2024-10-11 17:10:59,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2024-10-11 17:10:59,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8684684684684685 [2024-10-11 17:10:59,198 INFO L175 Difference]: Start difference. First operand has 174 places, 170 transitions, 351 flow. Second operand 3 states and 482 transitions. [2024-10-11 17:10:59,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 168 transitions, 377 flow [2024-10-11 17:10:59,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 168 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:10:59,205 INFO L231 Difference]: Finished difference. Result has 172 places, 168 transitions, 345 flow [2024-10-11 17:10:59,206 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=345, PETRI_PLACES=172, PETRI_TRANSITIONS=168} [2024-10-11 17:10:59,207 INFO L277 CegarLoopForPetriNet]: 175 programPoint places, -3 predicate places. [2024-10-11 17:10:59,208 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 345 flow [2024-10-11 17:10:59,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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-10-11 17:10:59,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:59,208 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] [2024-10-11 17:10:59,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:10:59,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:10:59,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash -138604748, now seen corresponding path program 1 times [2024-10-11 17:10:59,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:59,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413009962] [2024-10-11 17:10:59,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:59,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:59,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:59,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413009962] [2024-10-11 17:10:59,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413009962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:59,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:59,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:10:59,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154305240] [2024-10-11 17:10:59,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:59,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:59,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:59,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:59,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:59,303 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 185 [2024-10-11 17:10:59,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 168 transitions, 345 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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-10-11 17:10:59,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:59,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 185 [2024-10-11 17:10:59,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:59,388 INFO L124 PetriNetUnfolderBase]: 25/431 cut-off events. [2024-10-11 17:10:59,388 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:10:59,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 431 events. 25/431 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1623 event pairs, 24 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 470. Up to 68 conditions per place. [2024-10-11 17:10:59,392 INFO L140 encePairwiseOnDemand]: 182/185 looper letters, 16 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2024-10-11 17:10:59,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 167 transitions, 379 flow [2024-10-11 17:10:59,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2024-10-11 17:10:59,394 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8612612612612612 [2024-10-11 17:10:59,394 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 345 flow. Second operand 3 states and 478 transitions. [2024-10-11 17:10:59,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 167 transitions, 379 flow [2024-10-11 17:10:59,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 167 transitions, 378 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:10:59,400 INFO L231 Difference]: Finished difference. Result has 172 places, 167 transitions, 346 flow [2024-10-11 17:10:59,400 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=172, PETRI_TRANSITIONS=167} [2024-10-11 17:10:59,401 INFO L277 CegarLoopForPetriNet]: 175 programPoint places, -3 predicate places. [2024-10-11 17:10:59,402 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 167 transitions, 346 flow [2024-10-11 17:10:59,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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-10-11 17:10:59,403 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:59,403 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, 1, 1, 1, 1, 1] [2024-10-11 17:10:59,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:10:59,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:10:59,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:59,405 INFO L85 PathProgramCache]: Analyzing trace with hash 798048297, now seen corresponding path program 1 times [2024-10-11 17:10:59,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:59,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415533422] [2024-10-11 17:10:59,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:59,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:00,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:00,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415533422] [2024-10-11 17:11:00,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415533422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:00,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:00,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:11:00,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522846041] [2024-10-11 17:11:00,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:00,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:11:00,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:00,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:11:00,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:11:00,253 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 185 [2024-10-11 17:11:00,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 167 transitions, 346 flow. Second operand has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 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-10-11 17:11:00,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:00,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 185 [2024-10-11 17:11:00,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:00,692 INFO L124 PetriNetUnfolderBase]: 535/2115 cut-off events. [2024-10-11 17:11:00,692 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:11:00,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3285 conditions, 2115 events. 535/2115 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 14624 event pairs, 303 based on Foata normal form. 0/1940 useless extension candidates. Maximal degree in co-relation 3247. Up to 988 conditions per place. [2024-10-11 17:11:00,705 INFO L140 encePairwiseOnDemand]: 162/185 looper letters, 71 selfloop transitions, 70 changer transitions 0/260 dead transitions. [2024-10-11 17:11:00,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 260 transitions, 814 flow [2024-10-11 17:11:00,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:11:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:11:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 886 transitions. [2024-10-11 17:11:00,709 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7981981981981981 [2024-10-11 17:11:00,709 INFO L175 Difference]: Start difference. First operand has 172 places, 167 transitions, 346 flow. Second operand 6 states and 886 transitions. [2024-10-11 17:11:00,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 260 transitions, 814 flow [2024-10-11 17:11:00,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 260 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:11:00,718 INFO L231 Difference]: Finished difference. Result has 180 places, 236 transitions, 804 flow [2024-10-11 17:11:00,719 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=804, PETRI_PLACES=180, PETRI_TRANSITIONS=236} [2024-10-11 17:11:00,720 INFO L277 CegarLoopForPetriNet]: 175 programPoint places, 5 predicate places. [2024-10-11 17:11:00,721 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 236 transitions, 804 flow [2024-10-11 17:11:00,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 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-10-11 17:11:00,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:00,722 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:00,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:11:00,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:11:00,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash 329997752, now seen corresponding path program 1 times [2024-10-11 17:11:00,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:00,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947454655] [2024-10-11 17:11:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:00,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:00,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947454655] [2024-10-11 17:11:00,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947454655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:00,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:00,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:11:00,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133363533] [2024-10-11 17:11:00,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:00,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:00,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:00,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:00,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:00,804 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 185 [2024-10-11 17:11:00,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 236 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 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-10-11 17:11:00,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:00,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 185 [2024-10-11 17:11:00,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:00,932 INFO L124 PetriNetUnfolderBase]: 176/1067 cut-off events. [2024-10-11 17:11:00,933 INFO L125 PetriNetUnfolderBase]: For 119/136 co-relation queries the response was YES. [2024-10-11 17:11:00,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1729 conditions, 1067 events. 176/1067 cut-off events. For 119/136 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6029 event pairs, 20 based on Foata normal form. 1/991 useless extension candidates. Maximal degree in co-relation 1687. Up to 191 conditions per place. [2024-10-11 17:11:00,940 INFO L140 encePairwiseOnDemand]: 182/185 looper letters, 20 selfloop transitions, 3 changer transitions 0/242 dead transitions. [2024-10-11 17:11:00,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 242 transitions, 862 flow [2024-10-11 17:11:00,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:00,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2024-10-11 17:11:00,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8846846846846846 [2024-10-11 17:11:00,942 INFO L175 Difference]: Start difference. First operand has 180 places, 236 transitions, 804 flow. Second operand 3 states and 491 transitions. [2024-10-11 17:11:00,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 242 transitions, 862 flow [2024-10-11 17:11:00,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 242 transitions, 862 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:11:00,954 INFO L231 Difference]: Finished difference. Result has 183 places, 236 transitions, 815 flow [2024-10-11 17:11:00,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=815, PETRI_PLACES=183, PETRI_TRANSITIONS=236} [2024-10-11 17:11:00,956 INFO L277 CegarLoopForPetriNet]: 175 programPoint places, 8 predicate places. [2024-10-11 17:11:00,956 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 236 transitions, 815 flow [2024-10-11 17:11:00,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 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-10-11 17:11:00,957 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:00,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:00,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:11:00,958 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:11:00,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:00,962 INFO L85 PathProgramCache]: Analyzing trace with hash -571676016, now seen corresponding path program 1 times [2024-10-11 17:11:00,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:00,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137351766] [2024-10-11 17:11:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:00,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:01,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:01,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137351766] [2024-10-11 17:11:01,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137351766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:01,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:01,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:01,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95322881] [2024-10-11 17:11:01,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:01,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:01,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:01,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:01,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:01,040 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 185 [2024-10-11 17:11:01,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 236 transitions, 815 flow. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 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-10-11 17:11:01,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:01,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 185 [2024-10-11 17:11:01,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:01,151 INFO L124 PetriNetUnfolderBase]: 145/864 cut-off events. [2024-10-11 17:11:01,151 INFO L125 PetriNetUnfolderBase]: For 109/128 co-relation queries the response was YES. [2024-10-11 17:11:01,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 864 events. 145/864 cut-off events. For 109/128 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4710 event pairs, 4 based on Foata normal form. 0/817 useless extension candidates. Maximal degree in co-relation 1463. Up to 221 conditions per place. [2024-10-11 17:11:01,157 INFO L140 encePairwiseOnDemand]: 182/185 looper letters, 16 selfloop transitions, 1 changer transitions 0/236 dead transitions. [2024-10-11 17:11:01,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 236 transitions, 849 flow [2024-10-11 17:11:01,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2024-10-11 17:11:01,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.872072072072072 [2024-10-11 17:11:01,160 INFO L175 Difference]: Start difference. First operand has 183 places, 236 transitions, 815 flow. Second operand 3 states and 484 transitions. [2024-10-11 17:11:01,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 236 transitions, 849 flow [2024-10-11 17:11:01,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 236 transitions, 843 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:11:01,167 INFO L231 Difference]: Finished difference. Result has 181 places, 234 transitions, 807 flow [2024-10-11 17:11:01,168 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=807, PETRI_PLACES=181, PETRI_TRANSITIONS=234} [2024-10-11 17:11:01,170 INFO L277 CegarLoopForPetriNet]: 175 programPoint places, 6 predicate places. [2024-10-11 17:11:01,170 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 234 transitions, 807 flow [2024-10-11 17:11:01,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 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-10-11 17:11:01,171 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:01,171 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, 1, 1, 1, 1] [2024-10-11 17:11:01,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:11:01,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-11 17:11:01,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:01,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1394837605, now seen corresponding path program 1 times [2024-10-11 17:11:01,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:01,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359195349] [2024-10-11 17:11:01,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:01,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:11:01,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:11:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:11:01,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:11:01,253 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:11:01,254 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2024-10-11 17:11:01,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2024-10-11 17:11:01,256 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2024-10-11 17:11:01,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2024-10-11 17:11:01,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2024-10-11 17:11:01,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2024-10-11 17:11:01,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2024-10-11 17:11:01,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2024-10-11 17:11:01,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2024-10-11 17:11:01,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2024-10-11 17:11:01,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2024-10-11 17:11:01,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2024-10-11 17:11:01,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2024-10-11 17:11:01,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2024-10-11 17:11:01,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2024-10-11 17:11:01,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2024-10-11 17:11:01,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2024-10-11 17:11:01,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2024-10-11 17:11:01,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2024-10-11 17:11:01,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2024-10-11 17:11:01,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:11:01,264 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:01,266 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:11:01,267 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:11:01,315 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:11:01,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 241 places, 256 transitions, 528 flow [2024-10-11 17:11:01,365 INFO L124 PetriNetUnfolderBase]: 34/410 cut-off events. [2024-10-11 17:11:01,366 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:11:01,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 410 events. 34/410 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1564 event pairs, 0 based on Foata normal form. 0/344 useless extension candidates. Maximal degree in co-relation 250. Up to 8 conditions per place. [2024-10-11 17:11:01,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 241 places, 256 transitions, 528 flow [2024-10-11 17:11:01,377 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 241 places, 256 transitions, 528 flow [2024-10-11 17:11:01,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:11:01,379 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;@384e7a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:11:01,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-10-11 17:11:01,382 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:11:01,384 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-10-11 17:11:01,384 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:11:01,384 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:01,384 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] [2024-10-11 17:11:01,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:01,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:01,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1225064853, now seen corresponding path program 1 times [2024-10-11 17:11:01,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:01,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178682244] [2024-10-11 17:11:01,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:01,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:01,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:01,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178682244] [2024-10-11 17:11:01,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178682244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:01,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:01,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:01,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927817061] [2024-10-11 17:11:01,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:01,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:01,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:01,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:01,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:01,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 256 [2024-10-11 17:11:01,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 256 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 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-10-11 17:11:01,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:01,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 256 [2024-10-11 17:11:01,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:01,949 INFO L124 PetriNetUnfolderBase]: 430/3697 cut-off events. [2024-10-11 17:11:01,949 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-10-11 17:11:01,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4481 conditions, 3697 events. 430/3697 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 32095 event pairs, 420 based on Foata normal form. 578/3897 useless extension candidates. Maximal degree in co-relation 3717. Up to 739 conditions per place. [2024-10-11 17:11:01,973 INFO L140 encePairwiseOnDemand]: 235/256 looper letters, 24 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2024-10-11 17:11:01,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 235 transitions, 538 flow [2024-10-11 17:11:01,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2024-10-11 17:11:01,976 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.87890625 [2024-10-11 17:11:01,976 INFO L175 Difference]: Start difference. First operand has 241 places, 256 transitions, 528 flow. Second operand 3 states and 675 transitions. [2024-10-11 17:11:01,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 235 transitions, 538 flow [2024-10-11 17:11:01,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 235 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:11:01,980 INFO L231 Difference]: Finished difference. Result has 240 places, 235 transitions, 490 flow [2024-10-11 17:11:01,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=240, PETRI_TRANSITIONS=235} [2024-10-11 17:11:01,982 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, -1 predicate places. [2024-10-11 17:11:01,982 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 235 transitions, 490 flow [2024-10-11 17:11:01,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 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-10-11 17:11:01,985 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:01,986 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-10-11 17:11:01,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:11:01,986 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:01,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:01,987 INFO L85 PathProgramCache]: Analyzing trace with hash 466307383, now seen corresponding path program 1 times [2024-10-11 17:11:01,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:01,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024497694] [2024-10-11 17:11:01,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:01,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:02,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:02,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024497694] [2024-10-11 17:11:02,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024497694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:02,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:02,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:02,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83550524] [2024-10-11 17:11:02,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:02,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:02,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:02,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:02,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:02,023 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 256 [2024-10-11 17:11:02,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 235 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 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-10-11 17:11:02,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:02,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 256 [2024-10-11 17:11:02,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:02,592 INFO L124 PetriNetUnfolderBase]: 418/3631 cut-off events. [2024-10-11 17:11:02,592 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-10-11 17:11:02,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4396 conditions, 3631 events. 418/3631 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 31166 event pairs, 414 based on Foata normal form. 0/3274 useless extension candidates. Maximal degree in co-relation 4355. Up to 717 conditions per place. [2024-10-11 17:11:02,616 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 22 selfloop transitions, 1 changer transitions 0/233 dead transitions. [2024-10-11 17:11:02,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 233 transitions, 532 flow [2024-10-11 17:11:02,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2024-10-11 17:11:02,621 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8606770833333334 [2024-10-11 17:11:02,621 INFO L175 Difference]: Start difference. First operand has 240 places, 235 transitions, 490 flow. Second operand 3 states and 661 transitions. [2024-10-11 17:11:02,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 233 transitions, 532 flow [2024-10-11 17:11:02,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 233 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:11:02,625 INFO L231 Difference]: Finished difference. Result has 238 places, 233 transitions, 484 flow [2024-10-11 17:11:02,626 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=238, PETRI_TRANSITIONS=233} [2024-10-11 17:11:02,627 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, -3 predicate places. [2024-10-11 17:11:02,627 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 233 transitions, 484 flow [2024-10-11 17:11:02,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 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-10-11 17:11:02,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:02,628 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] [2024-10-11 17:11:02,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:11:02,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:02,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:02,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1196085300, now seen corresponding path program 1 times [2024-10-11 17:11:02,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:02,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365179823] [2024-10-11 17:11:02,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:02,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:02,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:02,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365179823] [2024-10-11 17:11:02,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365179823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:02,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:02,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:02,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964932210] [2024-10-11 17:11:02,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:02,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:02,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:02,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:02,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:02,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 256 [2024-10-11 17:11:02,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 233 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 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-10-11 17:11:02,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:02,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 256 [2024-10-11 17:11:02,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:03,223 INFO L124 PetriNetUnfolderBase]: 564/3800 cut-off events. [2024-10-11 17:11:03,224 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-10-11 17:11:03,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4814 conditions, 3800 events. 564/3800 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 33926 event pairs, 552 based on Foata normal form. 0/3412 useless extension candidates. Maximal degree in co-relation 4775. Up to 957 conditions per place. [2024-10-11 17:11:03,247 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 26 selfloop transitions, 2 changer transitions 0/232 dead transitions. [2024-10-11 17:11:03,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 232 transitions, 538 flow [2024-10-11 17:11:03,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 653 transitions. [2024-10-11 17:11:03,250 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8502604166666666 [2024-10-11 17:11:03,250 INFO L175 Difference]: Start difference. First operand has 238 places, 233 transitions, 484 flow. Second operand 3 states and 653 transitions. [2024-10-11 17:11:03,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 232 transitions, 538 flow [2024-10-11 17:11:03,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 232 transitions, 537 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:11:03,254 INFO L231 Difference]: Finished difference. Result has 238 places, 232 transitions, 485 flow [2024-10-11 17:11:03,255 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=485, PETRI_PLACES=238, PETRI_TRANSITIONS=232} [2024-10-11 17:11:03,256 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, -3 predicate places. [2024-10-11 17:11:03,256 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 232 transitions, 485 flow [2024-10-11 17:11:03,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 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-10-11 17:11:03,257 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:03,257 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, 1, 1, 1, 1, 1] [2024-10-11 17:11:03,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:11:03,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:03,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1062347049, now seen corresponding path program 1 times [2024-10-11 17:11:03,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:03,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303813279] [2024-10-11 17:11:03,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:03,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:03,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:03,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:03,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303813279] [2024-10-11 17:11:03,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303813279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:03,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:03,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:11:03,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820426715] [2024-10-11 17:11:03,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:03,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:11:03,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:03,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:11:03,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:11:03,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 256 [2024-10-11 17:11:03,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 232 transitions, 485 flow. Second operand has 6 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 0 states have call successors, (0), 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-10-11 17:11:03,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:03,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 256 [2024-10-11 17:11:03,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:11,107 INFO L124 PetriNetUnfolderBase]: 27083/64954 cut-off events. [2024-10-11 17:11:11,108 INFO L125 PetriNetUnfolderBase]: For 733/733 co-relation queries the response was YES. [2024-10-11 17:11:11,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107320 conditions, 64954 events. 27083/64954 cut-off events. For 733/733 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 726108 event pairs, 18139 based on Foata normal form. 0/60423 useless extension candidates. Maximal degree in co-relation 107281. Up to 37375 conditions per place. [2024-10-11 17:11:11,491 INFO L140 encePairwiseOnDemand]: 217/256 looper letters, 120 selfloop transitions, 134 changer transitions 0/414 dead transitions. [2024-10-11 17:11:11,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 414 transitions, 1362 flow [2024-10-11 17:11:11,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:11:11,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:11:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1245 transitions. [2024-10-11 17:11:11,495 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.810546875 [2024-10-11 17:11:11,496 INFO L175 Difference]: Start difference. First operand has 238 places, 232 transitions, 485 flow. Second operand 6 states and 1245 transitions. [2024-10-11 17:11:11,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 414 transitions, 1362 flow [2024-10-11 17:11:11,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 414 transitions, 1358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:11:11,516 INFO L231 Difference]: Finished difference. Result has 246 places, 365 transitions, 1359 flow [2024-10-11 17:11:11,517 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1359, PETRI_PLACES=246, PETRI_TRANSITIONS=365} [2024-10-11 17:11:11,518 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, 5 predicate places. [2024-10-11 17:11:11,518 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 365 transitions, 1359 flow [2024-10-11 17:11:11,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 0 states have call successors, (0), 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-10-11 17:11:11,519 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:11,519 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:11,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:11:11,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:11,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:11,521 INFO L85 PathProgramCache]: Analyzing trace with hash 918036152, now seen corresponding path program 1 times [2024-10-11 17:11:11,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:11,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249246357] [2024-10-11 17:11:11,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:11,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:11,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:11,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249246357] [2024-10-11 17:11:11,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249246357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:11,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:11,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:11:11,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378513457] [2024-10-11 17:11:11,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:11,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:11,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:11,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:11,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:11,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 256 [2024-10-11 17:11:11,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 365 transitions, 1359 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 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-10-11 17:11:11,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:11,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 256 [2024-10-11 17:11:11,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:15,327 INFO L124 PetriNetUnfolderBase]: 10377/34063 cut-off events. [2024-10-11 17:11:15,327 INFO L125 PetriNetUnfolderBase]: For 5308/5785 co-relation queries the response was YES. [2024-10-11 17:11:15,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60238 conditions, 34063 events. 10377/34063 cut-off events. For 5308/5785 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 393695 event pairs, 4204 based on Foata normal form. 1/31230 useless extension candidates. Maximal degree in co-relation 60195. Up to 11276 conditions per place. [2024-10-11 17:11:15,552 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 30 selfloop transitions, 3 changer transitions 0/373 dead transitions. [2024-10-11 17:11:15,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 373 transitions, 1447 flow [2024-10-11 17:11:15,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 671 transitions. [2024-10-11 17:11:15,554 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8736979166666666 [2024-10-11 17:11:15,554 INFO L175 Difference]: Start difference. First operand has 246 places, 365 transitions, 1359 flow. Second operand 3 states and 671 transitions. [2024-10-11 17:11:15,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 373 transitions, 1447 flow [2024-10-11 17:11:15,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 373 transitions, 1447 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:11:15,698 INFO L231 Difference]: Finished difference. Result has 249 places, 367 transitions, 1384 flow [2024-10-11 17:11:15,698 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1384, PETRI_PLACES=249, PETRI_TRANSITIONS=367} [2024-10-11 17:11:15,699 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, 8 predicate places. [2024-10-11 17:11:15,700 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 367 transitions, 1384 flow [2024-10-11 17:11:15,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 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-10-11 17:11:15,700 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:15,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:15,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:11:15,701 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:15,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:15,701 INFO L85 PathProgramCache]: Analyzing trace with hash -666200619, now seen corresponding path program 1 times [2024-10-11 17:11:15,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:15,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166419037] [2024-10-11 17:11:15,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:15,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:15,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:15,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166419037] [2024-10-11 17:11:15,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166419037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:15,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:15,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:11:15,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333673899] [2024-10-11 17:11:15,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:15,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:11:15,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:15,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:11:15,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:11:15,764 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 256 [2024-10-11 17:11:15,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 367 transitions, 1384 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 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-10-11 17:11:15,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:15,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 256 [2024-10-11 17:11:15,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:19,200 INFO L124 PetriNetUnfolderBase]: 9976/30271 cut-off events. [2024-10-11 17:11:19,200 INFO L125 PetriNetUnfolderBase]: For 5161/5599 co-relation queries the response was YES. [2024-10-11 17:11:19,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56400 conditions, 30271 events. 9976/30271 cut-off events. For 5161/5599 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 336112 event pairs, 2877 based on Foata normal form. 0/28566 useless extension candidates. Maximal degree in co-relation 56356. Up to 10725 conditions per place. [2024-10-11 17:11:19,395 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 34 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2024-10-11 17:11:19,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 372 transitions, 1471 flow [2024-10-11 17:11:19,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:11:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:11:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2024-10-11 17:11:19,398 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8567708333333334 [2024-10-11 17:11:19,398 INFO L175 Difference]: Start difference. First operand has 249 places, 367 transitions, 1384 flow. Second operand 3 states and 658 transitions. [2024-10-11 17:11:19,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 372 transitions, 1471 flow [2024-10-11 17:11:19,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 372 transitions, 1468 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:11:19,524 INFO L231 Difference]: Finished difference. Result has 247 places, 365 transitions, 1387 flow [2024-10-11 17:11:19,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1387, PETRI_PLACES=247, PETRI_TRANSITIONS=365} [2024-10-11 17:11:19,526 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, 6 predicate places. [2024-10-11 17:11:19,526 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 365 transitions, 1387 flow [2024-10-11 17:11:19,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 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-10-11 17:11:19,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:19,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:19,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:11:19,527 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:19,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:19,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1164571068, now seen corresponding path program 1 times [2024-10-11 17:11:19,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:19,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476397209] [2024-10-11 17:11:19,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:19,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:19,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:19,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476397209] [2024-10-11 17:11:19,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476397209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:19,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:19,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:11:19,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035709182] [2024-10-11 17:11:19,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:19,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:11:19,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:19,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:11:19,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:11:20,127 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 256 [2024-10-11 17:11:20,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 365 transitions, 1387 flow. Second operand has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 0 states have call successors, (0), 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-10-11 17:11:20,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:20,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 256 [2024-10-11 17:11:20,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:29,585 INFO L124 PetriNetUnfolderBase]: 35577/80673 cut-off events. [2024-10-11 17:11:29,585 INFO L125 PetriNetUnfolderBase]: For 33687/37279 co-relation queries the response was YES. [2024-10-11 17:11:29,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187284 conditions, 80673 events. 35577/80673 cut-off events. For 33687/37279 co-relation queries the response was YES. Maximal size of possible extension queue 1849. Compared 907583 event pairs, 7719 based on Foata normal form. 84/77047 useless extension candidates. Maximal degree in co-relation 187239. Up to 33919 conditions per place. [2024-10-11 17:11:30,120 INFO L140 encePairwiseOnDemand]: 208/256 looper letters, 463 selfloop transitions, 219 changer transitions 0/848 dead transitions. [2024-10-11 17:11:30,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 848 transitions, 4965 flow [2024-10-11 17:11:30,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:11:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:11:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1342 transitions. [2024-10-11 17:11:30,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8736979166666666 [2024-10-11 17:11:30,124 INFO L175 Difference]: Start difference. First operand has 247 places, 365 transitions, 1387 flow. Second operand 6 states and 1342 transitions. [2024-10-11 17:11:30,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 848 transitions, 4965 flow [2024-10-11 17:11:30,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 848 transitions, 4965 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:11:30,500 INFO L231 Difference]: Finished difference. Result has 257 places, 596 transitions, 3703 flow [2024-10-11 17:11:30,501 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3703, PETRI_PLACES=257, PETRI_TRANSITIONS=596} [2024-10-11 17:11:30,501 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, 16 predicate places. [2024-10-11 17:11:30,502 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 596 transitions, 3703 flow [2024-10-11 17:11:30,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 0 states have call successors, (0), 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-10-11 17:11:30,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:30,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:30,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:11:30,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:30,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:30,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1173917037, now seen corresponding path program 1 times [2024-10-11 17:11:30,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:30,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605007043] [2024-10-11 17:11:30,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:30,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:30,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:30,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:30,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605007043] [2024-10-11 17:11:30,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605007043] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:11:30,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764537636] [2024-10-11 17:11:30,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:30,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:11:30,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:11:30,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:11:30,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:11:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:30,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:11:30,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:11:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:30,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:11:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:30,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764537636] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:11:30,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:11:30,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 17:11:30,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655620343] [2024-10-11 17:11:30,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:11:30,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:11:30,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:30,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:11:30,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:11:30,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 256 [2024-10-11 17:11:30,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 596 transitions, 3703 flow. Second operand has 10 states, 10 states have (on average 212.2) internal successors, (2122), 10 states have internal predecessors, (2122), 0 states have call successors, (0), 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-10-11 17:11:30,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:30,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 256 [2024-10-11 17:11:30,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:38,245 INFO L124 PetriNetUnfolderBase]: 21570/55483 cut-off events. [2024-10-11 17:11:38,245 INFO L125 PetriNetUnfolderBase]: For 52183/55860 co-relation queries the response was YES. [2024-10-11 17:11:38,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151217 conditions, 55483 events. 21570/55483 cut-off events. For 52183/55860 co-relation queries the response was YES. Maximal size of possible extension queue 1053. Compared 614195 event pairs, 2519 based on Foata normal form. 596/54631 useless extension candidates. Maximal degree in co-relation 151167. Up to 19817 conditions per place. [2024-10-11 17:11:38,686 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 72 selfloop transitions, 9 changer transitions 0/606 dead transitions. [2024-10-11 17:11:38,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 606 transitions, 3877 flow [2024-10-11 17:11:38,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:11:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 17:11:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1971 transitions. [2024-10-11 17:11:38,690 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.85546875 [2024-10-11 17:11:38,690 INFO L175 Difference]: Start difference. First operand has 257 places, 596 transitions, 3703 flow. Second operand 9 states and 1971 transitions. [2024-10-11 17:11:38,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 606 transitions, 3877 flow [2024-10-11 17:11:39,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 606 transitions, 3859 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-11 17:11:39,661 INFO L231 Difference]: Finished difference. Result has 219 places, 550 transitions, 3603 flow [2024-10-11 17:11:39,661 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=3581, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3603, PETRI_PLACES=219, PETRI_TRANSITIONS=550} [2024-10-11 17:11:39,662 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, -22 predicate places. [2024-10-11 17:11:39,662 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 550 transitions, 3603 flow [2024-10-11 17:11:39,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 212.2) internal successors, (2122), 10 states have internal predecessors, (2122), 0 states have call successors, (0), 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-10-11 17:11:39,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:39,663 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, 1, 1, 1, 1, 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-10-11 17:11:39,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:11:39,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 17:11:39,865 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:39,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:39,865 INFO L85 PathProgramCache]: Analyzing trace with hash 966835269, now seen corresponding path program 1 times [2024-10-11 17:11:39,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:39,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233213498] [2024-10-11 17:11:39,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:39,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:11:40,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:40,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233213498] [2024-10-11 17:11:40,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233213498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:11:40,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:11:40,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:11:40,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197433691] [2024-10-11 17:11:40,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:11:40,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:11:40,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:11:40,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:11:40,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:11:40,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 256 [2024-10-11 17:11:40,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 550 transitions, 3603 flow. Second operand has 6 states, 6 states have (on average 165.33333333333334) internal successors, (992), 6 states have internal predecessors, (992), 0 states have call successors, (0), 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-10-11 17:11:40,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:11:40,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 256 [2024-10-11 17:11:40,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:11:50,147 INFO L124 PetriNetUnfolderBase]: 33630/74283 cut-off events. [2024-10-11 17:11:50,147 INFO L125 PetriNetUnfolderBase]: For 105292/112116 co-relation queries the response was YES. [2024-10-11 17:11:50,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242174 conditions, 74283 events. 33630/74283 cut-off events. For 105292/112116 co-relation queries the response was YES. Maximal size of possible extension queue 1339. Compared 776909 event pairs, 7086 based on Foata normal form. 451/73468 useless extension candidates. Maximal degree in co-relation 242123. Up to 46282 conditions per place. [2024-10-11 17:11:50,696 INFO L140 encePairwiseOnDemand]: 225/256 looper letters, 512 selfloop transitions, 252 changer transitions 0/889 dead transitions. [2024-10-11 17:11:50,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 889 transitions, 7465 flow [2024-10-11 17:11:50,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:11:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:11:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1180 transitions. [2024-10-11 17:11:50,699 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7682291666666666 [2024-10-11 17:11:50,699 INFO L175 Difference]: Start difference. First operand has 219 places, 550 transitions, 3603 flow. Second operand 6 states and 1180 transitions. [2024-10-11 17:11:50,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 889 transitions, 7465 flow [2024-10-11 17:11:51,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 889 transitions, 7442 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-10-11 17:11:51,728 INFO L231 Difference]: Finished difference. Result has 224 places, 800 transitions, 6736 flow [2024-10-11 17:11:51,729 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=3580, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6736, PETRI_PLACES=224, PETRI_TRANSITIONS=800} [2024-10-11 17:11:51,729 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, -17 predicate places. [2024-10-11 17:11:51,729 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 800 transitions, 6736 flow [2024-10-11 17:11:51,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 165.33333333333334) internal successors, (992), 6 states have internal predecessors, (992), 0 states have call successors, (0), 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-10-11 17:11:51,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:11:51,730 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:11:51,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:11:51,731 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-11 17:11:51,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:11:51,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1589139369, now seen corresponding path program 1 times [2024-10-11 17:11:51,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:11:51,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515429434] [2024-10-11 17:11:51,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:51,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:11:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:11:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:11:52,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:11:52,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515429434] [2024-10-11 17:11:52,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515429434] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:11:52,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665311218] [2024-10-11 17:11:52,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:11:52,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:11:52,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:11:52,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:11:52,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process