./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 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_07-cond_racing2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:52:50,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:52:50,983 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:50,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:52:50,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:52:51,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:52:51,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:52:51,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:52:51,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:52:51,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:52:51,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:52:51,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:52:51,030 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:52:51,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:52:51,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:52:51,031 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:52:51,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:52:51,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:52:51,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:52:51,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:52:51,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:52:51,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:52:51,034 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:52:51,035 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:52:51,035 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:52:51,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:52:51,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:52:51,036 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:52:51,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:52:51,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:52:51,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:52:51,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:52:51,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:52:51,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:52:51,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:52:51,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:52:51,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:52:51,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:52:51,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:52:51,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:52:51,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:52:51,041 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef [2024-11-19 05:52:51,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:52:51,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:52:51,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:52:51,340 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:52:51,341 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:52:51,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2024-11-19 05:52:52,870 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:52:53,172 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:52:53,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2024-11-19 05:52:53,198 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6f7a9d01/6a66f9232ae946d592bbd434fc176e38/FLAGd08ebdaae [2024-11-19 05:52:53,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6f7a9d01/6a66f9232ae946d592bbd434fc176e38 [2024-11-19 05:52:53,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:52:53,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:52:53,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:52:53,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:52:53,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:52:53,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:52:53" (1/1) ... [2024-11-19 05:52:53,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd6a370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:53, skipping insertion in model container [2024-11-19 05:52:53,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:52:53" (1/1) ... [2024-11-19 05:52:53,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:52:53,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:52:53,770 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:52:53,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:52:53,898 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:52:53,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:53 WrapperNode [2024-11-19 05:52:53,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:52:53,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:52:53,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:52:53,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:52:53,908 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:53" (1/1) ... [2024-11-19 05:52:53,933 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:53" (1/1) ... [2024-11-19 05:52:53,967 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 157 [2024-11-19 05:52:53,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:52:53,972 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:52:53,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:52:53,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:52:53,982 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:53" (1/1) ... [2024-11-19 05:52:53,982 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:53" (1/1) ... [2024-11-19 05:52:53,986 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:53" (1/1) ... [2024-11-19 05:52:53,991 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:53" (1/1) ... [2024-11-19 05:52:54,006 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:53" (1/1) ... [2024-11-19 05:52:54,013 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:53" (1/1) ... [2024-11-19 05:52:54,019 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:53" (1/1) ... [2024-11-19 05:52:54,020 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:53" (1/1) ... [2024-11-19 05:52:54,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:52:54,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:52:54,032 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:52:54,032 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:52:54,033 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:53" (1/1) ... [2024-11-19 05:52:54,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:52:54,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:52:54,067 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:54,071 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:54,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:52:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:52:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 05:52:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:52:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:52:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 05:52:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:52:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 05:52:54,122 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 05:52:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:52:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:52:54,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:52:54,125 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:54,264 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:52:54,266 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:52:54,675 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:52:54,675 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:52:54,725 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:52:54,725 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-19 05:52:54,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:52:54 BoogieIcfgContainer [2024-11-19 05:52:54,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:52:54,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:52:54,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:52:54,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:52:54,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:52:53" (1/3) ... [2024-11-19 05:52:54,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee3f095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:52:54, skipping insertion in model container [2024-11-19 05:52:54,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:53" (2/3) ... [2024-11-19 05:52:54,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee3f095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:52:54, skipping insertion in model container [2024-11-19 05:52:54,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:52:54" (3/3) ... [2024-11-19 05:52:54,742 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_07-cond_racing2.i [2024-11-19 05:52:54,761 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:52:54,762 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-19 05:52:54,762 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:52:54,856 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 05:52:54,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 211 transitions, 429 flow [2024-11-19 05:52:55,029 INFO L124 PetriNetUnfolderBase]: 25/280 cut-off events. [2024-11-19 05:52:55,029 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:52:55,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 280 events. 25/280 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 677 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 155. Up to 6 conditions per place. [2024-11-19 05:52:55,039 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 211 transitions, 429 flow [2024-11-19 05:52:55,048 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 211 transitions, 429 flow [2024-11-19 05:52:55,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:52:55,069 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;@202f434f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:52:55,070 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-19 05:52:55,099 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:52:55,100 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2024-11-19 05:52:55,100 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:52:55,100 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:55,101 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:52:55,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:55,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:55,109 INFO L85 PathProgramCache]: Analyzing trace with hash -605595689, 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 [358185059] [2024-11-19 05:52:55,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:55,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:56,255 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,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:56,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358185059] [2024-11-19 05:52:56,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358185059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:56,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:56,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:52:56,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586467062] [2024-11-19 05:52:56,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:56,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:52:56,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:56,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:52:56,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:52:56,482 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 211 [2024-11-19 05:52:56,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 211 transitions, 429 flow. Second operand has 6 states, 6 states have (on average 169.5) internal successors, (1017), 6 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:56,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:56,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 211 [2024-11-19 05:52:56,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:56,743 INFO L124 PetriNetUnfolderBase]: 135/895 cut-off events. [2024-11-19 05:52:56,743 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:52:56,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 895 events. 135/895 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5199 event pairs, 60 based on Foata normal form. 106/896 useless extension candidates. Maximal degree in co-relation 989. Up to 198 conditions per place. [2024-11-19 05:52:56,755 INFO L140 encePairwiseOnDemand]: 193/211 looper letters, 48 selfloop transitions, 5 changer transitions 0/220 dead transitions. [2024-11-19 05:52:56,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 220 transitions, 553 flow [2024-11-19 05:52:56,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:52:56,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:52:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1098 transitions. [2024-11-19 05:52:56,779 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8672985781990521 [2024-11-19 05:52:56,784 INFO L175 Difference]: Start difference. First operand has 198 places, 211 transitions, 429 flow. Second operand 6 states and 1098 transitions. [2024-11-19 05:52:56,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 220 transitions, 553 flow [2024-11-19 05:52:56,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 220 transitions, 553 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:52:56,797 INFO L231 Difference]: Finished difference. Result has 200 places, 196 transitions, 409 flow [2024-11-19 05:52:56,799 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=409, PETRI_PLACES=200, PETRI_TRANSITIONS=196} [2024-11-19 05:52:56,803 INFO L277 CegarLoopForPetriNet]: 198 programPoint places, 2 predicate places. [2024-11-19 05:52:56,803 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 196 transitions, 409 flow [2024-11-19 05:52:56,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.5) internal successors, (1017), 6 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:56,804 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:56,805 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:52:56,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:52:56,806 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:56,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:56,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1901146632, now seen corresponding path program 1 times [2024-11-19 05:52:56,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:56,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191249580] [2024-11-19 05:52:56,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:56,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:56,903 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,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:56,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191249580] [2024-11-19 05:52:56,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191249580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:56,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:56,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:52:56,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337144052] [2024-11-19 05:52:56,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:56,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:56,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:56,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:56,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:56,940 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 211 [2024-11-19 05:52:56,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 196 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:56,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:56,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 211 [2024-11-19 05:52:56,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:57,036 INFO L124 PetriNetUnfolderBase]: 57/640 cut-off events. [2024-11-19 05:52:57,036 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-19 05:52:57,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 640 events. 57/640 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2923 event pairs, 25 based on Foata normal form. 1/572 useless extension candidates. Maximal degree in co-relation 634. Up to 96 conditions per place. [2024-11-19 05:52:57,043 INFO L140 encePairwiseOnDemand]: 208/211 looper letters, 22 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2024-11-19 05:52:57,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 202 transitions, 469 flow [2024-11-19 05:52:57,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:52:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:52:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2024-11-19 05:52:57,046 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8925750394944708 [2024-11-19 05:52:57,046 INFO L175 Difference]: Start difference. First operand has 200 places, 196 transitions, 409 flow. Second operand 3 states and 565 transitions. [2024-11-19 05:52:57,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 202 transitions, 469 flow [2024-11-19 05:52:57,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 202 transitions, 459 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:52:57,055 INFO L231 Difference]: Finished difference. Result has 198 places, 196 transitions, 407 flow [2024-11-19 05:52:57,056 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=198, PETRI_TRANSITIONS=196} [2024-11-19 05:52:57,057 INFO L277 CegarLoopForPetriNet]: 198 programPoint places, 0 predicate places. [2024-11-19 05:52:57,057 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 196 transitions, 407 flow [2024-11-19 05:52:57,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:57,058 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:57,058 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:52:57,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:52:57,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:57,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:57,059 INFO L85 PathProgramCache]: Analyzing trace with hash -506205996, now seen corresponding path program 1 times [2024-11-19 05:52:57,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:57,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831811392] [2024-11-19 05:52:57,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:57,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:57,156 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,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:57,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831811392] [2024-11-19 05:52:57,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831811392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:57,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:57,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:52:57,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793279930] [2024-11-19 05:52:57,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:57,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:57,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:57,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:57,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:57,186 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 211 [2024-11-19 05:52:57,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 196 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:57,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:57,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 211 [2024-11-19 05:52:57,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:57,355 INFO L124 PetriNetUnfolderBase]: 134/935 cut-off events. [2024-11-19 05:52:57,356 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-19 05:52:57,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 935 events. 134/935 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5369 event pairs, 33 based on Foata normal form. 0/838 useless extension candidates. Maximal degree in co-relation 1088. Up to 130 conditions per place. [2024-11-19 05:52:57,363 INFO L140 encePairwiseOnDemand]: 202/211 looper letters, 30 selfloop transitions, 6 changer transitions 0/209 dead transitions. [2024-11-19 05:52:57,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 209 transitions, 508 flow [2024-11-19 05:52:57,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:52:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:52:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2024-11-19 05:52:57,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8909952606635071 [2024-11-19 05:52:57,369 INFO L175 Difference]: Start difference. First operand has 198 places, 196 transitions, 407 flow. Second operand 3 states and 564 transitions. [2024-11-19 05:52:57,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 209 transitions, 508 flow [2024-11-19 05:52:57,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 209 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:52:57,375 INFO L231 Difference]: Finished difference. Result has 198 places, 198 transitions, 441 flow [2024-11-19 05:52:57,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=198, PETRI_TRANSITIONS=198} [2024-11-19 05:52:57,377 INFO L277 CegarLoopForPetriNet]: 198 programPoint places, 0 predicate places. [2024-11-19 05:52:57,377 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 198 transitions, 441 flow [2024-11-19 05:52:57,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:57,379 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:57,379 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:52:57,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:52:57,380 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:57,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:57,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1186278216, now seen corresponding path program 1 times [2024-11-19 05:52:57,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:57,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078398513] [2024-11-19 05:52:57,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:57,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:57,454 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,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:57,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078398513] [2024-11-19 05:52:57,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078398513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:57,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:57,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:52:57,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117927953] [2024-11-19 05:52:57,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:57,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:57,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:57,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:57,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:57,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 211 [2024-11-19 05:52:57,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 198 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:57,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:57,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 211 [2024-11-19 05:52:57,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:57,660 INFO L124 PetriNetUnfolderBase]: 139/1017 cut-off events. [2024-11-19 05:52:57,660 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-11-19 05:52:57,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 1017 events. 139/1017 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6283 event pairs, 51 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 1267. Up to 220 conditions per place. [2024-11-19 05:52:57,665 INFO L140 encePairwiseOnDemand]: 206/211 looper letters, 27 selfloop transitions, 4 changer transitions 0/205 dead transitions. [2024-11-19 05:52:57,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 205 transitions, 521 flow [2024-11-19 05:52:57,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:52:57,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:52:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2024-11-19 05:52:57,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8846761453396524 [2024-11-19 05:52:57,668 INFO L175 Difference]: Start difference. First operand has 198 places, 198 transitions, 441 flow. Second operand 3 states and 560 transitions. [2024-11-19 05:52:57,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 205 transitions, 521 flow [2024-11-19 05:52:57,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 205 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:52:57,673 INFO L231 Difference]: Finished difference. Result has 200 places, 201 transitions, 461 flow [2024-11-19 05:52:57,673 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=200, PETRI_TRANSITIONS=201} [2024-11-19 05:52:57,675 INFO L277 CegarLoopForPetriNet]: 198 programPoint places, 2 predicate places. [2024-11-19 05:52:57,675 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 201 transitions, 461 flow [2024-11-19 05:52:57,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:57,675 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:57,677 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:52:57,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:52:57,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:57,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:57,679 INFO L85 PathProgramCache]: Analyzing trace with hash 83373136, now seen corresponding path program 1 times [2024-11-19 05:52:57,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:57,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889224131] [2024-11-19 05:52:57,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:57,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:52:57,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:52:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:52:57,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:52:57,791 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:52:57,792 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-19 05:52:57,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-19 05:52:57,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-19 05:52:57,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-19 05:52:57,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-19 05:52:57,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-19 05:52:57,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-19 05:52:57,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-19 05:52:57,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-19 05:52:57,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-19 05:52:57,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-19 05:52:57,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-19 05:52:57,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:52:57,797 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-19 05:52:57,802 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 05:52:57,802 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-19 05:52:57,834 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 05:52:57,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 260 transitions, 536 flow [2024-11-19 05:52:57,891 INFO L124 PetriNetUnfolderBase]: 43/426 cut-off events. [2024-11-19 05:52:57,892 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 05:52:57,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 426 events. 43/426 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1294 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 282. Up to 9 conditions per place. [2024-11-19 05:52:57,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 260 transitions, 536 flow [2024-11-19 05:52:57,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 242 places, 260 transitions, 536 flow [2024-11-19 05:52:57,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:52:57,906 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;@202f434f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:52:57,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-19 05:52:57,918 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:52:57,919 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2024-11-19 05:52:57,919 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:52:57,919 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:57,920 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:52:57,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:52:57,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:57,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2037411799, now seen corresponding path program 1 times [2024-11-19 05:52:57,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:57,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371724729] [2024-11-19 05:52:57,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:57,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:58,418 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:58,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:58,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371724729] [2024-11-19 05:52:58,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371724729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:58,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:58,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:52:58,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190314423] [2024-11-19 05:52:58,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:58,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:52:58,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:58,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:52:58,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:52:58,522 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 260 [2024-11-19 05:52:58,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 260 transitions, 536 flow. Second operand has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:58,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:58,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 260 [2024-11-19 05:52:58,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:59,637 INFO L124 PetriNetUnfolderBase]: 1710/6555 cut-off events. [2024-11-19 05:52:59,638 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-19 05:52:59,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9270 conditions, 6555 events. 1710/6555 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 64562 event pairs, 168 based on Foata normal form. 1344/7252 useless extension candidates. Maximal degree in co-relation 4690. Up to 1840 conditions per place. [2024-11-19 05:52:59,686 INFO L140 encePairwiseOnDemand]: 236/260 looper letters, 80 selfloop transitions, 5 changer transitions 0/287 dead transitions. [2024-11-19 05:52:59,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 287 transitions, 760 flow [2024-11-19 05:52:59,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:52:59,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:52:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1370 transitions. [2024-11-19 05:52:59,690 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8782051282051282 [2024-11-19 05:52:59,691 INFO L175 Difference]: Start difference. First operand has 242 places, 260 transitions, 536 flow. Second operand 6 states and 1370 transitions. [2024-11-19 05:52:59,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 287 transitions, 760 flow [2024-11-19 05:52:59,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 287 transitions, 760 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:52:59,696 INFO L231 Difference]: Finished difference. Result has 244 places, 239 transitions, 504 flow [2024-11-19 05:52:59,697 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=244, PETRI_TRANSITIONS=239} [2024-11-19 05:52:59,698 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 2 predicate places. [2024-11-19 05:52:59,698 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 239 transitions, 504 flow [2024-11-19 05:52:59,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:59,699 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:59,700 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:52:59,700 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:52:59,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash -296614280, now seen corresponding path program 1 times [2024-11-19 05:52:59,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:59,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052052392] [2024-11-19 05:52:59,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:59,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:59,757 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:59,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:59,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052052392] [2024-11-19 05:52:59,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052052392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:59,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:59,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:52:59,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64407904] [2024-11-19 05:52:59,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:59,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:59,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:59,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:59,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:59,783 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 260 [2024-11-19 05:52:59,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 239 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:59,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:59,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 260 [2024-11-19 05:52:59,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:00,599 INFO L124 PetriNetUnfolderBase]: 938/4718 cut-off events. [2024-11-19 05:53:00,600 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2024-11-19 05:53:00,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6302 conditions, 4718 events. 938/4718 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 44976 event pairs, 334 based on Foata normal form. 1/4238 useless extension candidates. Maximal degree in co-relation 810. Up to 1404 conditions per place. [2024-11-19 05:53:00,637 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 31 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2024-11-19 05:53:00,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 246 transitions, 586 flow [2024-11-19 05:53:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2024-11-19 05:53:00,640 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8705128205128205 [2024-11-19 05:53:00,640 INFO L175 Difference]: Start difference. First operand has 244 places, 239 transitions, 504 flow. Second operand 3 states and 679 transitions. [2024-11-19 05:53:00,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 246 transitions, 586 flow [2024-11-19 05:53:00,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 246 transitions, 574 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:53:00,647 INFO L231 Difference]: Finished difference. Result has 242 places, 240 transitions, 506 flow [2024-11-19 05:53:00,648 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=242, PETRI_TRANSITIONS=240} [2024-11-19 05:53:00,649 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 0 predicate places. [2024-11-19 05:53:00,650 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 240 transitions, 506 flow [2024-11-19 05:53:00,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:00,651 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:00,651 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:00,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:53:00,652 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:00,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:00,652 INFO L85 PathProgramCache]: Analyzing trace with hash 605204743, now seen corresponding path program 1 times [2024-11-19 05:53:00,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:00,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807233898] [2024-11-19 05:53:00,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:00,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:00,705 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,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:00,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807233898] [2024-11-19 05:53:00,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807233898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:00,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:00,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:00,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552960640] [2024-11-19 05:53:00,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:00,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:00,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:00,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:00,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:00,749 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 260 [2024-11-19 05:53:00,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 240 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:00,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:00,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 260 [2024-11-19 05:53:00,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:03,176 INFO L124 PetriNetUnfolderBase]: 4720/15525 cut-off events. [2024-11-19 05:53:03,176 INFO L125 PetriNetUnfolderBase]: For 453/453 co-relation queries the response was YES. [2024-11-19 05:53:03,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22832 conditions, 15525 events. 4720/15525 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 173621 event pairs, 1586 based on Foata normal form. 0/13732 useless extension candidates. Maximal degree in co-relation 22721. Up to 3665 conditions per place. [2024-11-19 05:53:03,320 INFO L140 encePairwiseOnDemand]: 241/260 looper letters, 58 selfloop transitions, 14 changer transitions 0/273 dead transitions. [2024-11-19 05:53:03,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 273 transitions, 727 flow [2024-11-19 05:53:03,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2024-11-19 05:53:03,323 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8756410256410256 [2024-11-19 05:53:03,323 INFO L175 Difference]: Start difference. First operand has 242 places, 240 transitions, 506 flow. Second operand 3 states and 683 transitions. [2024-11-19 05:53:03,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 273 transitions, 727 flow [2024-11-19 05:53:03,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 273 transitions, 725 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:53:03,329 INFO L231 Difference]: Finished difference. Result has 245 places, 254 transitions, 626 flow [2024-11-19 05:53:03,330 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=245, PETRI_TRANSITIONS=254} [2024-11-19 05:53:03,331 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 3 predicate places. [2024-11-19 05:53:03,331 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 254 transitions, 626 flow [2024-11-19 05:53:03,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:03,332 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:03,332 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:03,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:53:03,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:03,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:03,333 INFO L85 PathProgramCache]: Analyzing trace with hash -589679511, now seen corresponding path program 1 times [2024-11-19 05:53:03,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:03,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595618168] [2024-11-19 05:53:03,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:03,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:03,384 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:03,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:03,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595618168] [2024-11-19 05:53:03,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595618168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:03,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:03,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:03,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577299121] [2024-11-19 05:53:03,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:03,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:03,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:03,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:03,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:03,434 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 260 [2024-11-19 05:53:03,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 254 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:03,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:03,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 260 [2024-11-19 05:53:03,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:06,010 INFO L124 PetriNetUnfolderBase]: 4870/17918 cut-off events. [2024-11-19 05:53:06,010 INFO L125 PetriNetUnfolderBase]: For 4444/4604 co-relation queries the response was YES. [2024-11-19 05:53:06,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29422 conditions, 17918 events. 4870/17918 cut-off events. For 4444/4604 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 213661 event pairs, 2423 based on Foata normal form. 47/16111 useless extension candidates. Maximal degree in co-relation 27913. Up to 6155 conditions per place. [2024-11-19 05:53:06,268 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 52 selfloop transitions, 14 changer transitions 0/278 dead transitions. [2024-11-19 05:53:06,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 278 transitions, 844 flow [2024-11-19 05:53:06,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:06,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 677 transitions. [2024-11-19 05:53:06,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.867948717948718 [2024-11-19 05:53:06,273 INFO L175 Difference]: Start difference. First operand has 245 places, 254 transitions, 626 flow. Second operand 3 states and 677 transitions. [2024-11-19 05:53:06,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 278 transitions, 844 flow [2024-11-19 05:53:06,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 278 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:53:06,293 INFO L231 Difference]: Finished difference. Result has 247 places, 266 transitions, 724 flow [2024-11-19 05:53:06,294 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=247, PETRI_TRANSITIONS=266} [2024-11-19 05:53:06,294 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 5 predicate places. [2024-11-19 05:53:06,295 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 266 transitions, 724 flow [2024-11-19 05:53:06,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:06,296 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:06,297 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:06,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:53:06,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:06,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:06,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2042612567, now seen corresponding path program 1 times [2024-11-19 05:53:06,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:06,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497235242] [2024-11-19 05:53:06,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:06,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:06,416 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:06,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:06,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497235242] [2024-11-19 05:53:06,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497235242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:53:06,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550552236] [2024-11-19 05:53:06,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:06,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:53:06,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:53:06,419 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:06,421 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:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:06,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 05:53:06,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:53:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:53:06,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:53:06,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550552236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:06,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:53:06,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-19 05:53:06,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553310617] [2024-11-19 05:53:06,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:06,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:06,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:06,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:06,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:53:06,639 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 260 [2024-11-19 05:53:06,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 266 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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:06,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:06,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 260 [2024-11-19 05:53:06,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:10,389 INFO L124 PetriNetUnfolderBase]: 5785/28598 cut-off events. [2024-11-19 05:53:10,389 INFO L125 PetriNetUnfolderBase]: For 3113/4774 co-relation queries the response was YES. [2024-11-19 05:53:10,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42180 conditions, 28598 events. 5785/28598 cut-off events. For 3113/4774 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 390318 event pairs, 2168 based on Foata normal form. 123/25741 useless extension candidates. Maximal degree in co-relation 39840. Up to 3472 conditions per place. [2024-11-19 05:53:10,589 INFO L140 encePairwiseOnDemand]: 256/260 looper letters, 42 selfloop transitions, 3 changer transitions 0/285 dead transitions. [2024-11-19 05:53:10,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 285 transitions, 858 flow [2024-11-19 05:53:10,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2024-11-19 05:53:10,591 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8858974358974359 [2024-11-19 05:53:10,591 INFO L175 Difference]: Start difference. First operand has 247 places, 266 transitions, 724 flow. Second operand 3 states and 691 transitions. [2024-11-19 05:53:10,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 285 transitions, 858 flow [2024-11-19 05:53:10,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 285 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:53:10,616 INFO L231 Difference]: Finished difference. Result has 249 places, 268 transitions, 718 flow [2024-11-19 05:53:10,616 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=718, PETRI_PLACES=249, PETRI_TRANSITIONS=268} [2024-11-19 05:53:10,617 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 7 predicate places. [2024-11-19 05:53:10,617 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 268 transitions, 718 flow [2024-11-19 05:53:10,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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,618 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:10,618 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:10,638 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:10,819 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:10,820 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:10,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:10,821 INFO L85 PathProgramCache]: Analyzing trace with hash -192456045, now seen corresponding path program 1 times [2024-11-19 05:53:10,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:10,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144446570] [2024-11-19 05:53:10,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:10,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:10,941 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:10,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:10,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144446570] [2024-11-19 05:53:10,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144446570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:53:10,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815768384] [2024-11-19 05:53:10,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:10,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:53:10,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:53:10,945 INFO L229 MonitoredProcess]: Starting monitored process 3 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:10,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 05:53:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:11,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 05:53:11,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:53:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:53:11,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:53:11,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815768384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:11,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:53:11,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-19 05:53:11,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434516443] [2024-11-19 05:53:11,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:11,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:11,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:11,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:11,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:53:11,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 260 [2024-11-19 05:53:11,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 268 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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:11,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:11,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 260 [2024-11-19 05:53:11,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:14,360 INFO L124 PetriNetUnfolderBase]: 6115/29136 cut-off events. [2024-11-19 05:53:14,360 INFO L125 PetriNetUnfolderBase]: For 5727/6149 co-relation queries the response was YES. [2024-11-19 05:53:14,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45034 conditions, 29136 events. 6115/29136 cut-off events. For 5727/6149 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 391575 event pairs, 3054 based on Foata normal form. 130/25992 useless extension candidates. Maximal degree in co-relation 42646. Up to 6042 conditions per place. [2024-11-19 05:53:14,732 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 42 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2024-11-19 05:53:14,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 284 transitions, 846 flow [2024-11-19 05:53:14,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:14,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2024-11-19 05:53:14,734 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.882051282051282 [2024-11-19 05:53:14,735 INFO L175 Difference]: Start difference. First operand has 249 places, 268 transitions, 718 flow. Second operand 3 states and 688 transitions. [2024-11-19 05:53:14,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 284 transitions, 846 flow [2024-11-19 05:53:14,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 284 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:53:14,757 INFO L231 Difference]: Finished difference. Result has 250 places, 269 transitions, 726 flow [2024-11-19 05:53:14,758 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=250, PETRI_TRANSITIONS=269} [2024-11-19 05:53:14,758 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 8 predicate places. [2024-11-19 05:53:14,758 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 269 transitions, 726 flow [2024-11-19 05:53:14,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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:14,759 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:14,759 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:14,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 05:53:14,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-19 05:53:14,961 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:14,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash 551411013, now seen corresponding path program 1 times [2024-11-19 05:53:14,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:14,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643689856] [2024-11-19 05:53:14,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:14,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:15,072 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:15,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:15,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643689856] [2024-11-19 05:53:15,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643689856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:53:15,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775054994] [2024-11-19 05:53:15,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:15,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:53:15,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:53:15,075 INFO L229 MonitoredProcess]: Starting monitored process 4 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:15,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 05:53:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:15,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 05:53:15,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:53:15,268 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:15,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:53:15,323 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:15,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775054994] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:53:15,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:53:15,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 05:53:15,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115227353] [2024-11-19 05:53:15,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:53:15,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 05:53:15,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:15,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 05:53:15,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 05:53:15,396 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 260 [2024-11-19 05:53:15,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 269 transitions, 726 flow. Second operand has 10 states, 10 states have (on average 214.3) internal successors, (2143), 10 states have internal predecessors, (2143), 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:15,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:15,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 260 [2024-11-19 05:53:15,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:15,914 INFO L124 PetriNetUnfolderBase]: 754/3735 cut-off events. [2024-11-19 05:53:15,915 INFO L125 PetriNetUnfolderBase]: For 350/384 co-relation queries the response was YES. [2024-11-19 05:53:15,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5638 conditions, 3735 events. 754/3735 cut-off events. For 350/384 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 33823 event pairs, 64 based on Foata normal form. 108/3588 useless extension candidates. Maximal degree in co-relation 5628. Up to 470 conditions per place. [2024-11-19 05:53:15,944 INFO L140 encePairwiseOnDemand]: 255/260 looper letters, 72 selfloop transitions, 7 changer transitions 0/263 dead transitions. [2024-11-19 05:53:15,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 263 transitions, 810 flow [2024-11-19 05:53:15,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:53:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 05:53:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1989 transitions. [2024-11-19 05:53:15,950 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.85 [2024-11-19 05:53:15,950 INFO L175 Difference]: Start difference. First operand has 250 places, 269 transitions, 726 flow. Second operand 9 states and 1989 transitions. [2024-11-19 05:53:15,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 263 transitions, 810 flow [2024-11-19 05:53:15,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 263 transitions, 810 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:53:15,956 INFO L231 Difference]: Finished difference. Result has 206 places, 207 transitions, 554 flow [2024-11-19 05:53:15,957 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=554, PETRI_PLACES=206, PETRI_TRANSITIONS=207} [2024-11-19 05:53:15,958 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -36 predicate places. [2024-11-19 05:53:15,958 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 207 transitions, 554 flow [2024-11-19 05:53:15,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 214.3) internal successors, (2143), 10 states have internal predecessors, (2143), 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:15,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:15,960 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:15,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 05:53:16,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:53:16,161 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:16,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:16,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2083425951, now seen corresponding path program 1 times [2024-11-19 05:53:16,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:16,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109270327] [2024-11-19 05:53:16,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:16,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:16,225 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:16,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:16,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109270327] [2024-11-19 05:53:16,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109270327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:16,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:16,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:16,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174371597] [2024-11-19 05:53:16,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:16,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:16,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:16,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:16,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:16,270 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 260 [2024-11-19 05:53:16,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 207 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:16,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:16,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 260 [2024-11-19 05:53:16,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:16,558 INFO L124 PetriNetUnfolderBase]: 260/1348 cut-off events. [2024-11-19 05:53:16,559 INFO L125 PetriNetUnfolderBase]: For 451/472 co-relation queries the response was YES. [2024-11-19 05:53:16,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2396 conditions, 1348 events. 260/1348 cut-off events. For 451/472 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8695 event pairs, 132 based on Foata normal form. 7/1263 useless extension candidates. Maximal degree in co-relation 2385. Up to 459 conditions per place. [2024-11-19 05:53:16,567 INFO L140 encePairwiseOnDemand]: 252/260 looper letters, 42 selfloop transitions, 12 changer transitions 0/221 dead transitions. [2024-11-19 05:53:16,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 221 transitions, 706 flow [2024-11-19 05:53:16,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:16,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2024-11-19 05:53:16,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.85 [2024-11-19 05:53:16,570 INFO L175 Difference]: Start difference. First operand has 206 places, 207 transitions, 554 flow. Second operand 3 states and 663 transitions. [2024-11-19 05:53:16,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 221 transitions, 706 flow [2024-11-19 05:53:16,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 221 transitions, 691 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-19 05:53:16,577 INFO L231 Difference]: Finished difference. Result has 205 places, 215 transitions, 637 flow [2024-11-19 05:53:16,577 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=637, PETRI_PLACES=205, PETRI_TRANSITIONS=215} [2024-11-19 05:53:16,578 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -37 predicate places. [2024-11-19 05:53:16,578 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 215 transitions, 637 flow [2024-11-19 05:53:16,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:16,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:16,579 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:16,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:53:16,580 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:16,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:16,581 INFO L85 PathProgramCache]: Analyzing trace with hash 770767895, now seen corresponding path program 1 times [2024-11-19 05:53:16,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:16,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912525995] [2024-11-19 05:53:16,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:16,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:16,641 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:16,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:16,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912525995] [2024-11-19 05:53:16,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912525995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:16,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:16,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:16,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616319028] [2024-11-19 05:53:16,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:16,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:16,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:16,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:16,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:16,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 260 [2024-11-19 05:53:16,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 215 transitions, 637 flow. Second operand has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:16,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:16,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 260 [2024-11-19 05:53:16,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:16,934 INFO L124 PetriNetUnfolderBase]: 291/1420 cut-off events. [2024-11-19 05:53:16,935 INFO L125 PetriNetUnfolderBase]: For 1126/1161 co-relation queries the response was YES. [2024-11-19 05:53:16,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 1420 events. 291/1420 cut-off events. For 1126/1161 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9373 event pairs, 134 based on Foata normal form. 9/1353 useless extension candidates. Maximal degree in co-relation 2839. Up to 501 conditions per place. [2024-11-19 05:53:16,952 INFO L140 encePairwiseOnDemand]: 252/260 looper letters, 49 selfloop transitions, 12 changer transitions 0/230 dead transitions. [2024-11-19 05:53:16,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 230 transitions, 826 flow [2024-11-19 05:53:16,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2024-11-19 05:53:16,955 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2024-11-19 05:53:16,956 INFO L175 Difference]: Start difference. First operand has 205 places, 215 transitions, 637 flow. Second operand 3 states and 664 transitions. [2024-11-19 05:53:16,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 230 transitions, 826 flow [2024-11-19 05:53:16,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 230 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:53:16,964 INFO L231 Difference]: Finished difference. Result has 207 places, 223 transitions, 723 flow [2024-11-19 05:53:16,964 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=207, PETRI_TRANSITIONS=223} [2024-11-19 05:53:16,965 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -35 predicate places. [2024-11-19 05:53:16,966 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 223 transitions, 723 flow [2024-11-19 05:53:16,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:16,967 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:16,967 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:16,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:53:16,967 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:16,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:16,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1549554953, now seen corresponding path program 1 times [2024-11-19 05:53:16,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:16,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26789223] [2024-11-19 05:53:16,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:16,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:53:17,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:53:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:53:17,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:53:17,055 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:53:17,056 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-19 05:53:17,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-19 05:53:17,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-19 05:53:17,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-19 05:53:17,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-19 05:53:17,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-19 05:53:17,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-19 05:53:17,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-19 05:53:17,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-19 05:53:17,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-19 05:53:17,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-19 05:53:17,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-19 05:53:17,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-19 05:53:17,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-19 05:53:17,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-19 05:53:17,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-19 05:53:17,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:53:17,060 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:17,061 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 05:53:17,062 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-19 05:53:17,102 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 05:53:17,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 309 transitions, 645 flow [2024-11-19 05:53:17,223 INFO L124 PetriNetUnfolderBase]: 66/617 cut-off events. [2024-11-19 05:53:17,223 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-19 05:53:17,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 617 events. 66/617 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2145 event pairs, 1 based on Foata normal form. 0/519 useless extension candidates. Maximal degree in co-relation 434. Up to 16 conditions per place. [2024-11-19 05:53:17,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 309 transitions, 645 flow [2024-11-19 05:53:17,242 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 309 transitions, 645 flow [2024-11-19 05:53:17,243 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:53:17,243 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;@202f434f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:53:17,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-19 05:53:17,253 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:53:17,254 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2024-11-19 05:53:17,254 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:53:17,254 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:17,254 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:17,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 05:53:17,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:17,255 INFO L85 PathProgramCache]: Analyzing trace with hash -883986985, now seen corresponding path program 1 times [2024-11-19 05:53:17,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:17,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86314991] [2024-11-19 05:53:17,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:17,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:17,654 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:17,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:17,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86314991] [2024-11-19 05:53:17,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86314991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:17,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:17,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:53:17,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792199138] [2024-11-19 05:53:17,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:17,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:53:17,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:17,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:53:17,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:53:17,761 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 309 [2024-11-19 05:53:17,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 309 transitions, 645 flow. Second operand has 6 states, 6 states have (on average 239.5) internal successors, (1437), 6 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:17,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:17,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 309 [2024-11-19 05:53:17,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:26,457 INFO L124 PetriNetUnfolderBase]: 20344/68962 cut-off events. [2024-11-19 05:53:26,458 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2024-11-19 05:53:26,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97569 conditions, 68962 events. 20344/68962 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 1524. Compared 949215 event pairs, 6970 based on Foata normal form. 14560/76720 useless extension candidates. Maximal degree in co-relation 11497. Up to 20303 conditions per place. [2024-11-19 05:53:26,966 INFO L140 encePairwiseOnDemand]: 279/309 looper letters, 112 selfloop transitions, 5 changer transitions 0/354 dead transitions. [2024-11-19 05:53:26,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 354 transitions, 969 flow [2024-11-19 05:53:26,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:53:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:53:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1642 transitions. [2024-11-19 05:53:26,970 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8856526429341963 [2024-11-19 05:53:26,970 INFO L175 Difference]: Start difference. First operand has 286 places, 309 transitions, 645 flow. Second operand 6 states and 1642 transitions. [2024-11-19 05:53:26,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 354 transitions, 969 flow [2024-11-19 05:53:26,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 354 transitions, 969 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:53:26,978 INFO L231 Difference]: Finished difference. Result has 288 places, 282 transitions, 601 flow [2024-11-19 05:53:26,979 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=601, PETRI_PLACES=288, PETRI_TRANSITIONS=282} [2024-11-19 05:53:26,980 INFO L277 CegarLoopForPetriNet]: 286 programPoint places, 2 predicate places. [2024-11-19 05:53:26,980 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 282 transitions, 601 flow [2024-11-19 05:53:26,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.5) internal successors, (1437), 6 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:26,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:26,981 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:26,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:53:26,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 05:53:26,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:26,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1147775768, now seen corresponding path program 1 times [2024-11-19 05:53:26,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:26,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992448851] [2024-11-19 05:53:26,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:26,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:27,022 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:27,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:27,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992448851] [2024-11-19 05:53:27,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992448851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:27,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:27,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:53:27,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106533985] [2024-11-19 05:53:27,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:27,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:27,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:27,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:27,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:27,045 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 309 [2024-11-19 05:53:27,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 282 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:27,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:27,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 309 [2024-11-19 05:53:27,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:32,298 INFO L124 PetriNetUnfolderBase]: 10246/37004 cut-off events. [2024-11-19 05:53:32,299 INFO L125 PetriNetUnfolderBase]: For 1825/1825 co-relation queries the response was YES. [2024-11-19 05:53:32,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52095 conditions, 37004 events. 10246/37004 cut-off events. For 1825/1825 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 477034 event pairs, 5617 based on Foata normal form. 1/33441 useless extension candidates. Maximal degree in co-relation 6794. Up to 14009 conditions per place. [2024-11-19 05:53:32,603 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 39 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2024-11-19 05:53:32,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 289 transitions, 699 flow [2024-11-19 05:53:32,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2024-11-19 05:53:32,606 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8543689320388349 [2024-11-19 05:53:32,606 INFO L175 Difference]: Start difference. First operand has 288 places, 282 transitions, 601 flow. Second operand 3 states and 792 transitions. [2024-11-19 05:53:32,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 289 transitions, 699 flow [2024-11-19 05:53:32,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 289 transitions, 687 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:53:32,613 INFO L231 Difference]: Finished difference. Result has 286 places, 283 transitions, 603 flow [2024-11-19 05:53:32,614 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=286, PETRI_TRANSITIONS=283} [2024-11-19 05:53:32,614 INFO L277 CegarLoopForPetriNet]: 286 programPoint places, 0 predicate places. [2024-11-19 05:53:32,614 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 283 transitions, 603 flow [2024-11-19 05:53:32,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.66666666666666) internal successors, (755), 3 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:32,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:32,615 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:32,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:53:32,616 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 05:53:32,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:32,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1377695253, now seen corresponding path program 1 times [2024-11-19 05:53:32,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:32,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874368554] [2024-11-19 05:53:32,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:32,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:32,672 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:32,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:32,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874368554] [2024-11-19 05:53:32,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874368554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:32,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:32,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:32,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719962283] [2024-11-19 05:53:32,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:32,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:32,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:32,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:32,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:32,725 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 309 [2024-11-19 05:53:32,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 283 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:32,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:32,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 309 [2024-11-19 05:53:32,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand