./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.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 1bf1a57452cb04c4e0acc7059a368e9894233cf719b7dca68f11bd8477a0c6ed --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:28:10,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:28:10,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:28:10,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:28:10,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:28:10,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:28:10,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:28:10,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:28:10,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:28:10,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:28:10,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:28:10,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:28:10,462 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:28:10,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:28:10,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:28:10,464 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:28:10,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:28:10,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:28:10,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:28:10,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:28:10,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:28:10,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:28:10,468 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:28:10,468 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:28:10,468 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:28:10,468 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:28:10,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:28:10,468 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:28:10,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:28:10,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:28:10,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:28:10,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:28:10,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:28:10,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:28:10,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:28:10,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:28:10,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:28:10,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:28:10,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:28:10,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:28:10,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:28:10,471 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 -> 1bf1a57452cb04c4e0acc7059a368e9894233cf719b7dca68f11bd8477a0c6ed [2024-11-12 12:28:10,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:28:10,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:28:10,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:28:10,717 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:28:10,717 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:28:10,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.i [2024-11-12 12:28:11,923 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:28:12,123 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:28:12,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.i [2024-11-12 12:28:12,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9c6a34b8/7ef820f7f0214671bc63cba26ed69f09/FLAGa35c00bee [2024-11-12 12:28:12,163 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9c6a34b8/7ef820f7f0214671bc63cba26ed69f09 [2024-11-12 12:28:12,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:28:12,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:28:12,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:28:12,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:28:12,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:28:12,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:28:12" (1/1) ... [2024-11-12 12:28:12,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f860c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:28:12, skipping insertion in model container [2024-11-12 12:28:12,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:28:12" (1/1) ... [2024-11-12 12:28:12,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:28:12,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:28:12,669 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:28:12,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:28:12,788 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:28:12,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:28:12 WrapperNode [2024-11-12 12:28:12,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:28:12,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:28:12,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:28:12,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:28:12,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:28:12" (1/1) ... [2024-11-12 12:28:12,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:28:12" (1/1) ... [2024-11-12 12:28:12,834 INFO L138 Inliner]: procedures = 365, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2024-11-12 12:28:12,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:28:12,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:28:12,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:28:12,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:28:12,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:28:12" (1/1) ... [2024-11-12 12:28:12,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:28:12" (1/1) ... [2024-11-12 12:28:12,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:28:12" (1/1) ... [2024-11-12 12:28:12,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:28:12" (1/1) ... [2024-11-12 12:28:12,863 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:28:12" (1/1) ... [2024-11-12 12:28:12,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:28:12" (1/1) ... [2024-11-12 12:28:12,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:28:12" (1/1) ... [2024-11-12 12:28:12,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:28:12" (1/1) ... [2024-11-12 12:28:12,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:28:12,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:28:12,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:28:12,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:28:12,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:28:12" (1/1) ... [2024-11-12 12:28:12,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:28:12,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:28:12,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:28:12,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 12:28:12,942 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-12 12:28:12,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:28:12,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:28:12,943 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-12 12:28:12,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:28:12,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:28:12,943 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-12 12:28:12,944 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-12 12:28:12,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:28:12,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:28:12,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:28:12,945 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:28:13,056 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:28:13,058 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:28:13,198 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:28:13,198 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:28:13,215 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:28:13,216 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 12:28:13,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:28:13 BoogieIcfgContainer [2024-11-12 12:28:13,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:28:13,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:28:13,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:28:13,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:28:13,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:28:12" (1/3) ... [2024-11-12 12:28:13,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bcdaf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:28:13, skipping insertion in model container [2024-11-12 12:28:13,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:28:12" (2/3) ... [2024-11-12 12:28:13,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bcdaf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:28:13, skipping insertion in model container [2024-11-12 12:28:13,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:28:13" (3/3) ... [2024-11-12 12:28:13,222 INFO L112 eAbstractionObserver]: Analyzing ICFG 02-base_25-malloc_race_cp.i [2024-11-12 12:28:13,235 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:28:13,235 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-12 12:28:13,235 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:28:13,283 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-12 12:28:13,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 104 transitions, 212 flow [2024-11-12 12:28:13,342 INFO L124 PetriNetUnfolderBase]: 0/103 cut-off events. [2024-11-12 12:28:13,342 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:28:13,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 103 events. 0/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-11-12 12:28:13,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 104 transitions, 212 flow [2024-11-12 12:28:13,348 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 103 transitions, 209 flow [2024-11-12 12:28:13,358 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:28:13,364 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;@75a9b931, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:28:13,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-12 12:28:13,373 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:28:13,373 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2024-11-12 12:28:13,374 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:28:13,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:28:13,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:28:13,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-12 12:28:13,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:28:13,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2046640981, now seen corresponding path program 1 times [2024-11-12 12:28:13,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:28:13,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576357317] [2024-11-12 12:28:13,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:28:13,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:28:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:28:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:28:13,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:28:13,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576357317] [2024-11-12 12:28:13,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576357317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:28:13,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:28:13,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:28:13,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996296526] [2024-11-12 12:28:13,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:28:13,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:28:13,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:28:13,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:28:13,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:28:13,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2024-11-12 12:28:13,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 103 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:13,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:28:13,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2024-11-12 12:28:13,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:28:13,706 INFO L124 PetriNetUnfolderBase]: 12/234 cut-off events. [2024-11-12 12:28:13,706 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:28:13,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 234 events. 12/234 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 664 event pairs, 12 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 227. Up to 36 conditions per place. [2024-11-12 12:28:13,711 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 11 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2024-11-12 12:28:13,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 102 transitions, 233 flow [2024-11-12 12:28:13,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:28:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:28:13,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2024-11-12 12:28:13,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9102564102564102 [2024-11-12 12:28:13,727 INFO L175 Difference]: Start difference. First operand has 107 places, 103 transitions, 209 flow. Second operand 3 states and 284 transitions. [2024-11-12 12:28:13,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 102 transitions, 233 flow [2024-11-12 12:28:13,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 102 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:28:13,736 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 210 flow [2024-11-12 12:28:13,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2024-11-12 12:28:13,743 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 0 predicate places. [2024-11-12 12:28:13,743 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 210 flow [2024-11-12 12:28:13,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:13,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:28:13,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:28:13,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:28:13,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-12 12:28:13,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:28:13,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1419190674, now seen corresponding path program 1 times [2024-11-12 12:28:13,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:28:13,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846235167] [2024-11-12 12:28:13,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:28:13,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:28:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:28:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:28:13,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:28:13,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846235167] [2024-11-12 12:28:13,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846235167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:28:13,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:28:13,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:28:13,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068549637] [2024-11-12 12:28:13,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:28:13,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:28:13,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:28:13,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:28:13,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:28:13,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2024-11-12 12:28:13,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:13,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:28:13,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2024-11-12 12:28:13,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:28:13,900 INFO L124 PetriNetUnfolderBase]: 9/200 cut-off events. [2024-11-12 12:28:13,900 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:28:13,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 200 events. 9/200 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 514 event pairs, 9 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 210. Up to 30 conditions per place. [2024-11-12 12:28:13,902 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 11 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-11-12 12:28:13,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 101 transitions, 234 flow [2024-11-12 12:28:13,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:28:13,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:28:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2024-11-12 12:28:13,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9102564102564102 [2024-11-12 12:28:13,906 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 210 flow. Second operand 3 states and 284 transitions. [2024-11-12 12:28:13,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 101 transitions, 234 flow [2024-11-12 12:28:13,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 101 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:28:13,909 INFO L231 Difference]: Finished difference. Result has 106 places, 101 transitions, 208 flow [2024-11-12 12:28:13,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=106, PETRI_TRANSITIONS=101} [2024-11-12 12:28:13,910 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -1 predicate places. [2024-11-12 12:28:13,910 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 101 transitions, 208 flow [2024-11-12 12:28:13,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:13,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:28:13,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:28:13,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:28:13,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-12 12:28:13,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:28:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash 177711188, now seen corresponding path program 1 times [2024-11-12 12:28:13,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:28:13,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6364320] [2024-11-12 12:28:13,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:28:13,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:28:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:28:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:28:13,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:28:13,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6364320] [2024-11-12 12:28:13,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6364320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:28:13,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:28:13,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:28:13,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237224160] [2024-11-12 12:28:13,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:28:13,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:28:13,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:28:13,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:28:13,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:28:13,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 104 [2024-11-12 12:28:13,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 101 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:13,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:28:13,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 104 [2024-11-12 12:28:13,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:28:13,992 INFO L124 PetriNetUnfolderBase]: 8/165 cut-off events. [2024-11-12 12:28:13,992 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:28:13,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 165 events. 8/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 400 event pairs, 8 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 163. Up to 25 conditions per place. [2024-11-12 12:28:13,993 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 9 selfloop transitions, 1 changer transitions 0/99 dead transitions. [2024-11-12 12:28:13,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 224 flow [2024-11-12 12:28:13,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:28:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:28:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2024-11-12 12:28:13,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2024-11-12 12:28:13,994 INFO L175 Difference]: Start difference. First operand has 106 places, 101 transitions, 208 flow. Second operand 3 states and 288 transitions. [2024-11-12 12:28:13,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 224 flow [2024-11-12 12:28:13,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 99 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:28:13,996 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 202 flow [2024-11-12 12:28:13,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2024-11-12 12:28:13,996 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -3 predicate places. [2024-11-12 12:28:13,997 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 202 flow [2024-11-12 12:28:13,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:13,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:28:13,997 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:28:13,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:28:13,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-12 12:28:13,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:28:13,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1291684622, now seen corresponding path program 1 times [2024-11-12 12:28:13,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:28:13,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865963870] [2024-11-12 12:28:13,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:28:13,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:28:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:28:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:28:14,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:28:14,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865963870] [2024-11-12 12:28:14,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865963870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:28:14,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:28:14,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:28:14,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041297765] [2024-11-12 12:28:14,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:28:14,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:28:14,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:28:14,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:28:14,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:28:14,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 104 [2024-11-12 12:28:14,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:14,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:28:14,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 104 [2024-11-12 12:28:14,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:28:14,114 INFO L124 PetriNetUnfolderBase]: 16/249 cut-off events. [2024-11-12 12:28:14,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:28:14,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 249 events. 16/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 822 event pairs, 7 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 262. Up to 36 conditions per place. [2024-11-12 12:28:14,115 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 12 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-11-12 12:28:14,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 234 flow [2024-11-12 12:28:14,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:28:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:28:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2024-11-12 12:28:14,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9358974358974359 [2024-11-12 12:28:14,118 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 202 flow. Second operand 3 states and 292 transitions. [2024-11-12 12:28:14,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 234 flow [2024-11-12 12:28:14,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 101 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:28:14,121 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 211 flow [2024-11-12 12:28:14,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2024-11-12 12:28:14,122 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -3 predicate places. [2024-11-12 12:28:14,122 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 211 flow [2024-11-12 12:28:14,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:14,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:28:14,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:28:14,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:28:14,123 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-12 12:28:14,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:28:14,123 INFO L85 PathProgramCache]: Analyzing trace with hash 70069530, now seen corresponding path program 1 times [2024-11-12 12:28:14,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:28:14,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312721677] [2024-11-12 12:28:14,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:28:14,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:28:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:28:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:28:14,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:28:14,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312721677] [2024-11-12 12:28:14,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312721677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:28:14,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:28:14,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:28:14,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687659665] [2024-11-12 12:28:14,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:28:14,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:28:14,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:28:14,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:28:14,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:28:14,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 104 [2024-11-12 12:28:14,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:14,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:28:14,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 104 [2024-11-12 12:28:14,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:28:14,859 INFO L124 PetriNetUnfolderBase]: 231/839 cut-off events. [2024-11-12 12:28:14,859 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:28:14,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 839 events. 231/839 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4771 event pairs, 96 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 1321. Up to 348 conditions per place. [2024-11-12 12:28:14,864 INFO L140 encePairwiseOnDemand]: 88/104 looper letters, 51 selfloop transitions, 41 changer transitions 0/163 dead transitions. [2024-11-12 12:28:14,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 163 transitions, 523 flow [2024-11-12 12:28:14,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:28:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:28:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 549 transitions. [2024-11-12 12:28:14,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8798076923076923 [2024-11-12 12:28:14,866 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 211 flow. Second operand 6 states and 549 transitions. [2024-11-12 12:28:14,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 163 transitions, 523 flow [2024-11-12 12:28:14,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 163 transitions, 523 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:28:14,870 INFO L231 Difference]: Finished difference. Result has 113 places, 141 transitions, 469 flow [2024-11-12 12:28:14,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=469, PETRI_PLACES=113, PETRI_TRANSITIONS=141} [2024-11-12 12:28:14,872 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 6 predicate places. [2024-11-12 12:28:14,872 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 141 transitions, 469 flow [2024-11-12 12:28:14,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:14,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:28:14,872 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:28:14,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:28:14,873 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-12 12:28:14,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:28:14,873 INFO L85 PathProgramCache]: Analyzing trace with hash 87245971, now seen corresponding path program 1 times [2024-11-12 12:28:14,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:28:14,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726434555] [2024-11-12 12:28:14,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:28:14,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:28:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:28:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:28:15,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:28:15,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726434555] [2024-11-12 12:28:15,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726434555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:28:15,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:28:15,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:28:15,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430224524] [2024-11-12 12:28:15,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:28:15,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:28:15,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:28:15,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:28:15,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:28:15,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 104 [2024-11-12 12:28:15,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 141 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:15,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:28:15,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 104 [2024-11-12 12:28:15,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:28:15,393 INFO L124 PetriNetUnfolderBase]: 285/1134 cut-off events. [2024-11-12 12:28:15,393 INFO L125 PetriNetUnfolderBase]: For 318/367 co-relation queries the response was YES. [2024-11-12 12:28:15,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2402 conditions, 1134 events. 285/1134 cut-off events. For 318/367 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7589 event pairs, 29 based on Foata normal form. 31/1130 useless extension candidates. Maximal degree in co-relation 2361. Up to 272 conditions per place. [2024-11-12 12:28:15,399 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 71 selfloop transitions, 48 changer transitions 0/216 dead transitions. [2024-11-12 12:28:15,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 216 transitions, 971 flow [2024-11-12 12:28:15,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:28:15,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:28:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 579 transitions. [2024-11-12 12:28:15,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9278846153846154 [2024-11-12 12:28:15,400 INFO L175 Difference]: Start difference. First operand has 113 places, 141 transitions, 469 flow. Second operand 6 states and 579 transitions. [2024-11-12 12:28:15,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 216 transitions, 971 flow [2024-11-12 12:28:15,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 216 transitions, 971 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:28:15,407 INFO L231 Difference]: Finished difference. Result has 123 places, 187 transitions, 875 flow [2024-11-12 12:28:15,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=875, PETRI_PLACES=123, PETRI_TRANSITIONS=187} [2024-11-12 12:28:15,409 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 16 predicate places. [2024-11-12 12:28:15,409 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 187 transitions, 875 flow [2024-11-12 12:28:15,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:15,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:28:15,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:28:15,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:28:15,410 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-12 12:28:15,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:28:15,410 INFO L85 PathProgramCache]: Analyzing trace with hash -587936594, now seen corresponding path program 1 times [2024-11-12 12:28:15,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:28:15,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350752032] [2024-11-12 12:28:15,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:28:15,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:28:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:28:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:28:15,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:28:15,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350752032] [2024-11-12 12:28:15,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350752032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:28:15,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:28:15,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:28:15,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421210442] [2024-11-12 12:28:15,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:28:15,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:28:15,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:28:15,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:28:15,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:28:15,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 104 [2024-11-12 12:28:15,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 187 transitions, 875 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:15,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:28:15,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 104 [2024-11-12 12:28:15,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:28:15,522 INFO L124 PetriNetUnfolderBase]: 39/286 cut-off events. [2024-11-12 12:28:15,522 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-12 12:28:15,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 286 events. 39/286 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 967 event pairs, 4 based on Foata normal form. 2/275 useless extension candidates. Maximal degree in co-relation 499. Up to 64 conditions per place. [2024-11-12 12:28:15,523 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 2 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2024-11-12 12:28:15,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 120 transitions, 413 flow [2024-11-12 12:28:15,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:28:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:28:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2024-11-12 12:28:15,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967948717948718 [2024-11-12 12:28:15,524 INFO L175 Difference]: Start difference. First operand has 123 places, 187 transitions, 875 flow. Second operand 3 states and 302 transitions. [2024-11-12 12:28:15,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 120 transitions, 413 flow [2024-11-12 12:28:15,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 120 transitions, 363 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-11-12 12:28:15,528 INFO L231 Difference]: Finished difference. Result has 116 places, 120 transitions, 359 flow [2024-11-12 12:28:15,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=359, PETRI_PLACES=116, PETRI_TRANSITIONS=120} [2024-11-12 12:28:15,529 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 9 predicate places. [2024-11-12 12:28:15,529 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 120 transitions, 359 flow [2024-11-12 12:28:15,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:15,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:28:15,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:28:15,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:28:15,530 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-12 12:28:15,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:28:15,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1489826976, now seen corresponding path program 1 times [2024-11-12 12:28:15,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:28:15,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246323559] [2024-11-12 12:28:15,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:28:15,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:28:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:28:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:28:15,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:28:15,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246323559] [2024-11-12 12:28:15,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246323559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:28:15,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:28:15,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:28:15,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540238179] [2024-11-12 12:28:15,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:28:15,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:28:15,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:28:15,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:28:15,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:28:15,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 104 [2024-11-12 12:28:15,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 120 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:15,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:28:15,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 104 [2024-11-12 12:28:15,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:28:15,931 INFO L124 PetriNetUnfolderBase]: 93/482 cut-off events. [2024-11-12 12:28:15,931 INFO L125 PetriNetUnfolderBase]: For 90/103 co-relation queries the response was YES. [2024-11-12 12:28:15,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 482 events. 93/482 cut-off events. For 90/103 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2169 event pairs, 20 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 918. Up to 197 conditions per place. [2024-11-12 12:28:15,933 INFO L140 encePairwiseOnDemand]: 93/104 looper letters, 46 selfloop transitions, 22 changer transitions 0/141 dead transitions. [2024-11-12 12:28:15,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 141 transitions, 569 flow [2024-11-12 12:28:15,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:28:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:28:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 511 transitions. [2024-11-12 12:28:15,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8189102564102564 [2024-11-12 12:28:15,936 INFO L175 Difference]: Start difference. First operand has 116 places, 120 transitions, 359 flow. Second operand 6 states and 511 transitions. [2024-11-12 12:28:15,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 141 transitions, 569 flow [2024-11-12 12:28:15,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 141 transitions, 565 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:28:15,939 INFO L231 Difference]: Finished difference. Result has 125 places, 141 transitions, 537 flow [2024-11-12 12:28:15,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=537, PETRI_PLACES=125, PETRI_TRANSITIONS=141} [2024-11-12 12:28:15,941 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 18 predicate places. [2024-11-12 12:28:15,942 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 141 transitions, 537 flow [2024-11-12 12:28:15,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:15,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:28:15,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:28:15,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:28:15,943 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-12 12:28:15,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:28:15,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1812481170, now seen corresponding path program 1 times [2024-11-12 12:28:15,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:28:15,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347850237] [2024-11-12 12:28:15,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:28:15,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:28:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:28:16,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:28:16,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:28:16,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347850237] [2024-11-12 12:28:16,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347850237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:28:16,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:28:16,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:28:16,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973448479] [2024-11-12 12:28:16,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:28:16,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:28:16,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:28:16,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:28:16,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:28:16,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 104 [2024-11-12 12:28:16,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 141 transitions, 537 flow. Second operand has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:16,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:28:16,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 104 [2024-11-12 12:28:16,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:28:16,365 INFO L124 PetriNetUnfolderBase]: 195/735 cut-off events. [2024-11-12 12:28:16,366 INFO L125 PetriNetUnfolderBase]: For 309/316 co-relation queries the response was YES. [2024-11-12 12:28:16,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1830 conditions, 735 events. 195/735 cut-off events. For 309/316 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4008 event pairs, 12 based on Foata normal form. 0/713 useless extension candidates. Maximal degree in co-relation 1782. Up to 295 conditions per place. [2024-11-12 12:28:16,369 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 56 selfloop transitions, 52 changer transitions 13/198 dead transitions. [2024-11-12 12:28:16,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 198 transitions, 1044 flow [2024-11-12 12:28:16,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:28:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:28:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 555 transitions. [2024-11-12 12:28:16,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8894230769230769 [2024-11-12 12:28:16,371 INFO L175 Difference]: Start difference. First operand has 125 places, 141 transitions, 537 flow. Second operand 6 states and 555 transitions. [2024-11-12 12:28:16,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 198 transitions, 1044 flow [2024-11-12 12:28:16,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 198 transitions, 1006 flow, removed 19 selfloop flow, removed 0 redundant places. [2024-11-12 12:28:16,375 INFO L231 Difference]: Finished difference. Result has 135 places, 181 transitions, 952 flow [2024-11-12 12:28:16,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=952, PETRI_PLACES=135, PETRI_TRANSITIONS=181} [2024-11-12 12:28:16,376 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 28 predicate places. [2024-11-12 12:28:16,376 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 181 transitions, 952 flow [2024-11-12 12:28:16,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:16,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:28:16,377 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:28:16,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:28:16,377 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-12 12:28:16,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:28:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1380146183, now seen corresponding path program 1 times [2024-11-12 12:28:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:28:16,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648829303] [2024-11-12 12:28:16,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:28:16,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:28:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:28:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:28:16,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:28:16,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648829303] [2024-11-12 12:28:16,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648829303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:28:16,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:28:16,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 12:28:16,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382651684] [2024-11-12 12:28:16,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:28:16,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 12:28:16,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:28:16,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 12:28:16,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-12 12:28:17,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 104 [2024-11-12 12:28:17,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 181 transitions, 952 flow. Second operand has 12 states, 12 states have (on average 68.25) internal successors, (819), 12 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:17,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:28:17,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 104 [2024-11-12 12:28:17,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:28:17,404 INFO L124 PetriNetUnfolderBase]: 189/697 cut-off events. [2024-11-12 12:28:17,404 INFO L125 PetriNetUnfolderBase]: For 722/762 co-relation queries the response was YES. [2024-11-12 12:28:17,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 697 events. 189/697 cut-off events. For 722/762 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3753 event pairs, 18 based on Foata normal form. 21/711 useless extension candidates. Maximal degree in co-relation 2145. Up to 193 conditions per place. [2024-11-12 12:28:17,410 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 115 selfloop transitions, 39 changer transitions 20/235 dead transitions. [2024-11-12 12:28:17,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 235 transitions, 1684 flow [2024-11-12 12:28:17,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 12:28:17,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-12 12:28:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 998 transitions. [2024-11-12 12:28:17,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6854395604395604 [2024-11-12 12:28:17,414 INFO L175 Difference]: Start difference. First operand has 135 places, 181 transitions, 952 flow. Second operand 14 states and 998 transitions. [2024-11-12 12:28:17,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 235 transitions, 1684 flow [2024-11-12 12:28:17,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 235 transitions, 1633 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-11-12 12:28:17,427 INFO L231 Difference]: Finished difference. Result has 151 places, 189 transitions, 1096 flow [2024-11-12 12:28:17,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1096, PETRI_PLACES=151, PETRI_TRANSITIONS=189} [2024-11-12 12:28:17,428 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 44 predicate places. [2024-11-12 12:28:17,429 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 189 transitions, 1096 flow [2024-11-12 12:28:17,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 68.25) internal successors, (819), 12 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:17,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:28:17,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:28:17,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:28:17,431 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-12 12:28:17,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:28:17,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1024159188, now seen corresponding path program 1 times [2024-11-12 12:28:17,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:28:17,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118974783] [2024-11-12 12:28:17,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:28:17,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:28:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:28:17,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:28:17,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:28:17,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118974783] [2024-11-12 12:28:17,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118974783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:28:17,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:28:17,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 12:28:17,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180503599] [2024-11-12 12:28:17,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:28:17,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 12:28:17,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:28:17,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 12:28:17,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-12 12:28:18,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 104 [2024-11-12 12:28:18,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 189 transitions, 1096 flow. Second operand has 12 states, 12 states have (on average 74.75) internal successors, (897), 12 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:18,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:28:18,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 104 [2024-11-12 12:28:18,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:28:18,450 INFO L124 PetriNetUnfolderBase]: 175/639 cut-off events. [2024-11-12 12:28:18,451 INFO L125 PetriNetUnfolderBase]: For 1067/1101 co-relation queries the response was YES. [2024-11-12 12:28:18,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2249 conditions, 639 events. 175/639 cut-off events. For 1067/1101 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3310 event pairs, 4 based on Foata normal form. 23/660 useless extension candidates. Maximal degree in co-relation 2220. Up to 126 conditions per place. [2024-11-12 12:28:18,454 INFO L140 encePairwiseOnDemand]: 86/104 looper letters, 87 selfloop transitions, 68 changer transitions 11/235 dead transitions. [2024-11-12 12:28:18,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 235 transitions, 1801 flow [2024-11-12 12:28:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 12:28:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-12 12:28:18,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1035 transitions. [2024-11-12 12:28:18,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7655325443786982 [2024-11-12 12:28:18,456 INFO L175 Difference]: Start difference. First operand has 151 places, 189 transitions, 1096 flow. Second operand 13 states and 1035 transitions. [2024-11-12 12:28:18,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 235 transitions, 1801 flow [2024-11-12 12:28:18,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 235 transitions, 1759 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-11-12 12:28:18,465 INFO L231 Difference]: Finished difference. Result has 158 places, 197 transitions, 1388 flow [2024-11-12 12:28:18,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1388, PETRI_PLACES=158, PETRI_TRANSITIONS=197} [2024-11-12 12:28:18,465 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 51 predicate places. [2024-11-12 12:28:18,466 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 197 transitions, 1388 flow [2024-11-12 12:28:18,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 74.75) internal successors, (897), 12 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:18,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:28:18,466 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:28:18,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:28:18,467 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-12 12:28:18,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:28:18,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1647267624, now seen corresponding path program 1 times [2024-11-12 12:28:18,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:28:18,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420051456] [2024-11-12 12:28:18,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:28:18,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:28:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:28:18,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:28:18,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:28:18,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420051456] [2024-11-12 12:28:18,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420051456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:28:18,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:28:18,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 12:28:18,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081484245] [2024-11-12 12:28:18,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:28:18,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 12:28:18,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:28:18,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 12:28:18,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-12 12:28:19,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 104 [2024-11-12 12:28:19,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 197 transitions, 1388 flow. Second operand has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:19,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:28:19,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 104 [2024-11-12 12:28:19,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:28:19,378 INFO L124 PetriNetUnfolderBase]: 170/661 cut-off events. [2024-11-12 12:28:19,378 INFO L125 PetriNetUnfolderBase]: For 2024/2103 co-relation queries the response was YES. [2024-11-12 12:28:19,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 661 events. 170/661 cut-off events. For 2024/2103 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3544 event pairs, 15 based on Foata normal form. 43/698 useless extension candidates. Maximal degree in co-relation 2531. Up to 192 conditions per place. [2024-11-12 12:28:19,382 INFO L140 encePairwiseOnDemand]: 90/104 looper letters, 122 selfloop transitions, 35 changer transitions 12/231 dead transitions. [2024-11-12 12:28:19,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 231 transitions, 2092 flow [2024-11-12 12:28:19,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 12:28:19,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-12 12:28:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1125 transitions. [2024-11-12 12:28:19,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6760817307692307 [2024-11-12 12:28:19,385 INFO L175 Difference]: Start difference. First operand has 158 places, 197 transitions, 1388 flow. Second operand 16 states and 1125 transitions. [2024-11-12 12:28:19,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 231 transitions, 2092 flow [2024-11-12 12:28:19,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 231 transitions, 2062 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-12 12:28:19,397 INFO L231 Difference]: Finished difference. Result has 168 places, 193 transitions, 1394 flow [2024-11-12 12:28:19,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1394, PETRI_PLACES=168, PETRI_TRANSITIONS=193} [2024-11-12 12:28:19,397 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 61 predicate places. [2024-11-12 12:28:19,398 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 193 transitions, 1394 flow [2024-11-12 12:28:19,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:19,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:28:19,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:28:19,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:28:19,398 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-12 12:28:19,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:28:19,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2132507222, now seen corresponding path program 2 times [2024-11-12 12:28:19,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:28:19,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204298896] [2024-11-12 12:28:19,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:28:19,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:28:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:28:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:28:19,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:28:19,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204298896] [2024-11-12 12:28:19,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204298896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:28:19,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:28:19,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 12:28:19,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231291123] [2024-11-12 12:28:19,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:28:19,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 12:28:19,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:28:19,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 12:28:19,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-12 12:28:19,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 104 [2024-11-12 12:28:19,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 193 transitions, 1394 flow. Second operand has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:19,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:28:19,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 104 [2024-11-12 12:28:19,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:28:20,257 INFO L124 PetriNetUnfolderBase]: 165/646 cut-off events. [2024-11-12 12:28:20,257 INFO L125 PetriNetUnfolderBase]: For 2108/2139 co-relation queries the response was YES. [2024-11-12 12:28:20,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 646 events. 165/646 cut-off events. For 2108/2139 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3426 event pairs, 15 based on Foata normal form. 13/653 useless extension candidates. Maximal degree in co-relation 2560. Up to 192 conditions per place. [2024-11-12 12:28:20,263 INFO L140 encePairwiseOnDemand]: 90/104 looper letters, 118 selfloop transitions, 34 changer transitions 10/224 dead transitions. [2024-11-12 12:28:20,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 224 transitions, 2062 flow [2024-11-12 12:28:20,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 12:28:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-12 12:28:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1186 transitions. [2024-11-12 12:28:20,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.670814479638009 [2024-11-12 12:28:20,265 INFO L175 Difference]: Start difference. First operand has 168 places, 193 transitions, 1394 flow. Second operand 17 states and 1186 transitions. [2024-11-12 12:28:20,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 224 transitions, 2062 flow [2024-11-12 12:28:20,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 224 transitions, 1976 flow, removed 4 selfloop flow, removed 15 redundant places. [2024-11-12 12:28:20,280 INFO L231 Difference]: Finished difference. Result has 165 places, 188 transitions, 1339 flow [2024-11-12 12:28:20,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1339, PETRI_PLACES=165, PETRI_TRANSITIONS=188} [2024-11-12 12:28:20,281 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 58 predicate places. [2024-11-12 12:28:20,281 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 188 transitions, 1339 flow [2024-11-12 12:28:20,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:28:20,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:28:20,282 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:28:20,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:28:20,282 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-12 12:28:20,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:28:20,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1762241086, now seen corresponding path program 1 times [2024-11-12 12:28:20,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:28:20,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993483834] [2024-11-12 12:28:20,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:28:20,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:28:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:28:20,306 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:28:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:28:20,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 12:28:20,343 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:28:20,344 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2024-11-12 12:28:20,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-11-12 12:28:20,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-11-12 12:28:20,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-11-12 12:28:20,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-11-12 12:28:20,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-11-12 12:28:20,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2024-11-12 12:28:20,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-11-12 12:28:20,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-11-12 12:28:20,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-11-12 12:28:20,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-11-12 12:28:20,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-11-12 12:28:20,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-11-12 12:28:20,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-11-12 12:28:20,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-11-12 12:28:20,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:28:20,358 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:28:20,412 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 12:28:20,412 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:28:20,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:28:20 BasicIcfg [2024-11-12 12:28:20,419 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:28:20,420 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:28:20,420 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:28:20,420 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:28:20,422 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:28:13" (3/4) ... [2024-11-12 12:28:20,423 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-12 12:28:20,461 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 12:28:20,461 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:28:20,462 INFO L158 Benchmark]: Toolchain (without parser) took 8295.40ms. Allocated memory was 192.9MB in the beginning and 360.7MB in the end (delta: 167.8MB). Free memory was 122.1MB in the beginning and 311.3MB in the end (delta: -189.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:28:20,462 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 192.9MB. Free memory is still 169.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:28:20,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 620.04ms. Allocated memory is still 192.9MB. Free memory was 122.0MB in the beginning and 125.0MB in the end (delta: -3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 12:28:20,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.70ms. Allocated memory is still 192.9MB. Free memory was 125.0MB in the beginning and 122.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:28:20,462 INFO L158 Benchmark]: Boogie Preprocessor took 37.60ms. Allocated memory is still 192.9MB. Free memory was 122.8MB in the beginning and 120.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:28:20,462 INFO L158 Benchmark]: RCFGBuilder took 341.43ms. Allocated memory is still 192.9MB. Free memory was 120.8MB in the beginning and 102.7MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 12:28:20,463 INFO L158 Benchmark]: TraceAbstraction took 7201.31ms. Allocated memory was 192.9MB in the beginning and 360.7MB in the end (delta: 167.8MB). Free memory was 101.9MB in the beginning and 318.7MB in the end (delta: -216.7MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. [2024-11-12 12:28:20,463 INFO L158 Benchmark]: Witness Printer took 41.71ms. Allocated memory is still 360.7MB. Free memory was 318.7MB in the beginning and 311.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 12:28:20,464 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 192.9MB. Free memory is still 169.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 620.04ms. Allocated memory is still 192.9MB. Free memory was 122.0MB in the beginning and 125.0MB in the end (delta: -3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.70ms. Allocated memory is still 192.9MB. Free memory was 125.0MB in the beginning and 122.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.60ms. Allocated memory is still 192.9MB. Free memory was 122.8MB in the beginning and 120.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 341.43ms. Allocated memory is still 192.9MB. Free memory was 120.8MB in the beginning and 102.7MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7201.31ms. Allocated memory was 192.9MB in the beginning and 360.7MB in the end (delta: 167.8MB). Free memory was 101.9MB in the beginning and 318.7MB in the end (delta: -216.7MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. * Witness Printer took 41.71ms. Allocated memory is still 360.7MB. Free memory was 318.7MB in the beginning and 311.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1243]: Data race detected Data race detected The following path leads to a data race: [L1223] 0 int *x; VAL [x={0:0}] [L1224] 0 int *y; VAL [x={0:0}, y={0:0}] [L1225] 0 pthread_mutex_t m = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [m={1:0}, x={0:0}, y={0:0}] [L1234] 0 pthread_t id; VAL [m={1:0}, x={0:0}, y={0:0}] [L1235] 0 int *z; VAL [m={1:0}, x={0:0}, y={0:0}] [L1236] 0 x = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={0:0}] [L1237] 0 y = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={-3:0}] [L1238] 0 z = y VAL [m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1239] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1241] EXPR 0 *x VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1241] EXPR 0 \read(*x) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1241] 0 printf("%d\n",*x) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1228] EXPR 1 *x VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1228] 1 *x = 3 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1243] EXPR 0 \read(*z) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1229] EXPR 1 *y VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1229] 1 *y = 8 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1243] 0 printf("%d\n",*z) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: x = malloc(sizeof(int)) [1236] * C: *x = 3 [1228] * C: y = malloc(sizeof(int)) [1237] * C: *x = 3 [1228] * C: *x = 3 [1228] * C: *y = 8 [1229] * C: *x = 3 [1228] and C: printf("%d\n",*z) [1243] - UnprovableResult [Line: 1236]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 138 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1436 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1129 mSDsluCounter, 1258 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1195 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5066 IncrementalHoareTripleChecker+Invalid, 5298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 63 mSDtfsCounter, 5066 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1394occurred in iteration=12, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 759 NumberOfCodeBlocks, 759 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 668 ConstructedInterpolants, 0 QuantifiedInterpolants, 2320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-12 12:28:20,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE