./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/ldv-races/race-3_2-container_of-global.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/ldv-races/race-3_2-container_of-global.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 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:02:51,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:02:51,543 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:02:51,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:02:51,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:02:51,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:02:51,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:02:51,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:02:51,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:02:51,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:02:51,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:02:51,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:02:51,595 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:02:51,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:02:51,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:02:51,598 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:02:51,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:02:51,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:02:51,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:02:51,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:02:51,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:02:51,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:02:51,601 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:02:51,601 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:02:51,601 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:02:51,601 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:02:51,602 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:02:51,602 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:02:51,602 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:02:51,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:02:51,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:02:51,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:02:51,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:02:51,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:02:51,604 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:02:51,605 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:02:51,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:02:51,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:02:51,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:02:51,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:02:51,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:02:51,607 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 -> 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 [2024-10-11 17:02:51,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:02:51,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:02:51,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:02:51,935 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:02:51,936 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:02:51,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2024-10-11 17:02:53,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:02:53,660 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:02:53,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2024-10-11 17:02:53,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b84415366/7cb5dddf68174fc991f93535322f9f07/FLAGeea97b32e [2024-10-11 17:02:53,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b84415366/7cb5dddf68174fc991f93535322f9f07 [2024-10-11 17:02:53,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:02:53,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:02:53,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:02:53,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:02:53,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:02:53,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:02:53" (1/1) ... [2024-10-11 17:02:53,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21617b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:53, skipping insertion in model container [2024-10-11 17:02:53,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:02:53" (1/1) ... [2024-10-11 17:02:53,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:02:54,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:02:54,380 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:02:54,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:02:54,497 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:02:54,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:54 WrapperNode [2024-10-11 17:02:54,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:02:54,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:02:54,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:02:54,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:02:54,508 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:02:54" (1/1) ... [2024-10-11 17:02:54,540 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:02:54" (1/1) ... [2024-10-11 17:02:54,583 INFO L138 Inliner]: procedures = 246, calls = 44, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 219 [2024-10-11 17:02:54,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:02:54,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:02:54,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:02:54,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:02:54,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:54" (1/1) ... [2024-10-11 17:02:54,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:54" (1/1) ... [2024-10-11 17:02:54,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:54" (1/1) ... [2024-10-11 17:02:54,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:54" (1/1) ... [2024-10-11 17:02:54,640 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:54" (1/1) ... [2024-10-11 17:02:54,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:54" (1/1) ... [2024-10-11 17:02:54,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:54" (1/1) ... [2024-10-11 17:02:54,653 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:54" (1/1) ... [2024-10-11 17:02:54,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:02:54,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:02:54,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:02:54,671 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:02:54,672 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:54" (1/1) ... [2024-10-11 17:02:54,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:02:54,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:02:54,705 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:02:54,709 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:02:54,760 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-10-11 17:02:54,760 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-10-11 17:02:54,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 17:02:54,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:02:54,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:02:54,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 17:02:54,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:02:54,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:02:54,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:02:54,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-11 17:02:54,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:02:54,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:02:54,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:02:54,763 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:02:55,006 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:02:55,008 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:02:55,469 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:02:55,469 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:02:55,541 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:02:55,542 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 17:02:55,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:02:55 BoogieIcfgContainer [2024-10-11 17:02:55,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:02:55,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:02:55,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:02:55,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:02:55,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:02:53" (1/3) ... [2024-10-11 17:02:55,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d1f818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:02:55, skipping insertion in model container [2024-10-11 17:02:55,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:54" (2/3) ... [2024-10-11 17:02:55,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d1f818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:02:55, skipping insertion in model container [2024-10-11 17:02:55,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:02:55" (3/3) ... [2024-10-11 17:02:55,554 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2024-10-11 17:02:55,570 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:02:55,570 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2024-10-11 17:02:55,571 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:02:55,657 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:02:55,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 305 transitions, 624 flow [2024-10-11 17:02:55,959 INFO L124 PetriNetUnfolderBase]: 18/389 cut-off events. [2024-10-11 17:02:55,960 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:02:55,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 389 events. 18/389 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 681 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 225. Up to 4 conditions per place. [2024-10-11 17:02:55,968 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 305 transitions, 624 flow [2024-10-11 17:02:55,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 302 transitions, 616 flow [2024-10-11 17:02:55,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:02:55,999 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;@6784b8a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:02:55,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-10-11 17:02:56,008 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:02:56,009 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-10-11 17:02:56,009 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:02:56,010 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:56,010 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] [2024-10-11 17:02:56,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:02:56,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:56,017 INFO L85 PathProgramCache]: Analyzing trace with hash -169560373, now seen corresponding path program 1 times [2024-10-11 17:02:56,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253125601] [2024-10-11 17:02:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:56,992 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:02:56,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:56,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253125601] [2024-10-11 17:02:56,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253125601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:56,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:56,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:02:56,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312587889] [2024-10-11 17:02:56,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:57,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:02:57,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:57,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:02:57,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:02:57,421 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 305 [2024-10-11 17:02:57,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 302 transitions, 616 flow. Second operand has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 0 states have call successors, (0), 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:02:57,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:57,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 305 [2024-10-11 17:02:57,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:57,934 INFO L124 PetriNetUnfolderBase]: 424/1680 cut-off events. [2024-10-11 17:02:57,934 INFO L125 PetriNetUnfolderBase]: For 28/38 co-relation queries the response was YES. [2024-10-11 17:02:57,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2458 conditions, 1680 events. 424/1680 cut-off events. For 28/38 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10920 event pairs, 423 based on Foata normal form. 60/1598 useless extension candidates. Maximal degree in co-relation 2166. Up to 755 conditions per place. [2024-10-11 17:02:57,950 INFO L140 encePairwiseOnDemand]: 281/305 looper letters, 44 selfloop transitions, 5 changer transitions 12/265 dead transitions. [2024-10-11 17:02:57,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 265 transitions, 640 flow [2024-10-11 17:02:57,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:02:57,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:02:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1454 transitions. [2024-10-11 17:02:57,972 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7945355191256831 [2024-10-11 17:02:57,975 INFO L175 Difference]: Start difference. First operand has 295 places, 302 transitions, 616 flow. Second operand 6 states and 1454 transitions. [2024-10-11 17:02:57,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 265 transitions, 640 flow [2024-10-11 17:02:57,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 265 transitions, 632 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:02:57,986 INFO L231 Difference]: Finished difference. Result has 271 places, 253 transitions, 520 flow [2024-10-11 17:02:57,988 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=520, PETRI_PLACES=271, PETRI_TRANSITIONS=253} [2024-10-11 17:02:57,994 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -24 predicate places. [2024-10-11 17:02:57,995 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 253 transitions, 520 flow [2024-10-11 17:02:57,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 0 states have call successors, (0), 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:02:57,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:57,998 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] [2024-10-11 17:02:57,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:02:57,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:02:57,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:58,000 INFO L85 PathProgramCache]: Analyzing trace with hash -444160478, now seen corresponding path program 1 times [2024-10-11 17:02:58,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:58,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324410373] [2024-10-11 17:02:58,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:58,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:58,402 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:02:58,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:58,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324410373] [2024-10-11 17:02:58,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324410373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:58,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:58,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:02:58,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776031075] [2024-10-11 17:02:58,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:58,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:02:58,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:58,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:02:58,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:02:58,711 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 305 [2024-10-11 17:02:58,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 253 transitions, 520 flow. Second operand has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 0 states have call successors, (0), 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:02:58,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:58,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 305 [2024-10-11 17:02:58,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:02:59,036 INFO L124 PetriNetUnfolderBase]: 424/1667 cut-off events. [2024-10-11 17:02:59,037 INFO L125 PetriNetUnfolderBase]: For 5/15 co-relation queries the response was YES. [2024-10-11 17:02:59,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 1667 events. 424/1667 cut-off events. For 5/15 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10818 event pairs, 423 based on Foata normal form. 0/1530 useless extension candidates. Maximal degree in co-relation 2396. Up to 755 conditions per place. [2024-10-11 17:02:59,050 INFO L140 encePairwiseOnDemand]: 299/305 looper letters, 44 selfloop transitions, 5 changer transitions 0/252 dead transitions. [2024-10-11 17:02:59,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 252 transitions, 616 flow [2024-10-11 17:02:59,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:02:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:02:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1436 transitions. [2024-10-11 17:02:59,054 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7846994535519126 [2024-10-11 17:02:59,054 INFO L175 Difference]: Start difference. First operand has 271 places, 253 transitions, 520 flow. Second operand 6 states and 1436 transitions. [2024-10-11 17:02:59,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 252 transitions, 616 flow [2024-10-11 17:02:59,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 252 transitions, 606 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:02:59,061 INFO L231 Difference]: Finished difference. Result has 258 places, 252 transitions, 518 flow [2024-10-11 17:02:59,064 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=518, PETRI_PLACES=258, PETRI_TRANSITIONS=252} [2024-10-11 17:02:59,064 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -37 predicate places. [2024-10-11 17:02:59,065 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 252 transitions, 518 flow [2024-10-11 17:02:59,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 0 states have call successors, (0), 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:02:59,066 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:02:59,066 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] [2024-10-11 17:02:59,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:02:59,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:02:59,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:02:59,071 INFO L85 PathProgramCache]: Analyzing trace with hash 527152214, now seen corresponding path program 1 times [2024-10-11 17:02:59,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:02:59,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50177143] [2024-10-11 17:02:59,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:02:59,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:02:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:02:59,500 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:02:59,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:02:59,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50177143] [2024-10-11 17:02:59,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50177143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:02:59,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:02:59,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:02:59,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975514220] [2024-10-11 17:02:59,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:02:59,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:02:59,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:02:59,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:02:59,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:02:59,931 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 305 [2024-10-11 17:02:59,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 252 transitions, 518 flow. Second operand has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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:02:59,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:02:59,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 305 [2024-10-11 17:02:59,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:00,117 INFO L124 PetriNetUnfolderBase]: 232/817 cut-off events. [2024-10-11 17:03:00,118 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2024-10-11 17:03:00,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 817 events. 232/817 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3940 event pairs, 210 based on Foata normal form. 0/789 useless extension candidates. Maximal degree in co-relation 1195. Up to 415 conditions per place. [2024-10-11 17:03:00,126 INFO L140 encePairwiseOnDemand]: 297/305 looper letters, 28 selfloop transitions, 7 changer transitions 0/255 dead transitions. [2024-10-11 17:03:00,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 255 transitions, 595 flow [2024-10-11 17:03:00,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:03:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:03:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1530 transitions. [2024-10-11 17:03:00,130 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8360655737704918 [2024-10-11 17:03:00,131 INFO L175 Difference]: Start difference. First operand has 258 places, 252 transitions, 518 flow. Second operand 6 states and 1530 transitions. [2024-10-11 17:03:00,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 255 transitions, 595 flow [2024-10-11 17:03:00,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 255 transitions, 585 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:03:00,138 INFO L231 Difference]: Finished difference. Result has 258 places, 254 transitions, 536 flow [2024-10-11 17:03:00,139 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=536, PETRI_PLACES=258, PETRI_TRANSITIONS=254} [2024-10-11 17:03:00,141 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -37 predicate places. [2024-10-11 17:03:00,141 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 254 transitions, 536 flow [2024-10-11 17:03:00,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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:03:00,143 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:00,143 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:03:00,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:03:00,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:03:00,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:00,144 INFO L85 PathProgramCache]: Analyzing trace with hash -318548957, now seen corresponding path program 1 times [2024-10-11 17:03:00,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:00,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202940334] [2024-10-11 17:03:00,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:00,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:00,635 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:03:00,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:00,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202940334] [2024-10-11 17:03:00,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202940334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:00,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:00,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:03:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926592606] [2024-10-11 17:03:00,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:00,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:03:00,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:00,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:03:00,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:03:01,036 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 305 [2024-10-11 17:03:01,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 254 transitions, 536 flow. Second operand has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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:03:01,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:01,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 305 [2024-10-11 17:03:01,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:01,214 INFO L124 PetriNetUnfolderBase]: 232/816 cut-off events. [2024-10-11 17:03:01,214 INFO L125 PetriNetUnfolderBase]: For 80/84 co-relation queries the response was YES. [2024-10-11 17:03:01,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 816 events. 232/816 cut-off events. For 80/84 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3912 event pairs, 210 based on Foata normal form. 2/791 useless extension candidates. Maximal degree in co-relation 1001. Up to 415 conditions per place. [2024-10-11 17:03:01,220 INFO L140 encePairwiseOnDemand]: 297/305 looper letters, 28 selfloop transitions, 7 changer transitions 0/254 dead transitions. [2024-10-11 17:03:01,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 254 transitions, 607 flow [2024-10-11 17:03:01,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:03:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:03:01,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1530 transitions. [2024-10-11 17:03:01,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8360655737704918 [2024-10-11 17:03:01,223 INFO L175 Difference]: Start difference. First operand has 258 places, 254 transitions, 536 flow. Second operand 6 states and 1530 transitions. [2024-10-11 17:03:01,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 254 transitions, 607 flow [2024-10-11 17:03:01,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 254 transitions, 597 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:03:01,228 INFO L231 Difference]: Finished difference. Result has 258 places, 253 transitions, 538 flow [2024-10-11 17:03:01,228 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=538, PETRI_PLACES=258, PETRI_TRANSITIONS=253} [2024-10-11 17:03:01,229 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -37 predicate places. [2024-10-11 17:03:01,229 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 253 transitions, 538 flow [2024-10-11 17:03:01,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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:03:01,230 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:01,231 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, 1, 1] [2024-10-11 17:03:01,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:03:01,231 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:03:01,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:01,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1158413599, now seen corresponding path program 1 times [2024-10-11 17:03:01,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:01,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705176603] [2024-10-11 17:03:01,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:01,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:01,307 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:03:01,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:01,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705176603] [2024-10-11 17:03:01,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705176603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:01,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:01,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:01,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898067433] [2024-10-11 17:03:01,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:01,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:01,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:01,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:01,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:01,328 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 305 [2024-10-11 17:03:01,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 253 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 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:03:01,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:01,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 305 [2024-10-11 17:03:01,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:01,411 INFO L124 PetriNetUnfolderBase]: 65/533 cut-off events. [2024-10-11 17:03:01,411 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-10-11 17:03:01,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 533 events. 65/533 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2168 event pairs, 40 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 291. Up to 130 conditions per place. [2024-10-11 17:03:01,416 INFO L140 encePairwiseOnDemand]: 302/305 looper letters, 19 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2024-10-11 17:03:01,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 252 transitions, 578 flow [2024-10-11 17:03:01,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 805 transitions. [2024-10-11 17:03:01,418 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8797814207650273 [2024-10-11 17:03:01,419 INFO L175 Difference]: Start difference. First operand has 258 places, 253 transitions, 538 flow. Second operand 3 states and 805 transitions. [2024-10-11 17:03:01,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 252 transitions, 578 flow [2024-10-11 17:03:01,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 252 transitions, 564 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:03:01,423 INFO L231 Difference]: Finished difference. Result has 254 places, 252 transitions, 526 flow [2024-10-11 17:03:01,423 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=254, PETRI_TRANSITIONS=252} [2024-10-11 17:03:01,424 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -41 predicate places. [2024-10-11 17:03:01,424 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 252 transitions, 526 flow [2024-10-11 17:03:01,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 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:03:01,425 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:01,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:03:01,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:03:01,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:03:01,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:01,426 INFO L85 PathProgramCache]: Analyzing trace with hash 382536521, now seen corresponding path program 1 times [2024-10-11 17:03:01,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:01,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993793387] [2024-10-11 17:03:01,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:01,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:01,515 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:03:01,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:01,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993793387] [2024-10-11 17:03:01,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993793387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:01,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:01,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:01,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402456516] [2024-10-11 17:03:01,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:01,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:01,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:01,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:01,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:01,531 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 305 [2024-10-11 17:03:01,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 252 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 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:03:01,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:01,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 305 [2024-10-11 17:03:01,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:01,610 INFO L124 PetriNetUnfolderBase]: 67/489 cut-off events. [2024-10-11 17:03:01,610 INFO L125 PetriNetUnfolderBase]: For 41/43 co-relation queries the response was YES. [2024-10-11 17:03:01,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 489 events. 67/489 cut-off events. For 41/43 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1791 event pairs, 45 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 512. Up to 128 conditions per place. [2024-10-11 17:03:01,614 INFO L140 encePairwiseOnDemand]: 302/305 looper letters, 21 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2024-10-11 17:03:01,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 254 transitions, 578 flow [2024-10-11 17:03:01,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2024-10-11 17:03:01,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8852459016393442 [2024-10-11 17:03:01,616 INFO L175 Difference]: Start difference. First operand has 254 places, 252 transitions, 526 flow. Second operand 3 states and 810 transitions. [2024-10-11 17:03:01,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 254 transitions, 578 flow [2024-10-11 17:03:01,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 254 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:03:01,621 INFO L231 Difference]: Finished difference. Result has 253 places, 251 transitions, 524 flow [2024-10-11 17:03:01,621 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=253, PETRI_TRANSITIONS=251} [2024-10-11 17:03:01,622 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -42 predicate places. [2024-10-11 17:03:01,622 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 251 transitions, 524 flow [2024-10-11 17:03:01,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 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:03:01,623 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:01,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:03:01,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:03:01,624 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:03:01,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash -21903332, now seen corresponding path program 1 times [2024-10-11 17:03:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:01,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305133196] [2024-10-11 17:03:01,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:01,706 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:03:01,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:01,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305133196] [2024-10-11 17:03:01,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305133196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:01,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:01,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:01,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901912237] [2024-10-11 17:03:01,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:01,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:01,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:01,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:01,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:01,717 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 305 [2024-10-11 17:03:01,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 251 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 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:03:01,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:01,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 305 [2024-10-11 17:03:01,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:01,814 INFO L124 PetriNetUnfolderBase]: 75/570 cut-off events. [2024-10-11 17:03:01,815 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-10-11 17:03:01,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 570 events. 75/570 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1948 event pairs, 18 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 592. Up to 90 conditions per place. [2024-10-11 17:03:01,819 INFO L140 encePairwiseOnDemand]: 303/305 looper letters, 20 selfloop transitions, 1 changer transitions 0/256 dead transitions. [2024-10-11 17:03:01,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 256 transitions, 580 flow [2024-10-11 17:03:01,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 821 transitions. [2024-10-11 17:03:01,821 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8972677595628415 [2024-10-11 17:03:01,821 INFO L175 Difference]: Start difference. First operand has 253 places, 251 transitions, 524 flow. Second operand 3 states and 821 transitions. [2024-10-11 17:03:01,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 256 transitions, 580 flow [2024-10-11 17:03:01,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 256 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:03:01,826 INFO L231 Difference]: Finished difference. Result has 252 places, 250 transitions, 520 flow [2024-10-11 17:03:01,826 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=252, PETRI_TRANSITIONS=250} [2024-10-11 17:03:01,827 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -43 predicate places. [2024-10-11 17:03:01,828 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 250 transitions, 520 flow [2024-10-11 17:03:01,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 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:03:01,829 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:01,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:03:01,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:03:01,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:03:01,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:01,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1892654432, now seen corresponding path program 1 times [2024-10-11 17:03:01,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:01,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169164951] [2024-10-11 17:03:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:01,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:01,911 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:03:01,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:01,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169164951] [2024-10-11 17:03:01,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169164951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:01,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:01,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:01,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267830517] [2024-10-11 17:03:01,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:01,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:01,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:01,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:01,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:01,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 305 [2024-10-11 17:03:01,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 250 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 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:03:01,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:01,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 305 [2024-10-11 17:03:01,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:02,021 INFO L124 PetriNetUnfolderBase]: 64/680 cut-off events. [2024-10-11 17:03:02,022 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-10-11 17:03:02,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 680 events. 64/680 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2659 event pairs, 44 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 715. Up to 130 conditions per place. [2024-10-11 17:03:02,028 INFO L140 encePairwiseOnDemand]: 301/305 looper letters, 18 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2024-10-11 17:03:02,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 251 transitions, 563 flow [2024-10-11 17:03:02,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2024-10-11 17:03:02,030 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8874316939890711 [2024-10-11 17:03:02,030 INFO L175 Difference]: Start difference. First operand has 252 places, 250 transitions, 520 flow. Second operand 3 states and 812 transitions. [2024-10-11 17:03:02,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 251 transitions, 563 flow [2024-10-11 17:03:02,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 251 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:03:02,035 INFO L231 Difference]: Finished difference. Result has 252 places, 250 transitions, 529 flow [2024-10-11 17:03:02,036 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=529, PETRI_PLACES=252, PETRI_TRANSITIONS=250} [2024-10-11 17:03:02,036 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -43 predicate places. [2024-10-11 17:03:02,037 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 250 transitions, 529 flow [2024-10-11 17:03:02,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 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:03:02,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:02,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:03:02,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:03:02,038 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:03:02,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:02,039 INFO L85 PathProgramCache]: Analyzing trace with hash -448068810, now seen corresponding path program 1 times [2024-10-11 17:03:02,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:02,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459854661] [2024-10-11 17:03:02,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:02,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:02,465 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:03:02,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:02,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459854661] [2024-10-11 17:03:02,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459854661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:02,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:02,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:03:02,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520604472] [2024-10-11 17:03:02,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:02,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:03:02,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:02,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:03:02,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:03:02,842 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 305 [2024-10-11 17:03:02,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 250 transitions, 529 flow. Second operand has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 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:03:02,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:02,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 305 [2024-10-11 17:03:02,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:03,254 INFO L124 PetriNetUnfolderBase]: 578/1738 cut-off events. [2024-10-11 17:03:03,255 INFO L125 PetriNetUnfolderBase]: For 171/173 co-relation queries the response was YES. [2024-10-11 17:03:03,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 1738 events. 578/1738 cut-off events. For 171/173 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 10012 event pairs, 347 based on Foata normal form. 0/1659 useless extension candidates. Maximal degree in co-relation 2488. Up to 943 conditions per place. [2024-10-11 17:03:03,266 INFO L140 encePairwiseOnDemand]: 292/305 looper letters, 50 selfloop transitions, 30 changer transitions 0/279 dead transitions. [2024-10-11 17:03:03,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 279 transitions, 763 flow [2024-10-11 17:03:03,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:03:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:03:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1471 transitions. [2024-10-11 17:03:03,270 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8038251366120218 [2024-10-11 17:03:03,270 INFO L175 Difference]: Start difference. First operand has 252 places, 250 transitions, 529 flow. Second operand 6 states and 1471 transitions. [2024-10-11 17:03:03,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 279 transitions, 763 flow [2024-10-11 17:03:03,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 279 transitions, 763 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:03:03,275 INFO L231 Difference]: Finished difference. Result has 262 places, 279 transitions, 747 flow [2024-10-11 17:03:03,276 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=747, PETRI_PLACES=262, PETRI_TRANSITIONS=279} [2024-10-11 17:03:03,277 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -33 predicate places. [2024-10-11 17:03:03,277 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 279 transitions, 747 flow [2024-10-11 17:03:03,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 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:03:03,278 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:03,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:03:03,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:03:03,279 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:03:03,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:03,279 INFO L85 PathProgramCache]: Analyzing trace with hash 44020556, now seen corresponding path program 1 times [2024-10-11 17:03:03,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:03,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056041558] [2024-10-11 17:03:03,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:03,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:03:03,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:03,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056041558] [2024-10-11 17:03:03,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056041558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:03,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:03,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:03,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768588015] [2024-10-11 17:03:03,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:03,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:03,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:03,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:03,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:03,358 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 305 [2024-10-11 17:03:03,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 279 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 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:03:03,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:03,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 305 [2024-10-11 17:03:03,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:03,561 INFO L124 PetriNetUnfolderBase]: 332/1161 cut-off events. [2024-10-11 17:03:03,561 INFO L125 PetriNetUnfolderBase]: For 614/635 co-relation queries the response was YES. [2024-10-11 17:03:03,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2594 conditions, 1161 events. 332/1161 cut-off events. For 614/635 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6043 event pairs, 99 based on Foata normal form. 2/1127 useless extension candidates. Maximal degree in co-relation 2135. Up to 403 conditions per place. [2024-10-11 17:03:03,569 INFO L140 encePairwiseOnDemand]: 302/305 looper letters, 50 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2024-10-11 17:03:03,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 286 transitions, 885 flow [2024-10-11 17:03:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2024-10-11 17:03:03,572 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8885245901639345 [2024-10-11 17:03:03,572 INFO L175 Difference]: Start difference. First operand has 262 places, 279 transitions, 747 flow. Second operand 3 states and 813 transitions. [2024-10-11 17:03:03,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 286 transitions, 885 flow [2024-10-11 17:03:03,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 286 transitions, 869 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-10-11 17:03:03,583 INFO L231 Difference]: Finished difference. Result has 263 places, 278 transitions, 733 flow [2024-10-11 17:03:03,585 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=733, PETRI_PLACES=263, PETRI_TRANSITIONS=278} [2024-10-11 17:03:03,585 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -32 predicate places. [2024-10-11 17:03:03,587 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 278 transitions, 733 flow [2024-10-11 17:03:03,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 0 states have call successors, (0), 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:03:03,588 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:03,588 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, 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:03:03,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:03:03,588 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:03:03,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:03,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1650094721, now seen corresponding path program 1 times [2024-10-11 17:03:03,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:03,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882638419] [2024-10-11 17:03:03,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:03,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:04,091 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:03:04,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:04,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882638419] [2024-10-11 17:03:04,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882638419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:04,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:04,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:03:04,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964307699] [2024-10-11 17:03:04,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:04,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:03:04,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:04,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:03:04,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:03:04,448 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 305 [2024-10-11 17:03:04,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 278 transitions, 733 flow. Second operand has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 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:03:04,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:04,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 305 [2024-10-11 17:03:04,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:04,921 INFO L124 PetriNetUnfolderBase]: 828/2346 cut-off events. [2024-10-11 17:03:04,922 INFO L125 PetriNetUnfolderBase]: For 1095/1110 co-relation queries the response was YES. [2024-10-11 17:03:04,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5296 conditions, 2346 events. 828/2346 cut-off events. For 1095/1110 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 14887 event pairs, 419 based on Foata normal form. 0/2263 useless extension candidates. Maximal degree in co-relation 4958. Up to 1225 conditions per place. [2024-10-11 17:03:04,980 INFO L140 encePairwiseOnDemand]: 292/305 looper letters, 74 selfloop transitions, 30 changer transitions 0/307 dead transitions. [2024-10-11 17:03:04,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 307 transitions, 1063 flow [2024-10-11 17:03:04,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:03:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:03:04,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1471 transitions. [2024-10-11 17:03:04,985 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8038251366120218 [2024-10-11 17:03:04,985 INFO L175 Difference]: Start difference. First operand has 263 places, 278 transitions, 733 flow. Second operand 6 states and 1471 transitions. [2024-10-11 17:03:04,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 307 transitions, 1063 flow [2024-10-11 17:03:04,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 307 transitions, 1059 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:03:04,993 INFO L231 Difference]: Finished difference. Result has 271 places, 307 transitions, 995 flow [2024-10-11 17:03:04,994 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=995, PETRI_PLACES=271, PETRI_TRANSITIONS=307} [2024-10-11 17:03:04,995 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -24 predicate places. [2024-10-11 17:03:04,995 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 307 transitions, 995 flow [2024-10-11 17:03:04,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 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:03:04,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:04,997 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, 1, 1, 1, 1, 1, 1, 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:03:04,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:03:04,997 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:03:04,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:04,998 INFO L85 PathProgramCache]: Analyzing trace with hash -2041196530, now seen corresponding path program 1 times [2024-10-11 17:03:04,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:04,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617204515] [2024-10-11 17:03:04,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:04,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:05,475 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:03:05,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:05,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617204515] [2024-10-11 17:03:05,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617204515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:05,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:05,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:03:05,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121535986] [2024-10-11 17:03:05,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:05,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:03:05,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:05,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:03:05,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:03:05,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 305 [2024-10-11 17:03:05,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 307 transitions, 995 flow. Second operand has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 0 states have call successors, (0), 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:03:05,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:05,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 305 [2024-10-11 17:03:05,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:06,560 INFO L124 PetriNetUnfolderBase]: 925/2870 cut-off events. [2024-10-11 17:03:06,560 INFO L125 PetriNetUnfolderBase]: For 2175/2200 co-relation queries the response was YES. [2024-10-11 17:03:06,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7386 conditions, 2870 events. 925/2870 cut-off events. For 2175/2200 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 19946 event pairs, 307 based on Foata normal form. 0/2753 useless extension candidates. Maximal degree in co-relation 6300. Up to 1290 conditions per place. [2024-10-11 17:03:06,655 INFO L140 encePairwiseOnDemand]: 288/305 looper letters, 96 selfloop transitions, 27 changer transitions 0/336 dead transitions. [2024-10-11 17:03:06,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 336 transitions, 1415 flow [2024-10-11 17:03:06,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:03:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:03:06,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1517 transitions. [2024-10-11 17:03:06,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8289617486338798 [2024-10-11 17:03:06,659 INFO L175 Difference]: Start difference. First operand has 271 places, 307 transitions, 995 flow. Second operand 6 states and 1517 transitions. [2024-10-11 17:03:06,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 336 transitions, 1415 flow [2024-10-11 17:03:06,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 336 transitions, 1351 flow, removed 32 selfloop flow, removed 0 redundant places. [2024-10-11 17:03:06,670 INFO L231 Difference]: Finished difference. Result has 280 places, 328 transitions, 1187 flow [2024-10-11 17:03:06,671 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1187, PETRI_PLACES=280, PETRI_TRANSITIONS=328} [2024-10-11 17:03:06,671 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -15 predicate places. [2024-10-11 17:03:06,672 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 328 transitions, 1187 flow [2024-10-11 17:03:06,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 0 states have call successors, (0), 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:03:06,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:06,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:06,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:03:06,674 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:03:06,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:06,674 INFO L85 PathProgramCache]: Analyzing trace with hash 367805409, now seen corresponding path program 1 times [2024-10-11 17:03:06,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:06,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94281050] [2024-10-11 17:03:06,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:06,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:07,141 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:03:07,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:07,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94281050] [2024-10-11 17:03:07,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94281050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:07,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:07,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:03:07,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721583084] [2024-10-11 17:03:07,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:07,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:03:07,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:07,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:03:07,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:03:07,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 305 [2024-10-11 17:03:07,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 328 transitions, 1187 flow. Second operand has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 0 states have call successors, (0), 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:03:07,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:07,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 305 [2024-10-11 17:03:07,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:08,318 INFO L124 PetriNetUnfolderBase]: 1209/3474 cut-off events. [2024-10-11 17:03:08,319 INFO L125 PetriNetUnfolderBase]: For 4869/5090 co-relation queries the response was YES. [2024-10-11 17:03:08,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10182 conditions, 3474 events. 1209/3474 cut-off events. For 4869/5090 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 24991 event pairs, 352 based on Foata normal form. 10/3353 useless extension candidates. Maximal degree in co-relation 8784. Up to 1593 conditions per place. [2024-10-11 17:03:08,347 INFO L140 encePairwiseOnDemand]: 288/305 looper letters, 110 selfloop transitions, 39 changer transitions 37/373 dead transitions. [2024-10-11 17:03:08,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 373 transitions, 1883 flow [2024-10-11 17:03:08,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:03:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:03:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1517 transitions. [2024-10-11 17:03:08,352 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8289617486338798 [2024-10-11 17:03:08,352 INFO L175 Difference]: Start difference. First operand has 280 places, 328 transitions, 1187 flow. Second operand 6 states and 1517 transitions. [2024-10-11 17:03:08,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 373 transitions, 1883 flow [2024-10-11 17:03:08,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 373 transitions, 1851 flow, removed 16 selfloop flow, removed 0 redundant places. [2024-10-11 17:03:08,366 INFO L231 Difference]: Finished difference. Result has 289 places, 328 transitions, 1574 flow [2024-10-11 17:03:08,367 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1574, PETRI_PLACES=289, PETRI_TRANSITIONS=328} [2024-10-11 17:03:08,367 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -6 predicate places. [2024-10-11 17:03:08,367 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 328 transitions, 1574 flow [2024-10-11 17:03:08,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 0 states have call successors, (0), 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:03:08,368 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:08,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:08,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:03:08,369 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:03:08,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:08,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1396074371, now seen corresponding path program 1 times [2024-10-11 17:03:08,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:08,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059420590] [2024-10-11 17:03:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:08,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:08,537 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:03:08,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:08,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059420590] [2024-10-11 17:03:08,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059420590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:08,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:08,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:03:08,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092904812] [2024-10-11 17:03:08,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:08,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:03:08,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:08,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:03:08,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:03:08,565 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 305 [2024-10-11 17:03:08,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 328 transitions, 1574 flow. Second operand has 5 states, 5 states have (on average 261.2) internal successors, (1306), 5 states have internal predecessors, (1306), 0 states have call successors, (0), 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:03:08,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:08,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 305 [2024-10-11 17:03:08,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:08,763 INFO L124 PetriNetUnfolderBase]: 167/626 cut-off events. [2024-10-11 17:03:08,763 INFO L125 PetriNetUnfolderBase]: For 1272/1375 co-relation queries the response was YES. [2024-10-11 17:03:08,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 626 events. 167/626 cut-off events. For 1272/1375 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3102 event pairs, 15 based on Foata normal form. 6/610 useless extension candidates. Maximal degree in co-relation 1625. Up to 179 conditions per place. [2024-10-11 17:03:08,770 INFO L140 encePairwiseOnDemand]: 300/305 looper letters, 43 selfloop transitions, 4 changer transitions 0/178 dead transitions. [2024-10-11 17:03:08,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 178 transitions, 702 flow [2024-10-11 17:03:08,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:03:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:03:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1596 transitions. [2024-10-11 17:03:08,774 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8721311475409836 [2024-10-11 17:03:08,774 INFO L175 Difference]: Start difference. First operand has 289 places, 328 transitions, 1574 flow. Second operand 6 states and 1596 transitions. [2024-10-11 17:03:08,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 178 transitions, 702 flow [2024-10-11 17:03:08,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 178 transitions, 562 flow, removed 70 selfloop flow, removed 3 redundant places. [2024-10-11 17:03:08,778 INFO L231 Difference]: Finished difference. Result has 176 places, 150 transitions, 348 flow [2024-10-11 17:03:08,779 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=176, PETRI_TRANSITIONS=150} [2024-10-11 17:03:08,780 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -119 predicate places. [2024-10-11 17:03:08,780 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 150 transitions, 348 flow [2024-10-11 17:03:08,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 261.2) internal successors, (1306), 5 states have internal predecessors, (1306), 0 states have call successors, (0), 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:03:08,781 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:03:08,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:08,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:03:08,781 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2024-10-11 17:03:08,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:03:08,782 INFO L85 PathProgramCache]: Analyzing trace with hash -691622201, now seen corresponding path program 1 times [2024-10-11 17:03:08,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:03:08,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765383491] [2024-10-11 17:03:08,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:03:08,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:03:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:03:08,891 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:03:08,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:03:08,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765383491] [2024-10-11 17:03:08,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765383491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:03:08,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:03:08,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:03:08,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340024019] [2024-10-11 17:03:08,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:03:08,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:03:08,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:03:08,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:03:08,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:03:08,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 305 [2024-10-11 17:03:08,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 150 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 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:03:08,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:03:08,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 305 [2024-10-11 17:03:08,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:03:08,964 INFO L124 PetriNetUnfolderBase]: 39/300 cut-off events. [2024-10-11 17:03:08,965 INFO L125 PetriNetUnfolderBase]: For 60/81 co-relation queries the response was YES. [2024-10-11 17:03:08,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 300 events. 39/300 cut-off events. For 60/81 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 916 event pairs, 23 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 503. Up to 76 conditions per place. [2024-10-11 17:03:08,967 INFO L140 encePairwiseOnDemand]: 303/305 looper letters, 0 selfloop transitions, 0 changer transitions 152/152 dead transitions. [2024-10-11 17:03:08,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 152 transitions, 394 flow [2024-10-11 17:03:08,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:03:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:03:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions. [2024-10-11 17:03:08,969 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.892896174863388 [2024-10-11 17:03:08,969 INFO L175 Difference]: Start difference. First operand has 176 places, 150 transitions, 348 flow. Second operand 3 states and 817 transitions. [2024-10-11 17:03:08,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 152 transitions, 394 flow [2024-10-11 17:03:08,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 152 transitions, 387 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:03:08,972 INFO L231 Difference]: Finished difference. Result has 173 places, 0 transitions, 0 flow [2024-10-11 17:03:08,972 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=173, PETRI_TRANSITIONS=0} [2024-10-11 17:03:08,973 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -122 predicate places. [2024-10-11 17:03:08,973 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 0 transitions, 0 flow [2024-10-11 17:03:08,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 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:03:08,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (28 of 29 remaining) [2024-10-11 17:03:08,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2024-10-11 17:03:08,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2024-10-11 17:03:08,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2024-10-11 17:03:08,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2024-10-11 17:03:08,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2024-10-11 17:03:08,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2024-10-11 17:03:08,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2024-10-11 17:03:08,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2024-10-11 17:03:08,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2024-10-11 17:03:08,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2024-10-11 17:03:08,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2024-10-11 17:03:08,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2024-10-11 17:03:08,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2024-10-11 17:03:08,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2024-10-11 17:03:08,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 29 remaining) [2024-10-11 17:03:08,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 29 remaining) [2024-10-11 17:03:08,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2024-10-11 17:03:08,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2024-10-11 17:03:08,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2024-10-11 17:03:08,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2024-10-11 17:03:08,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2024-10-11 17:03:08,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2024-10-11 17:03:08,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2024-10-11 17:03:08,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2024-10-11 17:03:08,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2024-10-11 17:03:08,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2024-10-11 17:03:08,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2024-10-11 17:03:08,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2024-10-11 17:03:08,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:03:08,981 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:03:08,989 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:03:08,989 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:03:08,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:03:08 BasicIcfg [2024-10-11 17:03:08,995 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:03:08,996 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:03:08,996 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:03:08,996 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:03:08,996 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:02:55" (3/4) ... [2024-10-11 17:03:08,998 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:03:09,002 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2024-10-11 17:03:09,010 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-11 17:03:09,010 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 17:03:09,011 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:03:09,011 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:03:09,122 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:03:09,122 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:03:09,123 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:03:09,124 INFO L158 Benchmark]: Toolchain (without parser) took 15403.39ms. Allocated memory was 142.6MB in the beginning and 513.8MB in the end (delta: 371.2MB). Free memory was 84.6MB in the beginning and 209.9MB in the end (delta: -125.3MB). Peak memory consumption was 246.7MB. Max. memory is 16.1GB. [2024-10-11 17:03:09,124 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:03:09,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 773.99ms. Allocated memory was 142.6MB in the beginning and 199.2MB in the end (delta: 56.6MB). Free memory was 84.4MB in the beginning and 152.4MB in the end (delta: -68.0MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-10-11 17:03:09,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.57ms. Allocated memory is still 199.2MB. Free memory was 152.4MB in the beginning and 149.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:03:09,124 INFO L158 Benchmark]: Boogie Preprocessor took 77.68ms. Allocated memory is still 199.2MB. Free memory was 149.3MB in the beginning and 145.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:03:09,125 INFO L158 Benchmark]: RCFGBuilder took 875.74ms. Allocated memory is still 199.2MB. Free memory was 145.1MB in the beginning and 104.2MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-11 17:03:09,125 INFO L158 Benchmark]: TraceAbstraction took 13449.32ms. Allocated memory was 199.2MB in the beginning and 513.8MB in the end (delta: 314.6MB). Free memory was 104.2MB in the beginning and 216.2MB in the end (delta: -112.0MB). Peak memory consumption was 201.5MB. Max. memory is 16.1GB. [2024-10-11 17:03:09,125 INFO L158 Benchmark]: Witness Printer took 127.50ms. Allocated memory is still 513.8MB. Free memory was 216.2MB in the beginning and 209.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:03:09,127 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 773.99ms. Allocated memory was 142.6MB in the beginning and 199.2MB in the end (delta: 56.6MB). Free memory was 84.4MB in the beginning and 152.4MB in the end (delta: -68.0MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.57ms. Allocated memory is still 199.2MB. Free memory was 152.4MB in the beginning and 149.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.68ms. Allocated memory is still 199.2MB. Free memory was 149.3MB in the beginning and 145.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 875.74ms. Allocated memory is still 199.2MB. Free memory was 145.1MB in the beginning and 104.2MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13449.32ms. Allocated memory was 199.2MB in the beginning and 513.8MB in the end (delta: 314.6MB). Free memory was 104.2MB in the beginning and 216.2MB in the end (delta: -112.0MB). Peak memory consumption was 201.5MB. Max. memory is 16.1GB. * Witness Printer took 127.50ms. Allocated memory is still 513.8MB. Free memory was 216.2MB in the beginning and 209.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3923]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3924]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3925]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3926]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3931]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3933]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3942]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3964]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3943]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3934]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3965]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3960]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3966]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3961]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3967]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3904]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3908]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3911]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3914]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 312 locations, 29 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1642 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 901 mSDsluCounter, 161 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 676 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3559 IncrementalHoareTripleChecker+Invalid, 4235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 676 mSolverCounterUnsat, 135 mSDtfsCounter, 3559 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1574occurred in iteration=13, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1266 NumberOfCodeBlocks, 1266 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1251 ConstructedInterpolants, 0 QuantifiedInterpolants, 1989 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:03:09,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE