./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d 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_08-cond_racefree.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 b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:55:06,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:55:06,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:55:06,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:55:06,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:55:06,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:55:06,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:55:06,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:55:06,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:55:06,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:55:06,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:55:06,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:55:06,549 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:55:06,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:55:06,559 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:55:06,559 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:55:06,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:55:06,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:55:06,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:55:06,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:55:06,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:55:06,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:55:06,561 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:55:06,561 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:55:06,562 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:55:06,562 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:55:06,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:55:06,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:55:06,562 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:55:06,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:55:06,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:55:06,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:55:06,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:55:06,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:55:06,564 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:55:06,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:55:06,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:55:06,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:55:06,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:55:06,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:55:06,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:55:06,566 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 -> b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 [2024-11-09 06:55:06,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:55:06,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:55:06,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:55:06,814 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:55:06,814 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:55:06,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2024-11-09 06:55:08,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:55:08,332 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:55:08,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2024-11-09 06:55:08,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ef30a1ca/44c0aa4c080048d2a102319041184180/FLAG3410301ab [2024-11-09 06:55:08,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ef30a1ca/44c0aa4c080048d2a102319041184180 [2024-11-09 06:55:08,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:55:08,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:55:08,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:55:08,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:55:08,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:55:08,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:55:08" (1/1) ... [2024-11-09 06:55:08,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b1b39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:08, skipping insertion in model container [2024-11-09 06:55:08,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:55:08" (1/1) ... [2024-11-09 06:55:08,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:55:08,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:55:08,804 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:55:08,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:55:08,899 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:55:08,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:08 WrapperNode [2024-11-09 06:55:08,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:55:08,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:55:08,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:55:08,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:55:08,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:08" (1/1) ... [2024-11-09 06:55:08,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:08" (1/1) ... [2024-11-09 06:55:08,949 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 157 [2024-11-09 06:55:08,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:55:08,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:55:08,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:55:08,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:55:08,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:08" (1/1) ... [2024-11-09 06:55:08,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:08" (1/1) ... [2024-11-09 06:55:08,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:08" (1/1) ... [2024-11-09 06:55:08,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:08" (1/1) ... [2024-11-09 06:55:08,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:08" (1/1) ... [2024-11-09 06:55:08,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:08" (1/1) ... [2024-11-09 06:55:08,989 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:08" (1/1) ... [2024-11-09 06:55:08,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:08" (1/1) ... [2024-11-09 06:55:08,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:55:09,000 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:55:09,000 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:55:09,000 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:55:09,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:08" (1/1) ... [2024-11-09 06:55:09,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:55:09,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:55:09,031 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-09 06:55:09,037 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-09 06:55:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:55:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:55:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 06:55:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:55:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:55:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 06:55:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:55:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 06:55:09,071 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 06:55:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:55:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:55:09,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:55:09,073 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:55:09,195 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:55:09,197 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:55:09,465 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:55:09,467 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:55:09,503 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:55:09,504 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-09 06:55:09,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:55:09 BoogieIcfgContainer [2024-11-09 06:55:09,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:55:09,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:55:09,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:55:09,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:55:09,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:55:08" (1/3) ... [2024-11-09 06:55:09,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766f0d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:55:09, skipping insertion in model container [2024-11-09 06:55:09,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:08" (2/3) ... [2024-11-09 06:55:09,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766f0d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:55:09, skipping insertion in model container [2024-11-09 06:55:09,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:55:09" (3/3) ... [2024-11-09 06:55:09,512 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_08-cond_racefree.i [2024-11-09 06:55:09,526 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:55:09,526 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-09 06:55:09,526 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:55:09,616 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 06:55:09,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 211 transitions, 429 flow [2024-11-09 06:55:09,760 INFO L124 PetriNetUnfolderBase]: 25/280 cut-off events. [2024-11-09 06:55:09,761 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:55:09,769 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-09 06:55:09,770 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 211 transitions, 429 flow [2024-11-09 06:55:09,777 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 211 transitions, 429 flow [2024-11-09 06:55:09,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:55:09,796 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;@48b8d51b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:55:09,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-09 06:55:09,818 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:55:09,818 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2024-11-09 06:55:09,819 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:55:09,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:09,820 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:09,820 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-09 06:55:09,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:09,825 INFO L85 PathProgramCache]: Analyzing trace with hash -605595689, now seen corresponding path program 1 times [2024-11-09 06:55:09,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:09,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881576012] [2024-11-09 06:55:09,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:09,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:10,623 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-09 06:55:10,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:10,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881576012] [2024-11-09 06:55:10,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881576012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:10,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:10,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:55:10,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057000499] [2024-11-09 06:55:10,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:10,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:55:10,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:10,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:55:10,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:55:10,794 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 211 [2024-11-09 06:55:10,799 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-09 06:55:10,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:10,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 211 [2024-11-09 06:55:10,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:11,062 INFO L124 PetriNetUnfolderBase]: 135/895 cut-off events. [2024-11-09 06:55:11,064 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 06:55:11,068 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-09 06:55:11,075 INFO L140 encePairwiseOnDemand]: 193/211 looper letters, 48 selfloop transitions, 5 changer transitions 0/220 dead transitions. [2024-11-09 06:55:11,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 220 transitions, 553 flow [2024-11-09 06:55:11,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:55:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:55:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1098 transitions. [2024-11-09 06:55:11,097 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8672985781990521 [2024-11-09 06:55:11,099 INFO L175 Difference]: Start difference. First operand has 198 places, 211 transitions, 429 flow. Second operand 6 states and 1098 transitions. [2024-11-09 06:55:11,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 220 transitions, 553 flow [2024-11-09 06:55:11,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 220 transitions, 553 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:55:11,109 INFO L231 Difference]: Finished difference. Result has 200 places, 196 transitions, 409 flow [2024-11-09 06:55:11,110 INFO L260 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-09 06:55:11,114 INFO L277 CegarLoopForPetriNet]: 198 programPoint places, 2 predicate places. [2024-11-09 06:55:11,115 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 196 transitions, 409 flow [2024-11-09 06:55:11,115 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-09 06:55:11,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:11,116 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:11,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:55:11,117 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-09 06:55:11,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:11,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1901146632, now seen corresponding path program 1 times [2024-11-09 06:55:11,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:11,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591185567] [2024-11-09 06:55:11,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:11,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:11,202 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-09 06:55:11,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:11,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591185567] [2024-11-09 06:55:11,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591185567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:11,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:11,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:55:11,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259287485] [2024-11-09 06:55:11,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:11,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:11,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:11,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:11,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:11,232 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 211 [2024-11-09 06:55:11,233 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-09 06:55:11,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:11,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 211 [2024-11-09 06:55:11,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:11,306 INFO L124 PetriNetUnfolderBase]: 57/640 cut-off events. [2024-11-09 06:55:11,307 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-09 06:55:11,309 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-09 06:55:11,311 INFO L140 encePairwiseOnDemand]: 208/211 looper letters, 22 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2024-11-09 06:55:11,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 202 transitions, 469 flow [2024-11-09 06:55:11,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2024-11-09 06:55:11,312 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8925750394944708 [2024-11-09 06:55:11,312 INFO L175 Difference]: Start difference. First operand has 200 places, 196 transitions, 409 flow. Second operand 3 states and 565 transitions. [2024-11-09 06:55:11,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 202 transitions, 469 flow [2024-11-09 06:55:11,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 202 transitions, 459 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:55:11,316 INFO L231 Difference]: Finished difference. Result has 198 places, 196 transitions, 407 flow [2024-11-09 06:55:11,317 INFO L260 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-09 06:55:11,317 INFO L277 CegarLoopForPetriNet]: 198 programPoint places, 0 predicate places. [2024-11-09 06:55:11,317 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 196 transitions, 407 flow [2024-11-09 06:55:11,318 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-09 06:55:11,318 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:11,318 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:11,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:55:11,319 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-09 06:55:11,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:11,319 INFO L85 PathProgramCache]: Analyzing trace with hash -506205996, now seen corresponding path program 1 times [2024-11-09 06:55:11,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:11,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34508781] [2024-11-09 06:55:11,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:11,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:11,377 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-09 06:55:11,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:11,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34508781] [2024-11-09 06:55:11,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34508781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:11,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:11,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:11,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064293273] [2024-11-09 06:55:11,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:11,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:11,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:11,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:11,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:11,395 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 211 [2024-11-09 06:55:11,404 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-09 06:55:11,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:11,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 211 [2024-11-09 06:55:11,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:11,525 INFO L124 PetriNetUnfolderBase]: 134/935 cut-off events. [2024-11-09 06:55:11,526 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-09 06:55:11,528 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-09 06:55:11,533 INFO L140 encePairwiseOnDemand]: 202/211 looper letters, 30 selfloop transitions, 6 changer transitions 0/209 dead transitions. [2024-11-09 06:55:11,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 209 transitions, 508 flow [2024-11-09 06:55:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2024-11-09 06:55:11,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8909952606635071 [2024-11-09 06:55:11,535 INFO L175 Difference]: Start difference. First operand has 198 places, 196 transitions, 407 flow. Second operand 3 states and 564 transitions. [2024-11-09 06:55:11,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 209 transitions, 508 flow [2024-11-09 06:55:11,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 209 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:55:11,540 INFO L231 Difference]: Finished difference. Result has 198 places, 198 transitions, 441 flow [2024-11-09 06:55:11,541 INFO L260 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-09 06:55:11,542 INFO L277 CegarLoopForPetriNet]: 198 programPoint places, 0 predicate places. [2024-11-09 06:55:11,542 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 198 transitions, 441 flow [2024-11-09 06:55:11,543 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-09 06:55:11,543 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:11,543 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:11,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:55:11,543 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-09 06:55:11,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:11,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1186278216, now seen corresponding path program 1 times [2024-11-09 06:55:11,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:11,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426486841] [2024-11-09 06:55:11,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:11,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:11,597 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-09 06:55:11,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:11,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426486841] [2024-11-09 06:55:11,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426486841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:11,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:11,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:11,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020734305] [2024-11-09 06:55:11,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:11,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:11,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:11,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:11,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:11,618 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 211 [2024-11-09 06:55:11,619 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-09 06:55:11,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:11,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 211 [2024-11-09 06:55:11,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:11,732 INFO L124 PetriNetUnfolderBase]: 139/1017 cut-off events. [2024-11-09 06:55:11,733 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-11-09 06:55:11,735 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-09 06:55:11,738 INFO L140 encePairwiseOnDemand]: 206/211 looper letters, 27 selfloop transitions, 4 changer transitions 0/205 dead transitions. [2024-11-09 06:55:11,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 205 transitions, 521 flow [2024-11-09 06:55:11,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2024-11-09 06:55:11,740 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8846761453396524 [2024-11-09 06:55:11,740 INFO L175 Difference]: Start difference. First operand has 198 places, 198 transitions, 441 flow. Second operand 3 states and 560 transitions. [2024-11-09 06:55:11,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 205 transitions, 521 flow [2024-11-09 06:55:11,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 205 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:55:11,746 INFO L231 Difference]: Finished difference. Result has 200 places, 201 transitions, 461 flow [2024-11-09 06:55:11,746 INFO L260 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-09 06:55:11,747 INFO L277 CegarLoopForPetriNet]: 198 programPoint places, 2 predicate places. [2024-11-09 06:55:11,747 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 201 transitions, 461 flow [2024-11-09 06:55:11,748 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-09 06:55:11,748 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:11,748 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:55:11,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:55:11,749 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-09 06:55:11,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:11,751 INFO L85 PathProgramCache]: Analyzing trace with hash 83373136, now seen corresponding path program 1 times [2024-11-09 06:55:11,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:11,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537337398] [2024-11-09 06:55:11,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:11,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:55:11,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:55:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:55:11,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:55:11,820 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:55:11,821 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-09 06:55:11,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-09 06:55:11,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-09 06:55:11,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-09 06:55:11,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-09 06:55:11,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-09 06:55:11,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-09 06:55:11,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-09 06:55:11,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-09 06:55:11,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-09 06:55:11,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-09 06:55:11,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-09 06:55:11,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:55:11,823 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 06:55:11,825 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 06:55:11,825 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 06:55:11,856 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 06:55:11,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 260 transitions, 536 flow [2024-11-09 06:55:11,895 INFO L124 PetriNetUnfolderBase]: 43/426 cut-off events. [2024-11-09 06:55:11,895 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 06:55:11,899 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-09 06:55:11,899 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 260 transitions, 536 flow [2024-11-09 06:55:11,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 242 places, 260 transitions, 536 flow [2024-11-09 06:55:11,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:55:11,903 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;@48b8d51b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:55:11,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-09 06:55:11,909 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:55:11,909 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2024-11-09 06:55:11,909 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:55:11,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:11,910 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:11,910 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-09 06:55:11,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:11,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2037411799, now seen corresponding path program 1 times [2024-11-09 06:55:11,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:11,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035632040] [2024-11-09 06:55:11,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:11,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:12,219 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-09 06:55:12,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:12,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035632040] [2024-11-09 06:55:12,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035632040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:12,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:12,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:55:12,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257845426] [2024-11-09 06:55:12,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:12,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:55:12,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:12,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:55:12,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:55:12,298 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 260 [2024-11-09 06:55:12,300 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-09 06:55:12,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:12,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 260 [2024-11-09 06:55:12,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:13,009 INFO L124 PetriNetUnfolderBase]: 1710/6555 cut-off events. [2024-11-09 06:55:13,010 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-09 06:55:13,028 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-09 06:55:13,051 INFO L140 encePairwiseOnDemand]: 236/260 looper letters, 80 selfloop transitions, 5 changer transitions 0/287 dead transitions. [2024-11-09 06:55:13,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 287 transitions, 760 flow [2024-11-09 06:55:13,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:55:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:55:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1370 transitions. [2024-11-09 06:55:13,054 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8782051282051282 [2024-11-09 06:55:13,054 INFO L175 Difference]: Start difference. First operand has 242 places, 260 transitions, 536 flow. Second operand 6 states and 1370 transitions. [2024-11-09 06:55:13,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 287 transitions, 760 flow [2024-11-09 06:55:13,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 287 transitions, 760 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:55:13,058 INFO L231 Difference]: Finished difference. Result has 244 places, 239 transitions, 504 flow [2024-11-09 06:55:13,058 INFO L260 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-09 06:55:13,060 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 2 predicate places. [2024-11-09 06:55:13,060 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 239 transitions, 504 flow [2024-11-09 06:55:13,061 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-09 06:55:13,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:13,061 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:13,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:55:13,062 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-09 06:55:13,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:13,062 INFO L85 PathProgramCache]: Analyzing trace with hash -296614280, now seen corresponding path program 1 times [2024-11-09 06:55:13,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:13,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075834591] [2024-11-09 06:55:13,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:13,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:13,107 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-09 06:55:13,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:13,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075834591] [2024-11-09 06:55:13,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075834591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:13,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:13,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:55:13,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096638754] [2024-11-09 06:55:13,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:13,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:13,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:13,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:13,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:13,129 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 260 [2024-11-09 06:55:13,130 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-09 06:55:13,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:13,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 260 [2024-11-09 06:55:13,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:13,589 INFO L124 PetriNetUnfolderBase]: 938/4718 cut-off events. [2024-11-09 06:55:13,589 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2024-11-09 06:55:13,599 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-09 06:55:13,614 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 31 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2024-11-09 06:55:13,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 246 transitions, 586 flow [2024-11-09 06:55:13,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2024-11-09 06:55:13,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8705128205128205 [2024-11-09 06:55:13,616 INFO L175 Difference]: Start difference. First operand has 244 places, 239 transitions, 504 flow. Second operand 3 states and 679 transitions. [2024-11-09 06:55:13,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 246 transitions, 586 flow [2024-11-09 06:55:13,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 246 transitions, 574 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:55:13,619 INFO L231 Difference]: Finished difference. Result has 242 places, 240 transitions, 506 flow [2024-11-09 06:55:13,620 INFO L260 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-09 06:55:13,620 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 0 predicate places. [2024-11-09 06:55:13,620 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 240 transitions, 506 flow [2024-11-09 06:55:13,621 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-09 06:55:13,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:13,621 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:13,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:55:13,621 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-09 06:55:13,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:13,622 INFO L85 PathProgramCache]: Analyzing trace with hash 605204743, now seen corresponding path program 1 times [2024-11-09 06:55:13,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:13,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692401044] [2024-11-09 06:55:13,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:13,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:13,661 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-09 06:55:13,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:13,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692401044] [2024-11-09 06:55:13,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692401044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:13,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:13,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:13,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076256530] [2024-11-09 06:55:13,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:13,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:13,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:13,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:13,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:13,688 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 260 [2024-11-09 06:55:13,689 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-09 06:55:13,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:13,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 260 [2024-11-09 06:55:13,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:15,317 INFO L124 PetriNetUnfolderBase]: 4720/15525 cut-off events. [2024-11-09 06:55:15,317 INFO L125 PetriNetUnfolderBase]: For 453/453 co-relation queries the response was YES. [2024-11-09 06:55:15,347 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-09 06:55:15,393 INFO L140 encePairwiseOnDemand]: 241/260 looper letters, 58 selfloop transitions, 14 changer transitions 0/273 dead transitions. [2024-11-09 06:55:15,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 273 transitions, 727 flow [2024-11-09 06:55:15,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2024-11-09 06:55:15,394 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8756410256410256 [2024-11-09 06:55:15,395 INFO L175 Difference]: Start difference. First operand has 242 places, 240 transitions, 506 flow. Second operand 3 states and 683 transitions. [2024-11-09 06:55:15,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 273 transitions, 727 flow [2024-11-09 06:55:15,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 273 transitions, 725 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:55:15,399 INFO L231 Difference]: Finished difference. Result has 245 places, 254 transitions, 626 flow [2024-11-09 06:55:15,399 INFO L260 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-09 06:55:15,400 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 3 predicate places. [2024-11-09 06:55:15,400 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 254 transitions, 626 flow [2024-11-09 06:55:15,401 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-09 06:55:15,401 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:15,401 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:15,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:55:15,401 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-09 06:55:15,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:15,402 INFO L85 PathProgramCache]: Analyzing trace with hash -589679511, now seen corresponding path program 1 times [2024-11-09 06:55:15,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:15,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820327321] [2024-11-09 06:55:15,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:15,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:15,502 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-09 06:55:15,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:15,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820327321] [2024-11-09 06:55:15,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820327321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:15,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:15,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:15,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973439197] [2024-11-09 06:55:15,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:15,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:15,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:15,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:15,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:15,540 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 260 [2024-11-09 06:55:15,541 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-09 06:55:15,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:15,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 260 [2024-11-09 06:55:15,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:17,375 INFO L124 PetriNetUnfolderBase]: 4870/17918 cut-off events. [2024-11-09 06:55:17,375 INFO L125 PetriNetUnfolderBase]: For 4444/4604 co-relation queries the response was YES. [2024-11-09 06:55:17,413 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-09 06:55:17,465 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 52 selfloop transitions, 14 changer transitions 0/278 dead transitions. [2024-11-09 06:55:17,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 278 transitions, 844 flow [2024-11-09 06:55:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:17,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 677 transitions. [2024-11-09 06:55:17,468 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.867948717948718 [2024-11-09 06:55:17,469 INFO L175 Difference]: Start difference. First operand has 245 places, 254 transitions, 626 flow. Second operand 3 states and 677 transitions. [2024-11-09 06:55:17,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 278 transitions, 844 flow [2024-11-09 06:55:17,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 278 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:55:17,483 INFO L231 Difference]: Finished difference. Result has 247 places, 266 transitions, 724 flow [2024-11-09 06:55:17,483 INFO L260 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-09 06:55:17,484 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 5 predicate places. [2024-11-09 06:55:17,484 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 266 transitions, 724 flow [2024-11-09 06:55:17,485 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-09 06:55:17,485 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:17,485 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:17,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:55:17,485 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-09 06:55:17,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:17,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2042612567, now seen corresponding path program 1 times [2024-11-09 06:55:17,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:17,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496154088] [2024-11-09 06:55:17,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:17,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:17,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:17,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496154088] [2024-11-09 06:55:17,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496154088] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:55:17,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919170548] [2024-11-09 06:55:17,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:17,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:55:17,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:55:17,566 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:55:17,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:55:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:17,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:55:17,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:55:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:17,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:55:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:17,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919170548] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:55:17,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:55:17,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 06:55:17,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736829161] [2024-11-09 06:55:17,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:55:17,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:55:17,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:17,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:55:17,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:55:17,896 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 260 [2024-11-09 06:55:17,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 266 transitions, 724 flow. Second operand has 10 states, 10 states have (on average 214.1) internal successors, (2141), 10 states have internal predecessors, (2141), 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-09 06:55:17,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:17,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 260 [2024-11-09 06:55:17,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:18,365 INFO L124 PetriNetUnfolderBase]: 754/3648 cut-off events. [2024-11-09 06:55:18,366 INFO L125 PetriNetUnfolderBase]: For 490/524 co-relation queries the response was YES. [2024-11-09 06:55:18,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5618 conditions, 3648 events. 754/3648 cut-off events. For 490/524 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 32930 event pairs, 24 based on Foata normal form. 108/3526 useless extension candidates. Maximal degree in co-relation 2672. Up to 478 conditions per place. [2024-11-09 06:55:18,381 INFO L140 encePairwiseOnDemand]: 255/260 looper letters, 72 selfloop transitions, 7 changer transitions 0/263 dead transitions. [2024-11-09 06:55:18,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 263 transitions, 830 flow [2024-11-09 06:55:18,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:55:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 06:55:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1989 transitions. [2024-11-09 06:55:18,386 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.85 [2024-11-09 06:55:18,386 INFO L175 Difference]: Start difference. First operand has 247 places, 266 transitions, 724 flow. Second operand 9 states and 1989 transitions. [2024-11-09 06:55:18,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 263 transitions, 830 flow [2024-11-09 06:55:18,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 263 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:55:18,392 INFO L231 Difference]: Finished difference. Result has 203 places, 207 transitions, 554 flow [2024-11-09 06:55:18,392 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=554, PETRI_PLACES=203, PETRI_TRANSITIONS=207} [2024-11-09 06:55:18,393 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -39 predicate places. [2024-11-09 06:55:18,393 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 207 transitions, 554 flow [2024-11-09 06:55:18,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 214.1) internal successors, (2141), 10 states have internal predecessors, (2141), 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-09 06:55:18,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:18,395 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:55:18,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:55:18,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 06:55:18,600 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-09 06:55:18,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:18,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2083425951, now seen corresponding path program 1 times [2024-11-09 06:55:18,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:18,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130554603] [2024-11-09 06:55:18,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:18,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 06:55:18,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:18,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130554603] [2024-11-09 06:55:18,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130554603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:18,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:18,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:18,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660290147] [2024-11-09 06:55:18,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:18,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:18,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:18,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:18,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:18,679 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 260 [2024-11-09 06:55:18,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 207 transitions, 554 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-09 06:55:18,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:18,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 260 [2024-11-09 06:55:18,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:18,800 INFO L124 PetriNetUnfolderBase]: 260/1348 cut-off events. [2024-11-09 06:55:18,800 INFO L125 PetriNetUnfolderBase]: For 451/472 co-relation queries the response was YES. [2024-11-09 06:55:18,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2393 conditions, 1348 events. 260/1348 cut-off events. For 451/472 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8691 event pairs, 132 based on Foata normal form. 7/1263 useless extension candidates. Maximal degree in co-relation 2262. Up to 459 conditions per place. [2024-11-09 06:55:18,806 INFO L140 encePairwiseOnDemand]: 252/260 looper letters, 42 selfloop transitions, 12 changer transitions 0/221 dead transitions. [2024-11-09 06:55:18,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 221 transitions, 706 flow [2024-11-09 06:55:18,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:18,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2024-11-09 06:55:18,809 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.85 [2024-11-09 06:55:18,809 INFO L175 Difference]: Start difference. First operand has 203 places, 207 transitions, 554 flow. Second operand 3 states and 663 transitions. [2024-11-09 06:55:18,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 221 transitions, 706 flow [2024-11-09 06:55:18,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 221 transitions, 691 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-09 06:55:18,812 INFO L231 Difference]: Finished difference. Result has 202 places, 215 transitions, 637 flow [2024-11-09 06:55:18,813 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=637, PETRI_PLACES=202, PETRI_TRANSITIONS=215} [2024-11-09 06:55:18,813 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -40 predicate places. [2024-11-09 06:55:18,813 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 215 transitions, 637 flow [2024-11-09 06:55:18,814 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-09 06:55:18,814 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:18,814 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:18,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:55:18,814 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-09 06:55:18,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:18,815 INFO L85 PathProgramCache]: Analyzing trace with hash 770767895, now seen corresponding path program 1 times [2024-11-09 06:55:18,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:18,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962909333] [2024-11-09 06:55:18,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:18,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:18,850 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-09 06:55:18,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:18,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962909333] [2024-11-09 06:55:18,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962909333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:18,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:18,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:18,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933944642] [2024-11-09 06:55:18,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:18,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:18,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:18,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:18,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:18,882 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 260 [2024-11-09 06:55:18,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 215 transitions, 637 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-09 06:55:18,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:18,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 260 [2024-11-09 06:55:18,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:19,007 INFO L124 PetriNetUnfolderBase]: 291/1420 cut-off events. [2024-11-09 06:55:19,007 INFO L125 PetriNetUnfolderBase]: For 1124/1159 co-relation queries the response was YES. [2024-11-09 06:55:19,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 1420 events. 291/1420 cut-off events. For 1124/1159 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9395 event pairs, 134 based on Foata normal form. 9/1353 useless extension candidates. Maximal degree in co-relation 2719. Up to 501 conditions per place. [2024-11-09 06:55:19,016 INFO L140 encePairwiseOnDemand]: 252/260 looper letters, 49 selfloop transitions, 12 changer transitions 0/230 dead transitions. [2024-11-09 06:55:19,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 230 transitions, 826 flow [2024-11-09 06:55:19,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:19,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2024-11-09 06:55:19,018 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2024-11-09 06:55:19,018 INFO L175 Difference]: Start difference. First operand has 202 places, 215 transitions, 637 flow. Second operand 3 states and 664 transitions. [2024-11-09 06:55:19,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 230 transitions, 826 flow [2024-11-09 06:55:19,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 230 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:55:19,023 INFO L231 Difference]: Finished difference. Result has 204 places, 223 transitions, 723 flow [2024-11-09 06:55:19,023 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=204, PETRI_TRANSITIONS=223} [2024-11-09 06:55:19,024 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -38 predicate places. [2024-11-09 06:55:19,024 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 223 transitions, 723 flow [2024-11-09 06:55:19,025 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-09 06:55:19,025 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:19,025 INFO L204 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-09 06:55:19,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:55:19,025 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-09 06:55:19,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:19,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1549554953, now seen corresponding path program 1 times [2024-11-09 06:55:19,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:19,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349004412] [2024-11-09 06:55:19,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:19,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:55:19,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:55:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:55:19,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:55:19,081 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:55:19,081 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-09 06:55:19,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-09 06:55:19,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-09 06:55:19,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-09 06:55:19,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-09 06:55:19,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-09 06:55:19,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-09 06:55:19,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-09 06:55:19,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-09 06:55:19,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-09 06:55:19,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-09 06:55:19,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-09 06:55:19,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-09 06:55:19,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-09 06:55:19,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-09 06:55:19,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-09 06:55:19,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:55:19,084 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:19,085 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 06:55:19,085 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 06:55:19,104 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 06:55:19,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 309 transitions, 645 flow [2024-11-09 06:55:19,164 INFO L124 PetriNetUnfolderBase]: 66/617 cut-off events. [2024-11-09 06:55:19,164 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 06:55:19,168 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-09 06:55:19,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 309 transitions, 645 flow [2024-11-09 06:55:19,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 309 transitions, 645 flow [2024-11-09 06:55:19,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:55:19,175 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;@48b8d51b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:55:19,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-09 06:55:19,221 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:55:19,221 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2024-11-09 06:55:19,221 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:55:19,221 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:19,221 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:19,222 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-09 06:55:19,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:19,222 INFO L85 PathProgramCache]: Analyzing trace with hash -883986985, now seen corresponding path program 1 times [2024-11-09 06:55:19,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:19,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189366959] [2024-11-09 06:55:19,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:19,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:19,543 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-09 06:55:19,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:19,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189366959] [2024-11-09 06:55:19,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189366959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:19,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:19,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:55:19,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480738314] [2024-11-09 06:55:19,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:19,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:55:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:19,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:55:19,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:55:19,626 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 309 [2024-11-09 06:55:19,628 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-09 06:55:19,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:19,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 309 [2024-11-09 06:55:19,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:28,031 INFO L124 PetriNetUnfolderBase]: 20344/68962 cut-off events. [2024-11-09 06:55:28,032 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2024-11-09 06:55:28,212 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-09 06:55:28,453 INFO L140 encePairwiseOnDemand]: 279/309 looper letters, 112 selfloop transitions, 5 changer transitions 0/354 dead transitions. [2024-11-09 06:55:28,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 354 transitions, 969 flow [2024-11-09 06:55:28,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:55:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:55:28,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1642 transitions. [2024-11-09 06:55:28,458 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8856526429341963 [2024-11-09 06:55:28,459 INFO L175 Difference]: Start difference. First operand has 286 places, 309 transitions, 645 flow. Second operand 6 states and 1642 transitions. [2024-11-09 06:55:28,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 354 transitions, 969 flow [2024-11-09 06:55:28,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 354 transitions, 969 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:55:28,465 INFO L231 Difference]: Finished difference. Result has 288 places, 282 transitions, 601 flow [2024-11-09 06:55:28,465 INFO L260 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-09 06:55:28,466 INFO L277 CegarLoopForPetriNet]: 286 programPoint places, 2 predicate places. [2024-11-09 06:55:28,466 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 282 transitions, 601 flow [2024-11-09 06:55:28,467 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-09 06:55:28,467 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:28,467 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:28,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:55:28,468 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-09 06:55:28,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:28,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1147775768, now seen corresponding path program 1 times [2024-11-09 06:55:28,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:28,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272461614] [2024-11-09 06:55:28,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:28,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:28,504 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-09 06:55:28,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:28,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272461614] [2024-11-09 06:55:28,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272461614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:28,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:28,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:55:28,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720492155] [2024-11-09 06:55:28,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:28,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:28,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:28,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:28,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:28,522 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 309 [2024-11-09 06:55:28,523 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-09 06:55:28,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:28,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 309 [2024-11-09 06:55:28,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:32,964 INFO L124 PetriNetUnfolderBase]: 10246/37004 cut-off events. [2024-11-09 06:55:32,965 INFO L125 PetriNetUnfolderBase]: For 1825/1825 co-relation queries the response was YES. [2024-11-09 06:55:33,065 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-09 06:55:33,192 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 39 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2024-11-09 06:55:33,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 289 transitions, 699 flow [2024-11-09 06:55:33,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:33,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2024-11-09 06:55:33,195 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8543689320388349 [2024-11-09 06:55:33,195 INFO L175 Difference]: Start difference. First operand has 288 places, 282 transitions, 601 flow. Second operand 3 states and 792 transitions. [2024-11-09 06:55:33,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 289 transitions, 699 flow [2024-11-09 06:55:33,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 289 transitions, 687 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:55:33,200 INFO L231 Difference]: Finished difference. Result has 286 places, 283 transitions, 603 flow [2024-11-09 06:55:33,201 INFO L260 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-09 06:55:33,202 INFO L277 CegarLoopForPetriNet]: 286 programPoint places, 0 predicate places. [2024-11-09 06:55:33,202 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 283 transitions, 603 flow [2024-11-09 06:55:33,203 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-09 06:55:33,203 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:33,203 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:33,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:55:33,203 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-09 06:55:33,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:33,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1377695253, now seen corresponding path program 1 times [2024-11-09 06:55:33,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:33,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594457040] [2024-11-09 06:55:33,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:33,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:33,241 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-09 06:55:33,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594457040] [2024-11-09 06:55:33,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594457040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:33,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:33,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:33,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771744228] [2024-11-09 06:55:33,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:33,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:33,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:33,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:33,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:33,281 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 309 [2024-11-09 06:55:33,282 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-09 06:55:33,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:33,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 309 [2024-11-09 06:55:33,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand