./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:32:44,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:32:44,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:32:44,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:32:44,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:32:44,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:32:44,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:32:44,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:32:44,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:32:44,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:32:44,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:32:44,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:32:44,705 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:32:44,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:32:44,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:32:44,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:32:44,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:32:44,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:32:44,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:32:44,706 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:32:44,706 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:32:44,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:32:44,709 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:32:44,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:32:44,710 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:32:44,710 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:32:44,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:32:44,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:32:44,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:32:44,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:32:44,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:32:44,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:32:44,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:32:44,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:32:44,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:32:44,713 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:32:44,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:32:44,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:32:44,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:32:44,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:32:44,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:32:44,715 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef [2024-11-12 12:32:44,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:32:44,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:32:44,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:32:44,991 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:32:44,991 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:32:44,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2024-11-12 12:32:46,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:32:46,772 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:32:46,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2024-11-12 12:32:46,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb0ca10f1/5e352232305943e9a2b5473f57ce486a/FLAG5d8ad9c7a [2024-11-12 12:32:46,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb0ca10f1/5e352232305943e9a2b5473f57ce486a [2024-11-12 12:32:46,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:32:46,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:32:46,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:32:46,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:32:46,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:32:46,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:32:46" (1/1) ... [2024-11-12 12:32:46,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f90496c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:46, skipping insertion in model container [2024-11-12 12:32:46,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:32:46" (1/1) ... [2024-11-12 12:32:46,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:32:47,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:32:47,313 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:32:47,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:32:47,433 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:32:47,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:47 WrapperNode [2024-11-12 12:32:47,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:32:47,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:32:47,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:32:47,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:32:47,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:47" (1/1) ... [2024-11-12 12:32:47,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:47" (1/1) ... [2024-11-12 12:32:47,507 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 157 [2024-11-12 12:32:47,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:32:47,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:32:47,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:32:47,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:32:47,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:47" (1/1) ... [2024-11-12 12:32:47,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:47" (1/1) ... [2024-11-12 12:32:47,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:47" (1/1) ... [2024-11-12 12:32:47,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:47" (1/1) ... [2024-11-12 12:32:47,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:47" (1/1) ... [2024-11-12 12:32:47,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:47" (1/1) ... [2024-11-12 12:32:47,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:47" (1/1) ... [2024-11-12 12:32:47,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:47" (1/1) ... [2024-11-12 12:32:47,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:32:47,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:32:47,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:32:47,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:32:47,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:47" (1/1) ... [2024-11-12 12:32:47,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:32:47,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:32:47,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:32:47,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 12:32:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 12:32:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 12:32:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-12 12:32:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:32:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:32:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-12 12:32:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:32:47,661 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-12 12:32:47,661 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-12 12:32:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:32:47,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:32:47,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:32:47,664 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:32:47,818 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:32:47,822 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:32:48,091 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:32:48,091 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:32:48,130 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:32:48,130 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-12 12:32:48,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:32:48 BoogieIcfgContainer [2024-11-12 12:32:48,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:32:48,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:32:48,134 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:32:48,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:32:48,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:32:46" (1/3) ... [2024-11-12 12:32:48,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebad4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:32:48, skipping insertion in model container [2024-11-12 12:32:48,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:32:47" (2/3) ... [2024-11-12 12:32:48,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebad4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:32:48, skipping insertion in model container [2024-11-12 12:32:48,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:32:48" (3/3) ... [2024-11-12 12:32:48,138 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_07-cond_racing2.i [2024-11-12 12:32:48,153 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:32:48,153 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-12 12:32:48,154 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:32:48,223 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-12 12:32:48,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 211 transitions, 429 flow [2024-11-12 12:32:48,413 INFO L124 PetriNetUnfolderBase]: 25/280 cut-off events. [2024-11-12 12:32:48,413 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:32:48,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 280 events. 25/280 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 677 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 155. Up to 6 conditions per place. [2024-11-12 12:32:48,424 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 211 transitions, 429 flow [2024-11-12 12:32:48,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 211 transitions, 429 flow [2024-11-12 12:32:48,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:32:48,449 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;@5e82f874, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:32:48,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-12 12:32:48,482 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:32:48,482 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2024-11-12 12:32:48,482 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:32:48,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:48,484 INFO L206 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] [2024-11-12 12:32:48,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-12 12:32:48,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:48,494 INFO L85 PathProgramCache]: Analyzing trace with hash -605595689, now seen corresponding path program 1 times [2024-11-12 12:32:48,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:48,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208710443] [2024-11-12 12:32:48,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:48,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:32:49,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:49,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208710443] [2024-11-12 12:32:49,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208710443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:49,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:49,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:32:49,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367277487] [2024-11-12 12:32:49,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:49,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:32:49,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:49,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:32:49,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:32:49,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 211 [2024-11-12 12:32:49,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 211 transitions, 429 flow. Second operand has 6 states, 6 states have (on average 169.5) internal successors, (1017), 6 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:49,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:49,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 211 [2024-11-12 12:32:49,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:32:50,176 INFO L124 PetriNetUnfolderBase]: 135/895 cut-off events. [2024-11-12 12:32:50,176 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-12 12:32:50,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 895 events. 135/895 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5199 event pairs, 60 based on Foata normal form. 106/896 useless extension candidates. Maximal degree in co-relation 989. Up to 198 conditions per place. [2024-11-12 12:32:50,186 INFO L140 encePairwiseOnDemand]: 193/211 looper letters, 48 selfloop transitions, 5 changer transitions 0/220 dead transitions. [2024-11-12 12:32:50,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 220 transitions, 553 flow [2024-11-12 12:32:50,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:32:50,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:32:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1098 transitions. [2024-11-12 12:32:50,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8672985781990521 [2024-11-12 12:32:50,211 INFO L175 Difference]: Start difference. First operand has 198 places, 211 transitions, 429 flow. Second operand 6 states and 1098 transitions. [2024-11-12 12:32:50,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 220 transitions, 553 flow [2024-11-12 12:32:50,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 220 transitions, 553 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:32:50,223 INFO L231 Difference]: Finished difference. Result has 200 places, 196 transitions, 409 flow [2024-11-12 12:32:50,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=409, PETRI_PLACES=200, PETRI_TRANSITIONS=196} [2024-11-12 12:32:50,230 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 2 predicate places. [2024-11-12 12:32:50,230 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 196 transitions, 409 flow [2024-11-12 12:32:50,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.5) internal successors, (1017), 6 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:50,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:50,232 INFO L206 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] [2024-11-12 12:32:50,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:32:50,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-12 12:32:50,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:50,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1901146632, now seen corresponding path program 1 times [2024-11-12 12:32:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:50,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670985905] [2024-11-12 12:32:50,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:50,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:32:50,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:50,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670985905] [2024-11-12 12:32:50,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670985905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:50,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:50,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:32:50,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540339964] [2024-11-12 12:32:50,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:50,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:32:50,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:50,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:32:50,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:32:50,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 211 [2024-11-12 12:32:50,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 196 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:50,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:50,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 211 [2024-11-12 12:32:50,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:32:50,483 INFO L124 PetriNetUnfolderBase]: 57/640 cut-off events. [2024-11-12 12:32:50,483 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-12 12:32:50,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 640 events. 57/640 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2923 event pairs, 25 based on Foata normal form. 1/572 useless extension candidates. Maximal degree in co-relation 634. Up to 96 conditions per place. [2024-11-12 12:32:50,487 INFO L140 encePairwiseOnDemand]: 208/211 looper letters, 22 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2024-11-12 12:32:50,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 202 transitions, 469 flow [2024-11-12 12:32:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:32:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:32:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2024-11-12 12:32:50,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8925750394944708 [2024-11-12 12:32:50,490 INFO L175 Difference]: Start difference. First operand has 200 places, 196 transitions, 409 flow. Second operand 3 states and 565 transitions. [2024-11-12 12:32:50,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 202 transitions, 469 flow [2024-11-12 12:32:50,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 202 transitions, 459 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:32:50,498 INFO L231 Difference]: Finished difference. Result has 198 places, 196 transitions, 407 flow [2024-11-12 12:32:50,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=198, PETRI_TRANSITIONS=196} [2024-11-12 12:32:50,501 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 0 predicate places. [2024-11-12 12:32:50,502 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 196 transitions, 407 flow [2024-11-12 12:32:50,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:50,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:50,504 INFO L206 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] [2024-11-12 12:32:50,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:32:50,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-12 12:32:50,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash -506205996, now seen corresponding path program 1 times [2024-11-12 12:32:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:50,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82844106] [2024-11-12 12:32:50,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:50,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:32:50,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:50,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82844106] [2024-11-12 12:32:50,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82844106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:50,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:50,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:32:50,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339697685] [2024-11-12 12:32:50,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:50,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:32:50,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:50,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:32:50,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:32:50,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 211 [2024-11-12 12:32:50,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 196 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:50,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:50,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 211 [2024-11-12 12:32:50,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:32:50,794 INFO L124 PetriNetUnfolderBase]: 134/935 cut-off events. [2024-11-12 12:32:50,795 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-12 12:32:50,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 935 events. 134/935 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5369 event pairs, 33 based on Foata normal form. 0/838 useless extension candidates. Maximal degree in co-relation 1088. Up to 130 conditions per place. [2024-11-12 12:32:50,799 INFO L140 encePairwiseOnDemand]: 202/211 looper letters, 30 selfloop transitions, 6 changer transitions 0/209 dead transitions. [2024-11-12 12:32:50,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 209 transitions, 508 flow [2024-11-12 12:32:50,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:32:50,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:32:50,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2024-11-12 12:32:50,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8909952606635071 [2024-11-12 12:32:50,802 INFO L175 Difference]: Start difference. First operand has 198 places, 196 transitions, 407 flow. Second operand 3 states and 564 transitions. [2024-11-12 12:32:50,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 209 transitions, 508 flow [2024-11-12 12:32:50,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 209 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:32:50,806 INFO L231 Difference]: Finished difference. Result has 198 places, 198 transitions, 441 flow [2024-11-12 12:32:50,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=198, PETRI_TRANSITIONS=198} [2024-11-12 12:32:50,808 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 0 predicate places. [2024-11-12 12:32:50,808 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 198 transitions, 441 flow [2024-11-12 12:32:50,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:50,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:50,809 INFO L206 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] [2024-11-12 12:32:50,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:32:50,809 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-12 12:32:50,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1186278216, now seen corresponding path program 1 times [2024-11-12 12:32:50,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:50,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294615787] [2024-11-12 12:32:50,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:50,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:32:50,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:50,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294615787] [2024-11-12 12:32:50,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294615787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:50,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:50,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:32:50,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943541415] [2024-11-12 12:32:50,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:50,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:32:50,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:50,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:32:50,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:32:50,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 211 [2024-11-12 12:32:50,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 198 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:50,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:50,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 211 [2024-11-12 12:32:50,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:32:51,047 INFO L124 PetriNetUnfolderBase]: 139/1017 cut-off events. [2024-11-12 12:32:51,048 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-11-12 12:32:51,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 1017 events. 139/1017 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6283 event pairs, 51 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 1267. Up to 220 conditions per place. [2024-11-12 12:32:51,055 INFO L140 encePairwiseOnDemand]: 206/211 looper letters, 27 selfloop transitions, 4 changer transitions 0/205 dead transitions. [2024-11-12 12:32:51,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 205 transitions, 521 flow [2024-11-12 12:32:51,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:32:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:32:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2024-11-12 12:32:51,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8846761453396524 [2024-11-12 12:32:51,057 INFO L175 Difference]: Start difference. First operand has 198 places, 198 transitions, 441 flow. Second operand 3 states and 560 transitions. [2024-11-12 12:32:51,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 205 transitions, 521 flow [2024-11-12 12:32:51,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 205 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:32:51,063 INFO L231 Difference]: Finished difference. Result has 200 places, 201 transitions, 461 flow [2024-11-12 12:32:51,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=200, PETRI_TRANSITIONS=201} [2024-11-12 12:32:51,065 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, 2 predicate places. [2024-11-12 12:32:51,065 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 201 transitions, 461 flow [2024-11-12 12:32:51,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:51,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:51,066 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:32:51,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:32:51,068 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-12 12:32:51,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:51,070 INFO L85 PathProgramCache]: Analyzing trace with hash 83373136, now seen corresponding path program 1 times [2024-11-12 12:32:51,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:51,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238452168] [2024-11-12 12:32:51,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:51,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:32:51,117 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:32:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:32:51,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 12:32:51,186 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:32:51,187 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-12 12:32:51,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-12 12:32:51,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-12 12:32:51,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-12 12:32:51,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-12 12:32:51,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-12 12:32:51,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-12 12:32:51,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-12 12:32:51,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-12 12:32:51,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-12 12:32:51,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-12 12:32:51,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-12 12:32:51,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:32:51,192 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 12:32:51,194 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-12 12:32:51,195 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-12 12:32:51,231 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-12 12:32:51,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 260 transitions, 536 flow [2024-11-12 12:32:51,286 INFO L124 PetriNetUnfolderBase]: 43/426 cut-off events. [2024-11-12 12:32:51,287 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-12 12:32:51,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 426 events. 43/426 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1294 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 282. Up to 9 conditions per place. [2024-11-12 12:32:51,291 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 260 transitions, 536 flow [2024-11-12 12:32:51,306 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 242 places, 260 transitions, 536 flow [2024-11-12 12:32:51,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:32:51,308 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;@5e82f874, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:32:51,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-12 12:32:51,320 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:32:51,320 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2024-11-12 12:32:51,320 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:32:51,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:51,321 INFO L206 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] [2024-11-12 12:32:51,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:32:51,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:51,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2037411799, now seen corresponding path program 1 times [2024-11-12 12:32:51,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:51,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850626534] [2024-11-12 12:32:51,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:51,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:32:51,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:51,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850626534] [2024-11-12 12:32:51,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850626534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:51,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:51,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:32:51,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299325612] [2024-11-12 12:32:51,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:51,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:32:51,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:51,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:32:51,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:32:51,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 260 [2024-11-12 12:32:51,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 260 transitions, 536 flow. Second operand has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:51,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:51,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 260 [2024-11-12 12:32:51,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:32:52,947 INFO L124 PetriNetUnfolderBase]: 1710/6555 cut-off events. [2024-11-12 12:32:52,947 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-12 12:32:52,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9270 conditions, 6555 events. 1710/6555 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 64562 event pairs, 168 based on Foata normal form. 1344/7252 useless extension candidates. Maximal degree in co-relation 4690. Up to 1840 conditions per place. [2024-11-12 12:32:52,992 INFO L140 encePairwiseOnDemand]: 236/260 looper letters, 80 selfloop transitions, 5 changer transitions 0/287 dead transitions. [2024-11-12 12:32:52,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 287 transitions, 760 flow [2024-11-12 12:32:52,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:32:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:32:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1370 transitions. [2024-11-12 12:32:52,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8782051282051282 [2024-11-12 12:32:52,996 INFO L175 Difference]: Start difference. First operand has 242 places, 260 transitions, 536 flow. Second operand 6 states and 1370 transitions. [2024-11-12 12:32:52,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 287 transitions, 760 flow [2024-11-12 12:32:52,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 287 transitions, 760 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:32:53,002 INFO L231 Difference]: Finished difference. Result has 244 places, 239 transitions, 504 flow [2024-11-12 12:32:53,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=244, PETRI_TRANSITIONS=239} [2024-11-12 12:32:53,005 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 2 predicate places. [2024-11-12 12:32:53,006 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 239 transitions, 504 flow [2024-11-12 12:32:53,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:53,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:53,007 INFO L206 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] [2024-11-12 12:32:53,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:32:53,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:32:53,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:53,008 INFO L85 PathProgramCache]: Analyzing trace with hash -296614280, now seen corresponding path program 1 times [2024-11-12 12:32:53,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:53,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700307832] [2024-11-12 12:32:53,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:53,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:32:53,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:53,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700307832] [2024-11-12 12:32:53,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700307832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:53,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:53,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:32:53,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140899796] [2024-11-12 12:32:53,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:53,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:32:53,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:53,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:32:53,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:32:53,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 260 [2024-11-12 12:32:53,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 239 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:53,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:53,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 260 [2024-11-12 12:32:53,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:32:53,773 INFO L124 PetriNetUnfolderBase]: 938/4718 cut-off events. [2024-11-12 12:32:53,773 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2024-11-12 12:32:53,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6302 conditions, 4718 events. 938/4718 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 44976 event pairs, 334 based on Foata normal form. 1/4238 useless extension candidates. Maximal degree in co-relation 810. Up to 1404 conditions per place. [2024-11-12 12:32:53,812 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 31 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2024-11-12 12:32:53,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 246 transitions, 586 flow [2024-11-12 12:32:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:32:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:32:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2024-11-12 12:32:53,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8705128205128205 [2024-11-12 12:32:53,814 INFO L175 Difference]: Start difference. First operand has 244 places, 239 transitions, 504 flow. Second operand 3 states and 679 transitions. [2024-11-12 12:32:53,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 246 transitions, 586 flow [2024-11-12 12:32:53,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 246 transitions, 574 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:32:53,819 INFO L231 Difference]: Finished difference. Result has 242 places, 240 transitions, 506 flow [2024-11-12 12:32:53,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=242, PETRI_TRANSITIONS=240} [2024-11-12 12:32:53,820 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 0 predicate places. [2024-11-12 12:32:53,821 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 240 transitions, 506 flow [2024-11-12 12:32:53,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:53,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:53,821 INFO L206 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] [2024-11-12 12:32:53,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:32:53,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:32:53,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:53,822 INFO L85 PathProgramCache]: Analyzing trace with hash 605204743, now seen corresponding path program 1 times [2024-11-12 12:32:53,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:53,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492755246] [2024-11-12 12:32:53,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:53,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:32:53,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:53,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492755246] [2024-11-12 12:32:53,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492755246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:53,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:53,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:32:53,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369265138] [2024-11-12 12:32:53,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:53,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:32:53,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:53,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:32:53,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:32:53,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 260 [2024-11-12 12:32:53,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 240 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:53,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:53,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 260 [2024-11-12 12:32:53,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:32:56,253 INFO L124 PetriNetUnfolderBase]: 4720/15525 cut-off events. [2024-11-12 12:32:56,253 INFO L125 PetriNetUnfolderBase]: For 453/453 co-relation queries the response was YES. [2024-11-12 12:32:56,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22832 conditions, 15525 events. 4720/15525 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 173621 event pairs, 1586 based on Foata normal form. 0/13732 useless extension candidates. Maximal degree in co-relation 22721. Up to 3665 conditions per place. [2024-11-12 12:32:56,372 INFO L140 encePairwiseOnDemand]: 241/260 looper letters, 58 selfloop transitions, 14 changer transitions 0/273 dead transitions. [2024-11-12 12:32:56,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 273 transitions, 727 flow [2024-11-12 12:32:56,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:32:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:32:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2024-11-12 12:32:56,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8756410256410256 [2024-11-12 12:32:56,375 INFO L175 Difference]: Start difference. First operand has 242 places, 240 transitions, 506 flow. Second operand 3 states and 683 transitions. [2024-11-12 12:32:56,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 273 transitions, 727 flow [2024-11-12 12:32:56,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 273 transitions, 725 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:32:56,383 INFO L231 Difference]: Finished difference. Result has 245 places, 254 transitions, 626 flow [2024-11-12 12:32:56,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=245, PETRI_TRANSITIONS=254} [2024-11-12 12:32:56,387 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 3 predicate places. [2024-11-12 12:32:56,387 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 254 transitions, 626 flow [2024-11-12 12:32:56,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:56,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:56,388 INFO L206 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] [2024-11-12 12:32:56,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:32:56,388 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:32:56,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:56,389 INFO L85 PathProgramCache]: Analyzing trace with hash -589679511, now seen corresponding path program 1 times [2024-11-12 12:32:56,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:56,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589610779] [2024-11-12 12:32:56,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:56,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:32:56,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:56,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589610779] [2024-11-12 12:32:56,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589610779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:56,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:56,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:32:56,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160365161] [2024-11-12 12:32:56,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:56,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:32:56,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:56,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:32:56,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:32:56,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 260 [2024-11-12 12:32:56,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 254 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:56,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:56,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 260 [2024-11-12 12:32:56,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:32:58,798 INFO L124 PetriNetUnfolderBase]: 4870/17918 cut-off events. [2024-11-12 12:32:58,798 INFO L125 PetriNetUnfolderBase]: For 4444/4604 co-relation queries the response was YES. [2024-11-12 12:32:58,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29422 conditions, 17918 events. 4870/17918 cut-off events. For 4444/4604 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 213661 event pairs, 2423 based on Foata normal form. 47/16111 useless extension candidates. Maximal degree in co-relation 27913. Up to 6155 conditions per place. [2024-11-12 12:32:58,958 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 52 selfloop transitions, 14 changer transitions 0/278 dead transitions. [2024-11-12 12:32:58,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 278 transitions, 844 flow [2024-11-12 12:32:58,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:32:58,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:32:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 677 transitions. [2024-11-12 12:32:58,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.867948717948718 [2024-11-12 12:32:58,961 INFO L175 Difference]: Start difference. First operand has 245 places, 254 transitions, 626 flow. Second operand 3 states and 677 transitions. [2024-11-12 12:32:58,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 278 transitions, 844 flow [2024-11-12 12:32:58,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 278 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:32:58,977 INFO L231 Difference]: Finished difference. Result has 247 places, 266 transitions, 724 flow [2024-11-12 12:32:58,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=247, PETRI_TRANSITIONS=266} [2024-11-12 12:32:58,978 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 5 predicate places. [2024-11-12 12:32:58,979 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 266 transitions, 724 flow [2024-11-12 12:32:58,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:58,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:32:58,980 INFO L206 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] [2024-11-12 12:32:58,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:32:58,980 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:32:58,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:32:58,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2042612567, now seen corresponding path program 1 times [2024-11-12 12:32:58,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:32:58,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834758317] [2024-11-12 12:32:58,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:32:58,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:32:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:32:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:32:59,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:32:59,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834758317] [2024-11-12 12:32:59,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834758317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:32:59,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:32:59,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:32:59,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468937122] [2024-11-12 12:32:59,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:32:59,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:32:59,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:32:59,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:32:59,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:32:59,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 260 [2024-11-12 12:32:59,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 266 transitions, 724 flow. Second operand has 5 states, 5 states have (on average 214.6) internal successors, (1073), 5 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:32:59,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:32:59,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 260 [2024-11-12 12:32:59,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:01,549 INFO L124 PetriNetUnfolderBase]: 3368/20278 cut-off events. [2024-11-12 12:33:01,550 INFO L125 PetriNetUnfolderBase]: For 1844/2434 co-relation queries the response was YES. [2024-11-12 12:33:01,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28366 conditions, 20278 events. 3368/20278 cut-off events. For 1844/2434 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 266269 event pairs, 1051 based on Foata normal form. 22/17796 useless extension candidates. Maximal degree in co-relation 12827. Up to 3445 conditions per place. [2024-11-12 12:33:01,696 INFO L140 encePairwiseOnDemand]: 255/260 looper letters, 56 selfloop transitions, 5 changer transitions 0/298 dead transitions. [2024-11-12 12:33:01,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 298 transitions, 910 flow [2024-11-12 12:33:01,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:33:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:33:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1340 transitions. [2024-11-12 12:33:01,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8589743589743589 [2024-11-12 12:33:01,701 INFO L175 Difference]: Start difference. First operand has 247 places, 266 transitions, 724 flow. Second operand 6 states and 1340 transitions. [2024-11-12 12:33:01,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 298 transitions, 910 flow [2024-11-12 12:33:01,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 298 transitions, 882 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:33:01,718 INFO L231 Difference]: Finished difference. Result has 253 places, 268 transitions, 722 flow [2024-11-12 12:33:01,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=722, PETRI_PLACES=253, PETRI_TRANSITIONS=268} [2024-11-12 12:33:01,720 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 11 predicate places. [2024-11-12 12:33:01,720 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 268 transitions, 722 flow [2024-11-12 12:33:01,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 214.6) internal successors, (1073), 5 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:01,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:01,722 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:01,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:33:01,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:33:01,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:01,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2083425951, now seen corresponding path program 1 times [2024-11-12 12:33:01,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:01,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497590197] [2024-11-12 12:33:01,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:01,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:01,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:01,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497590197] [2024-11-12 12:33:01,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497590197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:01,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:01,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:33:01,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140908931] [2024-11-12 12:33:01,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:01,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:33:01,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:01,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:33:01,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:33:01,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 260 [2024-11-12 12:33:01,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 268 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:01,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:01,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 260 [2024-11-12 12:33:01,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:04,210 INFO L124 PetriNetUnfolderBase]: 5587/21320 cut-off events. [2024-11-12 12:33:04,211 INFO L125 PetriNetUnfolderBase]: For 5239/5434 co-relation queries the response was YES. [2024-11-12 12:33:04,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34628 conditions, 21320 events. 5587/21320 cut-off events. For 5239/5434 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 266775 event pairs, 2594 based on Foata normal form. 39/18956 useless extension candidates. Maximal degree in co-relation 34383. Up to 6886 conditions per place. [2024-11-12 12:33:04,373 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 59 selfloop transitions, 17 changer transitions 0/292 dead transitions. [2024-11-12 12:33:04,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 292 transitions, 957 flow [2024-11-12 12:33:04,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:33:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:33:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2024-11-12 12:33:04,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2024-11-12 12:33:04,376 INFO L175 Difference]: Start difference. First operand has 253 places, 268 transitions, 722 flow. Second operand 3 states and 676 transitions. [2024-11-12 12:33:04,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 292 transitions, 957 flow [2024-11-12 12:33:04,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 292 transitions, 951 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-12 12:33:04,384 INFO L231 Difference]: Finished difference. Result has 255 places, 281 transitions, 870 flow [2024-11-12 12:33:04,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=255, PETRI_TRANSITIONS=281} [2024-11-12 12:33:04,386 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 13 predicate places. [2024-11-12 12:33:04,386 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 281 transitions, 870 flow [2024-11-12 12:33:04,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:04,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:04,387 INFO L206 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-11-12 12:33:04,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:33:04,387 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:33:04,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:04,388 INFO L85 PathProgramCache]: Analyzing trace with hash 770767895, now seen corresponding path program 1 times [2024-11-12 12:33:04,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:04,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540361620] [2024-11-12 12:33:04,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:04,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:04,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:04,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:04,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540361620] [2024-11-12 12:33:04,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540361620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:04,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:04,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:33:04,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544059944] [2024-11-12 12:33:04,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:04,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:33:04,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:04,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:33:04,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:33:04,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 260 [2024-11-12 12:33:04,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 281 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:04,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:04,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 260 [2024-11-12 12:33:04,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:07,316 INFO L124 PetriNetUnfolderBase]: 6260/24125 cut-off events. [2024-11-12 12:33:07,317 INFO L125 PetriNetUnfolderBase]: For 12770/13222 co-relation queries the response was YES. [2024-11-12 12:33:07,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42176 conditions, 24125 events. 6260/24125 cut-off events. For 12770/13222 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 308899 event pairs, 2799 based on Foata normal form. 59/21507 useless extension candidates. Maximal degree in co-relation 41910. Up to 7732 conditions per place. [2024-11-12 12:33:07,516 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 71 selfloop transitions, 17 changer transitions 0/306 dead transitions. [2024-11-12 12:33:07,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 306 transitions, 1164 flow [2024-11-12 12:33:07,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:33:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:33:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 677 transitions. [2024-11-12 12:33:07,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.867948717948718 [2024-11-12 12:33:07,520 INFO L175 Difference]: Start difference. First operand has 255 places, 281 transitions, 870 flow. Second operand 3 states and 677 transitions. [2024-11-12 12:33:07,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 306 transitions, 1164 flow [2024-11-12 12:33:07,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 306 transitions, 1124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:33:07,552 INFO L231 Difference]: Finished difference. Result has 257 places, 294 transitions, 1012 flow [2024-11-12 12:33:07,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1012, PETRI_PLACES=257, PETRI_TRANSITIONS=294} [2024-11-12 12:33:07,554 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 15 predicate places. [2024-11-12 12:33:07,555 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 294 transitions, 1012 flow [2024-11-12 12:33:07,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:07,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:07,556 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:07,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:33:07,556 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:33:07,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:07,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1549554953, now seen corresponding path program 1 times [2024-11-12 12:33:07,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:07,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577492871] [2024-11-12 12:33:07,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:07,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:33:07,593 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:33:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:33:07,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 12:33:07,641 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:33:07,641 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-12 12:33:07,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-12 12:33:07,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-12 12:33:07,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-12 12:33:07,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-12 12:33:07,642 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-12 12:33:07,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-12 12:33:07,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-12 12:33:07,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-12 12:33:07,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-12 12:33:07,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-12 12:33:07,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-12 12:33:07,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-12 12:33:07,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-12 12:33:07,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-12 12:33:07,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-12 12:33:07,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:33:07,647 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:33:07,648 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-12 12:33:07,648 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-12 12:33:07,690 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-12 12:33:07,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 309 transitions, 645 flow [2024-11-12 12:33:07,944 INFO L124 PetriNetUnfolderBase]: 66/617 cut-off events. [2024-11-12 12:33:07,944 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-12 12:33:07,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 617 events. 66/617 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2145 event pairs, 1 based on Foata normal form. 0/519 useless extension candidates. Maximal degree in co-relation 434. Up to 16 conditions per place. [2024-11-12 12:33:07,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 309 transitions, 645 flow [2024-11-12 12:33:07,953 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 309 transitions, 645 flow [2024-11-12 12:33:07,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:33:07,955 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;@5e82f874, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:33:07,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-12 12:33:07,960 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:33:07,961 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2024-11-12 12:33:07,961 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:33:07,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:07,961 INFO L206 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] [2024-11-12 12:33:07,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-12 12:33:07,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:07,962 INFO L85 PathProgramCache]: Analyzing trace with hash -883986985, now seen corresponding path program 1 times [2024-11-12 12:33:07,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:07,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987934005] [2024-11-12 12:33:07,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:07,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:08,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:08,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:08,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987934005] [2024-11-12 12:33:08,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987934005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:08,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:08,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:33:08,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859064438] [2024-11-12 12:33:08,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:08,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:33:08,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:08,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:33:08,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:33:08,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 309 [2024-11-12 12:33:08,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 309 transitions, 645 flow. Second operand has 6 states, 6 states have (on average 239.5) internal successors, (1437), 6 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:08,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:08,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 309 [2024-11-12 12:33:08,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:17,213 INFO L124 PetriNetUnfolderBase]: 20344/68962 cut-off events. [2024-11-12 12:33:17,213 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2024-11-12 12:33:17,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97569 conditions, 68962 events. 20344/68962 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 1524. Compared 949215 event pairs, 6970 based on Foata normal form. 14560/76720 useless extension candidates. Maximal degree in co-relation 11497. Up to 20303 conditions per place. [2024-11-12 12:33:17,717 INFO L140 encePairwiseOnDemand]: 279/309 looper letters, 112 selfloop transitions, 5 changer transitions 0/354 dead transitions. [2024-11-12 12:33:17,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 354 transitions, 969 flow [2024-11-12 12:33:17,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:33:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:33:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1642 transitions. [2024-11-12 12:33:17,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8856526429341963 [2024-11-12 12:33:17,724 INFO L175 Difference]: Start difference. First operand has 286 places, 309 transitions, 645 flow. Second operand 6 states and 1642 transitions. [2024-11-12 12:33:17,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 354 transitions, 969 flow [2024-11-12 12:33:17,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 354 transitions, 969 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:33:17,731 INFO L231 Difference]: Finished difference. Result has 288 places, 282 transitions, 601 flow [2024-11-12 12:33:17,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=601, PETRI_PLACES=288, PETRI_TRANSITIONS=282} [2024-11-12 12:33:17,733 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 2 predicate places. [2024-11-12 12:33:17,733 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 282 transitions, 601 flow [2024-11-12 12:33:17,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.5) internal successors, (1437), 6 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:17,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:17,735 INFO L206 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] [2024-11-12 12:33:17,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:33:17,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-12 12:33:17,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:17,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1147775768, now seen corresponding path program 1 times [2024-11-12 12:33:17,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:17,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361972675] [2024-11-12 12:33:17,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:17,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:17,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:17,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361972675] [2024-11-12 12:33:17,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361972675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:17,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:17,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:33:17,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609354305] [2024-11-12 12:33:17,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:17,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:33:17,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:17,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:33:17,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:33:17,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 309 [2024-11-12 12:33:17,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 282 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:17,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:17,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 309 [2024-11-12 12:33:17,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:33:22,320 INFO L124 PetriNetUnfolderBase]: 10246/37004 cut-off events. [2024-11-12 12:33:22,320 INFO L125 PetriNetUnfolderBase]: For 1825/1825 co-relation queries the response was YES. [2024-11-12 12:33:22,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52095 conditions, 37004 events. 10246/37004 cut-off events. For 1825/1825 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 477034 event pairs, 5617 based on Foata normal form. 1/33441 useless extension candidates. Maximal degree in co-relation 6794. Up to 14009 conditions per place. [2024-11-12 12:33:22,605 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 39 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2024-11-12 12:33:22,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 289 transitions, 699 flow [2024-11-12 12:33:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:33:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:33:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2024-11-12 12:33:22,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8543689320388349 [2024-11-12 12:33:22,607 INFO L175 Difference]: Start difference. First operand has 288 places, 282 transitions, 601 flow. Second operand 3 states and 792 transitions. [2024-11-12 12:33:22,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 289 transitions, 699 flow [2024-11-12 12:33:22,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 289 transitions, 687 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:33:22,614 INFO L231 Difference]: Finished difference. Result has 286 places, 283 transitions, 603 flow [2024-11-12 12:33:22,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=286, PETRI_TRANSITIONS=283} [2024-11-12 12:33:22,615 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 0 predicate places. [2024-11-12 12:33:22,615 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 283 transitions, 603 flow [2024-11-12 12:33:22,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:22,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:33:22,616 INFO L206 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] [2024-11-12 12:33:22,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 12:33:22,616 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-12 12:33:22,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:33:22,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1377695253, now seen corresponding path program 1 times [2024-11-12 12:33:22,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:33:22,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562776435] [2024-11-12 12:33:22,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:33:22,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:33:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:33:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:33:22,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:33:22,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562776435] [2024-11-12 12:33:22,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562776435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:33:22,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:33:22,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:33:22,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571116725] [2024-11-12 12:33:22,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:33:22,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:33:22,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:33:22,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:33:22,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:33:22,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 309 [2024-11-12 12:33:22,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 283 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:33:22,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:33:22,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 309 [2024-11-12 12:33:22,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand