./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_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 b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:52:48,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:52:48,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:52:48,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:52:48,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:52:48,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:52:48,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:52:48,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:52:48,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:52:48,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:52:48,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:52:48,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:52:48,893 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:52:48,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:52:48,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:52:48,894 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:52:48,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:52:48,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:52:48,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:52:48,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:52:48,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:52:48,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:52:48,897 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:52:48,897 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:52:48,898 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:52:48,899 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:52:48,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:52:48,899 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:52:48,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:52:48,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:52:48,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:52:48,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:52:48,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:52:48,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:52:48,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:52:48,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:52:48,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:52:48,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:52:48,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:52:48,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:52:48,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:52:48,904 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 -> b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 [2024-11-19 05:52:49,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:52:49,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:52:49,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:52:49,196 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:52:49,196 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:52:49,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2024-11-19 05:52:50,625 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:52:50,899 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:52:50,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2024-11-19 05:52:50,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/018748b0a/b33d3f32ea404b98a7fe1e86e865da50/FLAGa815999ef [2024-11-19 05:52:50,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/018748b0a/b33d3f32ea404b98a7fe1e86e865da50 [2024-11-19 05:52:50,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:52:50,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:52:50,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:52:50,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:52:50,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:52:50,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:52:50" (1/1) ... [2024-11-19 05:52:50,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4871c26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:50, skipping insertion in model container [2024-11-19 05:52:50,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:52:50" (1/1) ... [2024-11-19 05:52:51,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:52:51,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:52:51,465 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:52:51,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:52:51,581 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:52:51,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:51 WrapperNode [2024-11-19 05:52:51,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:52:51,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:52:51,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:52:51,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:52:51,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:51" (1/1) ... [2024-11-19 05:52:51,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:51" (1/1) ... [2024-11-19 05:52:51,637 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 146 [2024-11-19 05:52:51,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:52:51,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:52:51,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:52:51,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:52:51,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:51" (1/1) ... [2024-11-19 05:52:51,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:51" (1/1) ... [2024-11-19 05:52:51,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:51" (1/1) ... [2024-11-19 05:52:51,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:51" (1/1) ... [2024-11-19 05:52:51,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:51" (1/1) ... [2024-11-19 05:52:51,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:51" (1/1) ... [2024-11-19 05:52:51,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:51" (1/1) ... [2024-11-19 05:52:51,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:51" (1/1) ... [2024-11-19 05:52:51,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:52:51,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:52:51,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:52:51,682 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:52:51,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:51" (1/1) ... [2024-11-19 05:52:51,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:52:51,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:52:51,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 05:52:51,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 05:52:51,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:52:51,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:52:51,763 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 05:52:51,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:52:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:52:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 05:52:51,764 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 05:52:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:52:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:52:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 05:52:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:52:51,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:52:51,767 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:52:51,912 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:52:51,914 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:52:52,216 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:52:52,219 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:52:52,250 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:52:52,250 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-19 05:52:52,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:52:52 BoogieIcfgContainer [2024-11-19 05:52:52,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:52:52,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:52:52,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:52:52,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:52:52,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:52:50" (1/3) ... [2024-11-19 05:52:52,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af2c7a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:52:52, skipping insertion in model container [2024-11-19 05:52:52,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:51" (2/3) ... [2024-11-19 05:52:52,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af2c7a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:52:52, skipping insertion in model container [2024-11-19 05:52:52,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:52:52" (3/3) ... [2024-11-19 05:52:52,266 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2024-11-19 05:52:52,283 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:52:52,284 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-19 05:52:52,284 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:52:52,375 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 05:52:52,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 197 transitions, 401 flow [2024-11-19 05:52:52,534 INFO L124 PetriNetUnfolderBase]: 19/256 cut-off events. [2024-11-19 05:52:52,534 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:52:52,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 256 events. 19/256 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 620 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 141. Up to 4 conditions per place. [2024-11-19 05:52:52,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 197 transitions, 401 flow [2024-11-19 05:52:52,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 197 transitions, 401 flow [2024-11-19 05:52:52,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:52:52,575 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;@4e768256, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:52:52,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-19 05:52:52,611 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:52:52,611 INFO L124 PetriNetUnfolderBase]: 2/103 cut-off events. [2024-11-19 05:52:52,611 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:52:52,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:52,613 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] [2024-11-19 05:52:52,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:52,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:52,619 INFO L85 PathProgramCache]: Analyzing trace with hash 72201746, now seen corresponding path program 1 times [2024-11-19 05:52:52,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:52,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472815] [2024-11-19 05:52:52,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:52,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:53,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:53,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472815] [2024-11-19 05:52:53,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:53,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:53,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:52:53,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560431187] [2024-11-19 05:52:53,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:53,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:53,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:53,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:53,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:53,197 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 197 [2024-11-19 05:52:53,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 197 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:53,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:53,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 197 [2024-11-19 05:52:53,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:53,358 INFO L124 PetriNetUnfolderBase]: 48/581 cut-off events. [2024-11-19 05:52:53,359 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:52:53,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 581 events. 48/581 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2512 event pairs, 35 based on Foata normal form. 62/588 useless extension candidates. Maximal degree in co-relation 575. Up to 108 conditions per place. [2024-11-19 05:52:53,367 INFO L140 encePairwiseOnDemand]: 182/197 looper letters, 22 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2024-11-19 05:52:53,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 189 transitions, 433 flow [2024-11-19 05:52:53,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:52:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:52:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2024-11-19 05:52:53,385 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9170896785109983 [2024-11-19 05:52:53,389 INFO L175 Difference]: Start difference. First operand has 187 places, 197 transitions, 401 flow. Second operand 3 states and 542 transitions. [2024-11-19 05:52:53,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 189 transitions, 433 flow [2024-11-19 05:52:53,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 189 transitions, 433 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:52:53,398 INFO L231 Difference]: Finished difference. Result has 188 places, 183 transitions, 381 flow [2024-11-19 05:52:53,401 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=381, PETRI_PLACES=188, PETRI_TRANSITIONS=183} [2024-11-19 05:52:53,405 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 1 predicate places. [2024-11-19 05:52:53,405 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 183 transitions, 381 flow [2024-11-19 05:52:53,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:53,406 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:53,407 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:52:53,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:52:53,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:53,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:53,409 INFO L85 PathProgramCache]: Analyzing trace with hash 890096676, now seen corresponding path program 1 times [2024-11-19 05:52:53,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:53,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387225929] [2024-11-19 05:52:53,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:53,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:54,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:54,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387225929] [2024-11-19 05:52:54,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387225929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:54,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:54,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:52:54,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585872009] [2024-11-19 05:52:54,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:54,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:52:54,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:54,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:52:54,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:52:54,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 197 [2024-11-19 05:52:54,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 183 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 155.5) internal successors, (933), 6 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:54,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:54,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 197 [2024-11-19 05:52:54,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:54,546 INFO L124 PetriNetUnfolderBase]: 108/720 cut-off events. [2024-11-19 05:52:54,546 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-19 05:52:54,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 720 events. 108/720 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3829 event pairs, 66 based on Foata normal form. 0/660 useless extension candidates. Maximal degree in co-relation 856. Up to 181 conditions per place. [2024-11-19 05:52:54,552 INFO L140 encePairwiseOnDemand]: 191/197 looper letters, 48 selfloop transitions, 5 changer transitions 0/206 dead transitions. [2024-11-19 05:52:54,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 206 transitions, 533 flow [2024-11-19 05:52:54,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:52:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:52:54,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 978 transitions. [2024-11-19 05:52:54,559 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8274111675126904 [2024-11-19 05:52:54,559 INFO L175 Difference]: Start difference. First operand has 188 places, 183 transitions, 381 flow. Second operand 6 states and 978 transitions. [2024-11-19 05:52:54,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 206 transitions, 533 flow [2024-11-19 05:52:54,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 206 transitions, 529 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:52:54,566 INFO L231 Difference]: Finished difference. Result has 190 places, 182 transitions, 385 flow [2024-11-19 05:52:54,567 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=190, PETRI_TRANSITIONS=182} [2024-11-19 05:52:54,570 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 3 predicate places. [2024-11-19 05:52:54,570 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 182 transitions, 385 flow [2024-11-19 05:52:54,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 155.5) internal successors, (933), 6 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:54,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:54,571 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] [2024-11-19 05:52:54,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:52:54,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:54,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:54,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1147473663, now seen corresponding path program 1 times [2024-11-19 05:52:54,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:54,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328015484] [2024-11-19 05:52:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:54,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:54,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:54,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328015484] [2024-11-19 05:52:54,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328015484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:54,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:54,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:52:54,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59245814] [2024-11-19 05:52:54,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:54,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:54,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:54,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:54,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:54,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 197 [2024-11-19 05:52:54,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 182 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:54,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:54,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 197 [2024-11-19 05:52:54,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:54,810 INFO L124 PetriNetUnfolderBase]: 91/845 cut-off events. [2024-11-19 05:52:54,811 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-19 05:52:54,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 845 events. 91/845 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4683 event pairs, 30 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 962. Up to 125 conditions per place. [2024-11-19 05:52:54,816 INFO L140 encePairwiseOnDemand]: 188/197 looper letters, 30 selfloop transitions, 6 changer transitions 0/195 dead transitions. [2024-11-19 05:52:54,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 195 transitions, 486 flow [2024-11-19 05:52:54,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:52:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:52:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2024-11-19 05:52:54,819 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.883248730964467 [2024-11-19 05:52:54,819 INFO L175 Difference]: Start difference. First operand has 190 places, 182 transitions, 385 flow. Second operand 3 states and 522 transitions. [2024-11-19 05:52:54,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 195 transitions, 486 flow [2024-11-19 05:52:54,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 195 transitions, 476 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:52:54,824 INFO L231 Difference]: Finished difference. Result has 187 places, 184 transitions, 413 flow [2024-11-19 05:52:54,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=413, PETRI_PLACES=187, PETRI_TRANSITIONS=184} [2024-11-19 05:52:54,826 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 0 predicate places. [2024-11-19 05:52:54,827 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 184 transitions, 413 flow [2024-11-19 05:52:54,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:54,828 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:54,828 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] [2024-11-19 05:52:54,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:52:54,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:54,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:54,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1755011909, now seen corresponding path program 1 times [2024-11-19 05:52:54,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:54,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398850899] [2024-11-19 05:52:54,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:54,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:54,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:54,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398850899] [2024-11-19 05:52:54,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398850899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:54,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:54,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:52:54,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702887498] [2024-11-19 05:52:54,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:54,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:54,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:54,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:54,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:54,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 197 [2024-11-19 05:52:54,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 184 transitions, 413 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:54,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:54,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 197 [2024-11-19 05:52:54,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:55,103 INFO L124 PetriNetUnfolderBase]: 94/847 cut-off events. [2024-11-19 05:52:55,104 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-11-19 05:52:55,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 847 events. 94/847 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4785 event pairs, 60 based on Foata normal form. 0/778 useless extension candidates. Maximal degree in co-relation 1062. Up to 189 conditions per place. [2024-11-19 05:52:55,108 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 27 selfloop transitions, 4 changer transitions 0/191 dead transitions. [2024-11-19 05:52:55,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 191 transitions, 493 flow [2024-11-19 05:52:55,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:52:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:52:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2024-11-19 05:52:55,110 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8764805414551607 [2024-11-19 05:52:55,110 INFO L175 Difference]: Start difference. First operand has 187 places, 184 transitions, 413 flow. Second operand 3 states and 518 transitions. [2024-11-19 05:52:55,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 191 transitions, 493 flow [2024-11-19 05:52:55,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 191 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:52:55,114 INFO L231 Difference]: Finished difference. Result has 189 places, 187 transitions, 433 flow [2024-11-19 05:52:55,115 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=189, PETRI_TRANSITIONS=187} [2024-11-19 05:52:55,116 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 2 predicate places. [2024-11-19 05:52:55,116 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 187 transitions, 433 flow [2024-11-19 05:52:55,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:55,117 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:55,117 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] [2024-11-19 05:52:55,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:52:55,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:55,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:55,118 INFO L85 PathProgramCache]: Analyzing trace with hash -524792943, now seen corresponding path program 1 times [2024-11-19 05:52:55,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:55,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070894189] [2024-11-19 05:52:55,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:55,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:52:55,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:52:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:52:55,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:52:55,208 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:52:55,209 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-19 05:52:55,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-19 05:52:55,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-19 05:52:55,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-19 05:52:55,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-19 05:52:55,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-19 05:52:55,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-19 05:52:55,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-19 05:52:55,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-19 05:52:55,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-19 05:52:55,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-19 05:52:55,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-19 05:52:55,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:52:55,215 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-19 05:52:55,218 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 05:52:55,218 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-19 05:52:55,256 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 05:52:55,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 246 transitions, 508 flow [2024-11-19 05:52:55,304 INFO L124 PetriNetUnfolderBase]: 34/392 cut-off events. [2024-11-19 05:52:55,305 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 05:52:55,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 392 events. 34/392 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1173 event pairs, 0 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 258. Up to 8 conditions per place. [2024-11-19 05:52:55,308 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 246 transitions, 508 flow [2024-11-19 05:52:55,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 246 transitions, 508 flow [2024-11-19 05:52:55,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:52:55,318 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;@4e768256, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:52:55,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-19 05:52:55,328 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:52:55,328 INFO L124 PetriNetUnfolderBase]: 2/103 cut-off events. [2024-11-19 05:52:55,328 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:52:55,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:55,329 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] [2024-11-19 05:52:55,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:52:55,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1012236846, now seen corresponding path program 1 times [2024-11-19 05:52:55,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:55,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752018665] [2024-11-19 05:52:55,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:55,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752018665] [2024-11-19 05:52:55,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752018665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:55,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:55,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:52:55,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938157548] [2024-11-19 05:52:55,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:55,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:55,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:55,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:55,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:55,427 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 246 [2024-11-19 05:52:55,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 246 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:55,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:55,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 246 [2024-11-19 05:52:55,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:56,061 INFO L124 PetriNetUnfolderBase]: 788/4355 cut-off events. [2024-11-19 05:52:56,061 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-11-19 05:52:56,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5708 conditions, 4355 events. 788/4355 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 41161 event pairs, 348 based on Foata normal form. 749/4718 useless extension candidates. Maximal degree in co-relation 721. Up to 1303 conditions per place. [2024-11-19 05:52:56,090 INFO L140 encePairwiseOnDemand]: 225/246 looper letters, 31 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2024-11-19 05:52:56,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 233 transitions, 548 flow [2024-11-19 05:52:56,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:52:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:52:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2024-11-19 05:52:56,093 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8970189701897019 [2024-11-19 05:52:56,094 INFO L175 Difference]: Start difference. First operand has 231 places, 246 transitions, 508 flow. Second operand 3 states and 662 transitions. [2024-11-19 05:52:56,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 233 transitions, 548 flow [2024-11-19 05:52:56,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 233 transitions, 548 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:52:56,099 INFO L231 Difference]: Finished difference. Result has 232 places, 227 transitions, 480 flow [2024-11-19 05:52:56,099 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=232, PETRI_TRANSITIONS=227} [2024-11-19 05:52:56,100 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 1 predicate places. [2024-11-19 05:52:56,101 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 227 transitions, 480 flow [2024-11-19 05:52:56,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:56,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:56,102 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] [2024-11-19 05:52:56,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:52:56,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:52:56,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:56,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1873296732, now seen corresponding path program 1 times [2024-11-19 05:52:56,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:56,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625502808] [2024-11-19 05:52:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:56,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:56,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:56,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625502808] [2024-11-19 05:52:56,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625502808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:56,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:56,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:52:56,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535783533] [2024-11-19 05:52:56,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:56,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:52:56,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:56,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:52:56,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:52:56,643 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 246 [2024-11-19 05:52:56,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 227 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 190.5) internal successors, (1143), 6 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:56,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:56,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 246 [2024-11-19 05:52:56,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:57,483 INFO L124 PetriNetUnfolderBase]: 1718/5999 cut-off events. [2024-11-19 05:52:57,483 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-11-19 05:52:57,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9011 conditions, 5999 events. 1718/5999 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 57109 event pairs, 168 based on Foata normal form. 0/5548 useless extension candidates. Maximal degree in co-relation 4233. Up to 2015 conditions per place. [2024-11-19 05:52:57,529 INFO L140 encePairwiseOnDemand]: 240/246 looper letters, 80 selfloop transitions, 6 changer transitions 0/274 dead transitions. [2024-11-19 05:52:57,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 274 transitions, 746 flow [2024-11-19 05:52:57,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:52:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:52:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1220 transitions. [2024-11-19 05:52:57,533 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8265582655826558 [2024-11-19 05:52:57,533 INFO L175 Difference]: Start difference. First operand has 232 places, 227 transitions, 480 flow. Second operand 6 states and 1220 transitions. [2024-11-19 05:52:57,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 274 transitions, 746 flow [2024-11-19 05:52:57,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 274 transitions, 744 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:52:57,540 INFO L231 Difference]: Finished difference. Result has 235 places, 226 transitions, 488 flow [2024-11-19 05:52:57,541 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=235, PETRI_TRANSITIONS=226} [2024-11-19 05:52:57,542 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 4 predicate places. [2024-11-19 05:52:57,542 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 226 transitions, 488 flow [2024-11-19 05:52:57,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 190.5) internal successors, (1143), 6 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:57,543 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:57,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] [2024-11-19 05:52:57,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:52:57,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:52:57,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:57,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1314901924, now seen corresponding path program 1 times [2024-11-19 05:52:57,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:57,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855110897] [2024-11-19 05:52:57,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:57,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:57,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:57,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855110897] [2024-11-19 05:52:57,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855110897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:57,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:57,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:52:57,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115386415] [2024-11-19 05:52:57,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:57,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:57,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:57,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:57,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:57,633 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 246 [2024-11-19 05:52:57,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 226 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:57,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:57,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 246 [2024-11-19 05:52:57,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:59,872 INFO L124 PetriNetUnfolderBase]: 3893/14653 cut-off events. [2024-11-19 05:52:59,873 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2024-11-19 05:52:59,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21204 conditions, 14653 events. 3893/14653 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 164301 event pairs, 1530 based on Foata normal form. 0/13110 useless extension candidates. Maximal degree in co-relation 20044. Up to 3516 conditions per place. [2024-11-19 05:53:00,005 INFO L140 encePairwiseOnDemand]: 227/246 looper letters, 58 selfloop transitions, 14 changer transitions 0/259 dead transitions. [2024-11-19 05:53:00,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 259 transitions, 709 flow [2024-11-19 05:53:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:00,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2024-11-19 05:53:00,008 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8685636856368564 [2024-11-19 05:53:00,008 INFO L175 Difference]: Start difference. First operand has 235 places, 226 transitions, 488 flow. Second operand 3 states and 641 transitions. [2024-11-19 05:53:00,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 259 transitions, 709 flow [2024-11-19 05:53:00,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 259 transitions, 697 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:53:00,019 INFO L231 Difference]: Finished difference. Result has 234 places, 240 transitions, 598 flow [2024-11-19 05:53:00,020 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=234, PETRI_TRANSITIONS=240} [2024-11-19 05:53:00,021 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 3 predicate places. [2024-11-19 05:53:00,022 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 240 transitions, 598 flow [2024-11-19 05:53:00,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:00,023 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:00,023 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] [2024-11-19 05:53:00,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:53:00,023 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:00,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:00,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1424383286, now seen corresponding path program 1 times [2024-11-19 05:53:00,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:00,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080396713] [2024-11-19 05:53:00,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:00,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:00,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:00,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080396713] [2024-11-19 05:53:00,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080396713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:00,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:00,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:00,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000661705] [2024-11-19 05:53:00,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:00,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:00,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:00,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:00,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:00,132 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 246 [2024-11-19 05:53:00,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 240 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:00,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:00,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 246 [2024-11-19 05:53:00,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:02,618 INFO L124 PetriNetUnfolderBase]: 4020/16506 cut-off events. [2024-11-19 05:53:02,618 INFO L125 PetriNetUnfolderBase]: For 4310/4479 co-relation queries the response was YES. [2024-11-19 05:53:02,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27194 conditions, 16506 events. 4020/16506 cut-off events. For 4310/4479 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 194152 event pairs, 2411 based on Foata normal form. 46/15009 useless extension candidates. Maximal degree in co-relation 13739. Up to 5498 conditions per place. [2024-11-19 05:53:02,732 INFO L140 encePairwiseOnDemand]: 237/246 looper letters, 52 selfloop transitions, 14 changer transitions 0/264 dead transitions. [2024-11-19 05:53:02,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 264 transitions, 816 flow [2024-11-19 05:53:02,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2024-11-19 05:53:02,735 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8604336043360433 [2024-11-19 05:53:02,735 INFO L175 Difference]: Start difference. First operand has 234 places, 240 transitions, 598 flow. Second operand 3 states and 635 transitions. [2024-11-19 05:53:02,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 264 transitions, 816 flow [2024-11-19 05:53:02,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 264 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:53:02,755 INFO L231 Difference]: Finished difference. Result has 236 places, 252 transitions, 696 flow [2024-11-19 05:53:02,756 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=236, PETRI_TRANSITIONS=252} [2024-11-19 05:53:02,756 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 5 predicate places. [2024-11-19 05:53:02,757 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 252 transitions, 696 flow [2024-11-19 05:53:02,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:02,757 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:02,757 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] [2024-11-19 05:53:02,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:53:02,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:02,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:02,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1886521457, now seen corresponding path program 1 times [2024-11-19 05:53:02,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:02,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752996142] [2024-11-19 05:53:02,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:02,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:02,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:02,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752996142] [2024-11-19 05:53:02,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752996142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:53:02,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487447610] [2024-11-19 05:53:02,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:02,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:53:02,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:53:02,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:53:02,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 05:53:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:03,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 05:53:03,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:53:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:03,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:53:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:03,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487447610] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:53:03,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:53:03,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 05:53:03,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743919526] [2024-11-19 05:53:03,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:53:03,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 05:53:03,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:03,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 05:53:03,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 05:53:03,242 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 246 [2024-11-19 05:53:03,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 252 transitions, 696 flow. Second operand has 10 states, 10 states have (on average 200.5) internal successors, (2005), 10 states have internal predecessors, (2005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:03,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:03,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 246 [2024-11-19 05:53:03,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:03,988 INFO L124 PetriNetUnfolderBase]: 947/4684 cut-off events. [2024-11-19 05:53:03,989 INFO L125 PetriNetUnfolderBase]: For 902/987 co-relation queries the response was YES. [2024-11-19 05:53:04,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7640 conditions, 4684 events. 947/4684 cut-off events. For 902/987 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 45212 event pairs, 140 based on Foata normal form. 106/4428 useless extension candidates. Maximal degree in co-relation 3404. Up to 577 conditions per place. [2024-11-19 05:53:04,025 INFO L140 encePairwiseOnDemand]: 241/246 looper letters, 72 selfloop transitions, 7 changer transitions 0/259 dead transitions. [2024-11-19 05:53:04,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 259 transitions, 822 flow [2024-11-19 05:53:04,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:53:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 05:53:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1863 transitions. [2024-11-19 05:53:04,031 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8414634146341463 [2024-11-19 05:53:04,031 INFO L175 Difference]: Start difference. First operand has 236 places, 252 transitions, 696 flow. Second operand 9 states and 1863 transitions. [2024-11-19 05:53:04,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 259 transitions, 822 flow [2024-11-19 05:53:04,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 259 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:53:04,042 INFO L231 Difference]: Finished difference. Result has 199 places, 203 transitions, 546 flow [2024-11-19 05:53:04,042 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=546, PETRI_PLACES=199, PETRI_TRANSITIONS=203} [2024-11-19 05:53:04,043 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, -32 predicate places. [2024-11-19 05:53:04,043 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 203 transitions, 546 flow [2024-11-19 05:53:04,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 200.5) internal successors, (2005), 10 states have internal predecessors, (2005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:04,045 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:04,045 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] [2024-11-19 05:53:04,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 05:53:04,246 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-19 05:53:04,247 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:04,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:04,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1179756648, now seen corresponding path program 1 times [2024-11-19 05:53:04,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:04,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560149644] [2024-11-19 05:53:04,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:04,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 05:53:04,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:04,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560149644] [2024-11-19 05:53:04,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560149644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:04,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:04,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:04,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267695859] [2024-11-19 05:53:04,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:04,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:04,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:04,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:04,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:04,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 246 [2024-11-19 05:53:04,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 203 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:04,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:04,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 246 [2024-11-19 05:53:04,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:04,575 INFO L124 PetriNetUnfolderBase]: 260/1344 cut-off events. [2024-11-19 05:53:04,577 INFO L125 PetriNetUnfolderBase]: For 459/480 co-relation queries the response was YES. [2024-11-19 05:53:04,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2389 conditions, 1344 events. 260/1344 cut-off events. For 459/480 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8697 event pairs, 132 based on Foata normal form. 7/1259 useless extension candidates. Maximal degree in co-relation 2262. Up to 459 conditions per place. [2024-11-19 05:53:04,589 INFO L140 encePairwiseOnDemand]: 238/246 looper letters, 42 selfloop transitions, 12 changer transitions 0/217 dead transitions. [2024-11-19 05:53:04,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 217 transitions, 698 flow [2024-11-19 05:53:04,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:04,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 621 transitions. [2024-11-19 05:53:04,591 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8414634146341463 [2024-11-19 05:53:04,592 INFO L175 Difference]: Start difference. First operand has 199 places, 203 transitions, 546 flow. Second operand 3 states and 621 transitions. [2024-11-19 05:53:04,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 217 transitions, 698 flow [2024-11-19 05:53:04,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 217 transitions, 683 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-19 05:53:04,597 INFO L231 Difference]: Finished difference. Result has 198 places, 211 transitions, 629 flow [2024-11-19 05:53:04,598 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=198, PETRI_TRANSITIONS=211} [2024-11-19 05:53:04,598 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, -33 predicate places. [2024-11-19 05:53:04,599 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 211 transitions, 629 flow [2024-11-19 05:53:04,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:04,599 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:04,599 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] [2024-11-19 05:53:04,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:53:04,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:04,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:04,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1561101596, now seen corresponding path program 1 times [2024-11-19 05:53:04,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:04,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371027932] [2024-11-19 05:53:04,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:04,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:04,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:04,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371027932] [2024-11-19 05:53:04,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371027932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:04,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:04,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:04,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300090849] [2024-11-19 05:53:04,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:04,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:04,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:04,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:04,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:04,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 246 [2024-11-19 05:53:04,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 211 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:04,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:04,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 246 [2024-11-19 05:53:04,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:04,875 INFO L124 PetriNetUnfolderBase]: 291/1416 cut-off events. [2024-11-19 05:53:04,876 INFO L125 PetriNetUnfolderBase]: For 1122/1157 co-relation queries the response was YES. [2024-11-19 05:53:04,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2843 conditions, 1416 events. 291/1416 cut-off events. For 1122/1157 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9298 event pairs, 134 based on Foata normal form. 9/1349 useless extension candidates. Maximal degree in co-relation 2719. Up to 501 conditions per place. [2024-11-19 05:53:04,888 INFO L140 encePairwiseOnDemand]: 238/246 looper letters, 49 selfloop transitions, 12 changer transitions 0/226 dead transitions. [2024-11-19 05:53:04,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 226 transitions, 818 flow [2024-11-19 05:53:04,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:04,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2024-11-19 05:53:04,891 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8428184281842819 [2024-11-19 05:53:04,891 INFO L175 Difference]: Start difference. First operand has 198 places, 211 transitions, 629 flow. Second operand 3 states and 622 transitions. [2024-11-19 05:53:04,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 226 transitions, 818 flow [2024-11-19 05:53:04,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 226 transitions, 790 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:53:04,898 INFO L231 Difference]: Finished difference. Result has 200 places, 219 transitions, 715 flow [2024-11-19 05:53:04,899 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=715, PETRI_PLACES=200, PETRI_TRANSITIONS=219} [2024-11-19 05:53:04,899 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, -31 predicate places. [2024-11-19 05:53:04,900 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 219 transitions, 715 flow [2024-11-19 05:53:04,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:04,900 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:04,901 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] [2024-11-19 05:53:04,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:53:04,901 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:04,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:04,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2095314478, now seen corresponding path program 1 times [2024-11-19 05:53:04,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:04,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334473209] [2024-11-19 05:53:04,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:04,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:53:04,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:53:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:53:05,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:53:05,004 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:53:05,004 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-19 05:53:05,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-19 05:53:05,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-19 05:53:05,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-19 05:53:05,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-19 05:53:05,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-19 05:53:05,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-19 05:53:05,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-19 05:53:05,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-19 05:53:05,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-19 05:53:05,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-19 05:53:05,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-19 05:53:05,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-19 05:53:05,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-19 05:53:05,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-19 05:53:05,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-19 05:53:05,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:53:05,008 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:05,008 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 05:53:05,009 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-19 05:53:05,043 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 05:53:05,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 295 transitions, 617 flow [2024-11-19 05:53:05,112 INFO L124 PetriNetUnfolderBase]: 54/573 cut-off events. [2024-11-19 05:53:05,112 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-19 05:53:05,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 573 events. 54/573 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1969 event pairs, 1 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 400. Up to 16 conditions per place. [2024-11-19 05:53:05,119 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 295 transitions, 617 flow [2024-11-19 05:53:05,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 295 transitions, 617 flow [2024-11-19 05:53:05,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:53:05,127 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;@4e768256, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:53:05,129 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-19 05:53:05,134 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:53:05,135 INFO L124 PetriNetUnfolderBase]: 2/103 cut-off events. [2024-11-19 05:53:05,135 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:53:05,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:05,135 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] [2024-11-19 05:53:05,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 05:53:05,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:05,136 INFO L85 PathProgramCache]: Analyzing trace with hash 183986482, now seen corresponding path program 1 times [2024-11-19 05:53:05,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:05,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985690711] [2024-11-19 05:53:05,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:05,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:05,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:05,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985690711] [2024-11-19 05:53:05,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985690711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:05,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:05,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:53:05,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531424372] [2024-11-19 05:53:05,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:05,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:05,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:05,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:05,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:05,220 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 295 [2024-11-19 05:53:05,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 295 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:05,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:05,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 295 [2024-11-19 05:53:05,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:09,940 INFO L124 PetriNetUnfolderBase]: 8948/35399 cut-off events. [2024-11-19 05:53:09,940 INFO L125 PetriNetUnfolderBase]: For 937/937 co-relation queries the response was YES. [2024-11-19 05:53:10,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48637 conditions, 35399 events. 8948/35399 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 457588 event pairs, 8324 based on Foata normal form. 7648/39665 useless extension candidates. Maximal degree in co-relation 35526. Up to 12802 conditions per place. [2024-11-19 05:53:10,203 INFO L140 encePairwiseOnDemand]: 268/295 looper letters, 39 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2024-11-19 05:53:10,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 276 transitions, 661 flow [2024-11-19 05:53:10,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 781 transitions. [2024-11-19 05:53:10,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8824858757062147 [2024-11-19 05:53:10,206 INFO L175 Difference]: Start difference. First operand has 275 places, 295 transitions, 617 flow. Second operand 3 states and 781 transitions. [2024-11-19 05:53:10,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 276 transitions, 661 flow [2024-11-19 05:53:10,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 276 transitions, 661 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:53:10,211 INFO L231 Difference]: Finished difference. Result has 276 places, 270 transitions, 577 flow [2024-11-19 05:53:10,211 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=276, PETRI_TRANSITIONS=270} [2024-11-19 05:53:10,212 INFO L277 CegarLoopForPetriNet]: 275 programPoint places, 1 predicate places. [2024-11-19 05:53:10,212 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 270 transitions, 577 flow [2024-11-19 05:53:10,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:10,213 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:10,213 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] [2024-11-19 05:53:10,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:53:10,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 05:53:10,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:10,213 INFO L85 PathProgramCache]: Analyzing trace with hash 941062884, now seen corresponding path program 1 times [2024-11-19 05:53:10,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:10,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880833604] [2024-11-19 05:53:10,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:10,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:10,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:10,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880833604] [2024-11-19 05:53:10,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880833604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:10,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:10,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:53:10,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409286471] [2024-11-19 05:53:10,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:10,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:53:10,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:10,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:53:10,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:53:10,770 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 295 [2024-11-19 05:53:10,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 270 transitions, 577 flow. Second operand has 6 states, 6 states have (on average 225.5) internal successors, (1353), 6 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:10,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:10,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 295 [2024-11-19 05:53:10,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:19,237 INFO L124 PetriNetUnfolderBase]: 19590/65817 cut-off events. [2024-11-19 05:53:19,237 INFO L125 PetriNetUnfolderBase]: For 1505/1505 co-relation queries the response was YES. [2024-11-19 05:53:19,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94742 conditions, 65817 events. 19590/65817 cut-off events. For 1505/1505 co-relation queries the response was YES. Maximal size of possible extension queue 1358. Compared 890564 event pairs, 7382 based on Foata normal form. 0/60163 useless extension candidates. Maximal degree in co-relation 81487. Up to 20118 conditions per place. [2024-11-19 05:53:19,827 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 112 selfloop transitions, 6 changer transitions 0/341 dead transitions. [2024-11-19 05:53:19,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 341 transitions, 955 flow [2024-11-19 05:53:19,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:53:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:53:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1462 transitions. [2024-11-19 05:53:19,832 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8259887005649718 [2024-11-19 05:53:19,832 INFO L175 Difference]: Start difference. First operand has 276 places, 270 transitions, 577 flow. Second operand 6 states and 1462 transitions. [2024-11-19 05:53:19,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 341 transitions, 955 flow [2024-11-19 05:53:19,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 341 transitions, 953 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:53:19,845 INFO L231 Difference]: Finished difference. Result has 279 places, 269 transitions, 585 flow [2024-11-19 05:53:19,845 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=585, PETRI_PLACES=279, PETRI_TRANSITIONS=269} [2024-11-19 05:53:19,846 INFO L277 CegarLoopForPetriNet]: 275 programPoint places, 4 predicate places. [2024-11-19 05:53:19,846 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 269 transitions, 585 flow [2024-11-19 05:53:19,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.5) internal successors, (1353), 6 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:19,847 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:19,847 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] [2024-11-19 05:53:19,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:53:19,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 05:53:19,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:19,848 INFO L85 PathProgramCache]: Analyzing trace with hash -981041862, now seen corresponding path program 1 times [2024-11-19 05:53:19,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:19,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482742263] [2024-11-19 05:53:19,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:19,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:19,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:19,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482742263] [2024-11-19 05:53:19,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482742263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:19,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:19,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:19,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970911700] [2024-11-19 05:53:19,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:19,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:19,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:19,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:19,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:19,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 295 [2024-11-19 05:53:19,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 269 transitions, 585 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-19 05:53:19,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:19,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 295 [2024-11-19 05:53:19,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand